|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 51 occurrences of 49 keywords
|
|
|
Results
Found 134 publication records. Showing 134 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
54 | Omer Reingold |
Undirected connectivity in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(4), pp. 17:1-17:24, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded space algorithms, Derandomization, pseudorandom generator |
54 | Omer Reingold |
Undirected ST-connectivity in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 376-385, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Richard D. Regan, Alex Delis |
An Analysis of Main-Memory and Log Space Usage in Extended Ephemeral Logging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BNCOD ![In: Advances in Databases, 18th British National Conference on Databases, BNCOD 18, Chilton, UK, July 9-11, 2001, Proceedings, pp. 24-42, 2001, Springer, 3-540-42265-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
48 | Joe Kilian |
Zero-knowledge with Log-Space Verifiers ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 25-35, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
language-recognition, log-space verifiers, probabilistic log-space automata, exponential-time languages, protocols, zero knowledge, interactive proof systems |
44 | Fuxiang Yu |
On the Representations of NC and Log-Space Real Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 318-326, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
representations of real numbers, Cauchy function, left cut, P, Log-space, Complexity, expressive power, NC |
38 | Ioan I. Macarie |
On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 583-596, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
35 | Christian Glaßer |
Space-Efficient Informational Redundancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 448-459, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
How to meet when you forget: log-space rendezvous in arbitrary graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 450-459, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
exploration, rendezvous, compact data structure |
29 | Burkhard Monien, Ivan Hal Sudborough |
Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings, pp. 78-93, 1981, Springer, 3-540-10856-4. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
28 | Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum |
Delegating computation: interactive proofs for muggles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 113-122, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
muggles, delegation, interactive proofs |
26 | Eric Allender, David A. Mix Barrington, William Hesse |
Uniform Circuits for Division: Consequences and Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 150-159, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Richard J. Lipton, Anastasios Viglas |
On the Complexity of SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 459-464, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
time-space, log-space uniform circuits, lower bounds, satisfiability |
22 | Clifford Bergman, Giora Slutzki |
Computational Complexity of Some Problems Involving Congruences on Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 168-174, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
fully invariant, subdirectly irreducible, nondeterministic log-space, nondeterministic polynomial time, congruence, simple |
22 | Steven Perron |
A Propositional Proof System for Log Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 509-524, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Michal Koucký 0001 |
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03). ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 11-20, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Kalina Jasinska, Nikos Karampatziakis |
Log-time and Log-space Extreme Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.01964, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Ivan Hal Sudborough |
The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980, pp. 293-305, 1980, Springer, 3-540-10291-4. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
20 | Kamal Ali, Mark Scarr |
Robust methodologies for modeling web click distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8-12, 2007, pp. 511-520, 2007, ACM, 978-1-59593-654-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
distribution fitting |
20 | Burkhard Monien, Ivan Hal Sudborough |
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 431-445, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
17 | Takumi Kasai, Akeo Adachi, Shigeki Iwata |
Classes of pebble games and complete problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Annual Conference (2) ![In: Proceedings 1978 ACM Annual Conference, Washington, DC, USA, December 4-6, 1978, Volume II, pp. 914-918, 1978, ACM, 978-0-89791-000-2. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
Exponential time, Log-space, Two-person game, Winning strategy, Polynomial time, Turing machine, NP, Pebble game, Polynomial space |
17 | Thomas Thierauf, Fabian Wagner |
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings, pp. 323-334, 2009, Springer, 978-3-642-03408-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Michael T. Goodrich, Jonathan Z. Sun |
Checking Value-Sensitive Data Structures in Sublinear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 353-364, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Anders Dessmark, Andrzej Lingas, Anil Maheshwari |
Multi-List Ranking: Complexity and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 306-316, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
13 | Ming-Hsiu Lai, Ming-Feng Yu, Sau-Gee Chen |
An efficient modified Phong shading algorithm & its low-complexity realization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (4) ![In: Proceedings of the 2002 International Symposium on Circuits and Systems, ISCAS 2002, Scottsdale, Arizona, USA, May 26-29, 2002, pp. 201-204, 2002, IEEE, 0-7803-7448-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
13 | Patrick W. Dymond, Walter L. Ruzzo |
Parallel RAMs with owned global memory and deterministic context-free language recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(1), pp. 16-45, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
CROW-PRAM, DCFL recognition, owner write, parallel algorithms |
13 | Edward Pyne, Ran Raz, Wei Zhan |
Certified Hardness vs. Randomness for Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
13 | Rafael Pass, Oren Renard |
Characterizing the Power of (Persistent) Randomness in Log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
13 | Edward Pyne, Ran Raz, Wei Zhan |
Certified Hardness vs. Randomness for Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.16413, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Edward Pyne, Ran Raz, Wei Zhan |
Certified Hardness vs. Randomness for Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 989-1007, 2023, IEEE, 979-8-3503-1894-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Matthew Pitkin |
lintegrate: A C/Python numerical integration library for working in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Open Source Softw. ![In: J. Open Source Softw. 7(74), pp. 4231, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Planar Graph Isomorphism Is in Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 14(2), pp. 8:1-8:33, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Hui Sun 0002, Jianzhong Huang 0001, Xiao Qin 0001, Changsheng Xie |
DLSpace: Optimizing SSD Lifetime via An Efficient Distributed Log Space Allocation Strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 17(6), pp. 92:1-92:33, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Ofer Grossman, Yang P. Liu |
Reproducibility and Pseudo-Determinism in Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 606-620, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Ofer Grossman, Yang P. Liu |
Reproducibility and Pseudo-Determinism in Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | |
Derandomizing the Lovasz Local Lemma via log-space statistical tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.06672, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Ofer Grossman, Yang P. Liu |
Reproducibility and Pseudo-Determinism in Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.04025, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Alexei Miasnikov, Svetla Vassileva |
Log-space conjugacy problem in the Grigorchuk group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Groups Complex. Cryptol. ![In: Groups Complex. Cryptol. 9(1), pp. 77, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Han-Jung Chou, Pei-Li Kuo, Jing-Sin Liu |
Numerical streamline path planning based on log-space harmonic potential function: A simulation study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RCAR ![In: 2017 IEEE International Conference on Real-time Computing and Robotics, RCAR 2017, Okinawa, Japan, July 14-18, 2017, pp. 535-542, 2017, IEEE, 978-1-5386-2035-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Kyle Hollins Wray, Dirk Ruiken, Roderic A. Grupen, Shlomo Zilberstein |
Log-space harmonic function path planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2016, Daejeon, South Korea, October 9-14, 2016, pp. 1511-1516, 2016, IEEE, 978-1-5090-3762-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Anant Dhayal, Jayalal Sarma, Saurabh Sawlani |
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, pp. 597-609, 2014, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-77-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Wen-Ju Cheng |
Randomized Search of Graphs in Log Space and Probabilistic Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
13 | Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek |
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
13 | Bireswar Das, Samir Datta, Prajakta Nimbhorkar |
Log-Space Algorithms for Paths and Matchings in k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 53(4), pp. 669-689, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Abuzer Yakaryilmaz |
Log-space counter is useful for unary languages by help of a constant-size quantum register. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1309.4767, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
13 | Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek |
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I, pp. 473-484, 2013, Springer, 978-3-642-39205-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
13 | Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran |
On the power of unambiguity in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 21(4), pp. 643-670, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
How to meet when you forget: log-space rendezvous in arbitrary graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 25(2), pp. 165-178, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
13 | Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky 0001 |
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1202.4406, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
13 | Abuzer Yakaryilmaz, A. C. Cem Say |
NP has log-space verifiers with fixed-size public quantum registers ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1101.5227, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
13 | Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar |
Longest Paths in Planar DAGs in Unambiguous Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Chic. J. Theor. Comput. Sci. ![In: Chic. J. Theor. Comput. Sci. 2010, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
13 | Ajesh Babu, Nutan Limaye, Girish Varma |
Streaming algorithms for some problems in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
13 | Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Graph Isomorphism for K3,3-free and K5-free graphs is in Log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
13 | Hiroaki Kotera |
Image Color Mapping in Complex Log Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIC ![In: 18th Color and Imaging Conference, CIC 2010, San Antonio, Texas, USA, November 8-12, 2010, pp. 172-177, 2010, Society for Imaging Science and Technology, 978-0-89208-294-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
13 | Ajesh Babu, Nutan Limaye, Girish Varma |
Streaming Algorithms for Some Problems in Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings, pp. 94-104, 2010, Springer, 978-3-642-13561-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
13 | Bireswar Das, Samir Datta, Prajakta Nimbhorkar |
Log-space Algorithms for Paths and Matchings in k-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France, pp. 215-226, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
13 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 131-138, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
acyclic digraph, logspace algorithm, planar graph, reachability |
13 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A log-space algorithm for reachability in planar DAGs with few sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR09, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
13 | Fabian Wagner, Thomas Thierauf |
Reachability in K3,3-free Graphs and K5-free Graphs is in Unambiguous Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR09, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
13 | Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf |
Planar Graph Isomorphism is in Log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR09, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
13 | Bireswar Das, Samir Datta, Prajakta Nimbhorkar |
Log-space Algorithms for Paths and Matchings in k-trees ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0912.4602, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
13 | Chris Bourke, Raghunath Tewari, N. V. Vinodchandran |
Directed Planar Reachability Is in Unambiguous Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 1(1), pp. 4:1-4:17, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Planar Graph Isomorphism is in Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algebraic Methods in Computational Complexity ![In: Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
13 | Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India, pp. 145-156, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-13-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
Planar Graph Isomorphism is in Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009, pp. 203-214, 2009, IEEE Computer Society, 978-0-7695-3717-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar |
3-connected Planar Graph Isomorphism is in Log-space ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.1041, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
13 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner |
A Log-space Algorithm for Canonization of Planar Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0809.2319, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
13 | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar |
3-connected Planar Graph Isomorphism is in Log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India, pp. 155-162, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
13 | Chris Bourke, Raghunath Tewari, N. V. Vinodchandran |
Directed Planar Reachability is in Unambiguous Log-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 217-221, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | Omer Reingold |
Undirected ST-Connectivity in Log-Space ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR04, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
13 | Michael Szydlo |
Merkle Tree Traversal in Log Space and Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings, pp. 541-554, 2004, Springer, 3-540-21935-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
authentication path, tail zipping, fractal traversal, binary tree, pebbling, Merkle tree, amortization |
13 | Chris Pollett |
A theory for Log-Space and NLIN versus coNLIN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 68(4), pp. 1082-1090, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Michal Koucký 0001 |
Log-space constructible universal traversal sequences for cycles of length O(n4.03). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 296(1), pp. 117-144, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
13 | Michal Koucký 0001 |
Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR01, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
13 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Log-Space Polynomial End-to-End Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 27(6), pp. 1531-1549, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
13 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Log-Space Polynomial End-to-End Communication (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, August 20-23, 1995, pp. 254, 1995, ACM, 0-89791-710-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
13 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Log-space polynomial end-to-end communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA, pp. 559-568, 1995, ACM, 0-89791-718-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
13 | Carme Àlvarez, Birgit Jenner |
A Very Hard log-Space Counting Class. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 107(1), pp. 3-30, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
13 | Maria J. Serna |
Approximating Linear Programming is Log-Space Complete for P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 37(4), pp. 233-236, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
13 | Seinosuke Toda |
Positive Relativizations for Log Space Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 77(3), pp. 221-235, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
13 | Carme Àlvarez, Birgit Jenner |
A Very Hard Log Space Counting Class. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings: Fifth Annual Structure in Complexity Theory Conference, Universitat Politècnica de Catalunya, Barcelona, Spain, July 8-11, 1990, pp. 154-168, 1990, IEEE Computer Society, 0-8186-2072-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
13 | Lefteris M. Kirousis, Paul G. Spirakis |
Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 163-175, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
13 | Shigeki Iwata, Takumi Kasai |
Simultaneous (Poly-Time, Log-Space) Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 54, pp. 325-329, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
13 | Takumi Kasai, Shigeki Iwata |
Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 18(2), pp. 153-170, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
13 | Marek Ejsmont |
On the log-space reducibility among array languages /preliminary version/. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Computation Theory ![In: Computation Theory - Fifth Symposium, Zaborów, Poland, December 3-8, 1984, Proceedings, pp. 80-90, 1984, Springer, 978-3-540-16066-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
13 | Walter J. Savitch |
A Note on Relativized Log Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 16(4), pp. 229-235, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
13 | Leslie M. Goldschlager, Ralph A. Shaw, John Staples |
The Maximum Flow Problem is Log Space Complete for P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 21, pp. 105-111, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
13 | David P. Dobkin, Richard J. Lipton, Steven P. Reiss |
Linear Programming is Log-Space Hard for P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 8(2), pp. 96-97, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
13 | Nancy A. Lynch |
Log Space Machines with Multiple Oracle Tapes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 6, pp. 25-39, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
13 | Nancy A. Lynch |
Log Space Recognition and Translation of Parenthesis Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 24(4), pp. 583-590, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
13 | Leslie M. Goldschlager |
The monotone and planar circuit value problems are log space complete for P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 9(2), pp. 25-29, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
13 | Richard E. Ladner, Nancy A. Lynch |
Relativization of Questions About Log Space Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 10, pp. 19-32, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
13 | Richard E. Ladner |
The circuit value problem is log space complete for P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 7(1), pp. 18-20, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
13 | Richard J. Lipton, Nancy A. Lynch |
A quantifier characterization for nondeterministic log space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 7(4), pp. 24-25, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
13 | John Lind, Albert R. Meyer |
A characterization of log-space computable functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 5(3), pp. 26-29, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
12 | Meena Mahajan, B. V. Raghavendra Rao |
Small-Space Analogues of Valiant's Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings, pp. 250-261, 2009, Springer, 978-3-642-03408-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom walks on regular digraphs and the RL vs. L problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 457-466, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
universal traversal sequence, zig-zag product, derandomization, expander graphs, mixing time, space-bounded computation |
12 | Jun Tarui, Seinosuke Toda |
Some Observations on the Computational Complexity of Graph Accessibility Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 18-30, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
12 | Thomas Zeugmann |
Computing Large Polynomial Powers Very Fast in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 538-544, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
12 | Michael Mñuk |
A Div(n) Depth Boolean Circuit for Smooth Modular Inverse. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMYCS ![In: Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990, Proceedings, pp. 177-183, 1990, Springer, 3-540-53414-8. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
10 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Space Efficient Algorithms for Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 339-352, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 134 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|