The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Log-space (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1973-1981 (15) 1982-1990 (20) 1991-2000 (18) 2001-2004 (17) 2005-2008 (19) 2009-2010 (20) 2011-2018 (17) 2019-2023 (8)
Publication types (Num. hits)
article(53) inproceedings(80) phdthesis(1)
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
54Omer Reingold Undirected connectivity in log-space. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF bounded space algorithms, Derandomization, pseudorandom generator
54Omer Reingold Undirected ST-connectivity in log-space. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
49Richard D. Regan, Alex Delis An Analysis of Main-Memory and Log Space Usage in Extended Ephemeral Logging. Search on Bibsonomy BNCOD The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
48Joe Kilian Zero-knowledge with Log-Space Verifiers Search on Bibsonomy FOCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF language-recognition, log-space verifiers, probabilistic log-space automata, exponential-time languages, protocols, zero knowledge, interactive proof systems
44Fuxiang Yu On the Representations of NC and Log-Space Real Numbers. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF representations of real numbers, Cauchy function, left cut, P, Log-space, Complexity, expressive power, NC
38Ioan I. Macarie On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
35Christian Glaßer Space-Efficient Informational Redundancy. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc How to meet when you forget: log-space rendezvous in arbitrary graphs. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF exploration, rendezvous, compact data structure
29Burkhard Monien, Ivan Hal Sudborough Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). Search on Bibsonomy MFCS The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
28Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum Delegating computation: interactive proofs for muggles. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF muggles, delegation, interactive proofs
26Eric Allender, David A. Mix Barrington, William Hesse Uniform Circuits for Division: Consequences and Problems. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
25Richard J. Lipton, Anastasios Viglas On the Complexity of SAT. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF time-space, log-space uniform circuits, lower bounds, satisfiability
22Clifford Bergman, Giora Slutzki Computational Complexity of Some Problems Involving Congruences on Algebras. Search on Bibsonomy LICS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF fully invariant, subdirectly irreducible, nondeterministic log-space, nondeterministic polynomial time, congruence, simple
22Steven Perron A Propositional Proof System for Log Space. Search on Bibsonomy CSL The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
22Michal Koucký 0001 Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03). Search on Bibsonomy COCOON The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
21Kalina Jasinska, Nikos Karampatziakis Log-time and Log-space Extreme Classification. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
21Ivan Hal Sudborough The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. Search on Bibsonomy WG The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
20Kamal Ali, Mark Scarr Robust methodologies for modeling web click distributions. Search on Bibsonomy WWW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF distribution fitting
20Burkhard Monien, Ivan Hal Sudborough On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. Search on Bibsonomy ICALP The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
17Takumi Kasai, Akeo Adachi, Shigeki Iwata Classes of pebble games and complete problems. Search on Bibsonomy ACM Annual Conference (2) The full citation details ... 1978 DBLP  DOI  BibTeX  RDF Exponential time, Log-space, Two-person game, Winning strategy, Polynomial time, Turing machine, NP, Pebble game, Polynomial space
17Thomas Thierauf, Fabian Wagner Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
17Michael T. Goodrich, Jonathan Z. Sun Checking Value-Sensitive Data Structures in Sublinear Space. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
14Anders Dessmark, Andrzej Lingas, Anil Maheshwari Multi-List Ranking: Complexity and Applications. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
13Ming-Hsiu Lai, Ming-Feng Yu, Sau-Gee Chen An efficient modified Phong shading algorithm & its low-complexity realization. Search on Bibsonomy ISCAS (4) The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Patrick W. Dymond, Walter L. Ruzzo Parallel RAMs with owned global memory and deterministic context-free language recognition. Search on Bibsonomy J. ACM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF CROW-PRAM, DCFL recognition, owner write, parallel algorithms
13Edward Pyne, Ran Raz, Wei Zhan Certified Hardness vs. Randomness for Log-Space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
13Rafael Pass, Oren Renard Characterizing the Power of (Persistent) Randomness in Log-space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
13Edward Pyne, Ran Raz, Wei Zhan Certified Hardness vs. Randomness for Log-Space. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
13Edward Pyne, Ran Raz, Wei Zhan Certified Hardness vs. Randomness for Log-Space. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
13Matthew Pitkin lintegrate: A C/Python numerical integration library for working in log-space. Search on Bibsonomy J. Open Source Softw. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
13Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner Planar Graph Isomorphism Is in Log-Space. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
13Hui 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 ACM Trans. Embed. Comput. Syst. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
13Ofer Grossman, Yang P. Liu Reproducibility and Pseudo-Determinism in Log-Space. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
13Ofer Grossman, Yang P. Liu Reproducibility and Pseudo-Determinism in Log-Space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2018 DBLP  BibTeX  RDF
13 Derandomizing the Lovasz Local Lemma via log-space statistical tests. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
13Ofer Grossman, Yang P. Liu Reproducibility and Pseudo-Determinism in Log-Space. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
13Alexei Miasnikov, Svetla Vassileva Log-space conjugacy problem in the Grigorchuk group. Search on Bibsonomy Groups Complex. Cryptol. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
13Han-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 RCAR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
13Kyle Hollins Wray, Dirk Ruiken, Roderic A. Grupen, Shlomo Zilberstein Log-space harmonic function path planning. Search on Bibsonomy IROS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
13Anant Dhayal, Jayalal Sarma, Saurabh Sawlani Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. Search on Bibsonomy FSTTCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
13Wen-Ju Cheng Randomized Search of Graphs in Log Space and Probabilistic Computation. Search on Bibsonomy 2014   RDF
13Christian 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 Electron. Colloquium Comput. Complex. The full citation details ... 2013 DBLP  BibTeX  RDF
13Bireswar Das, Samir Datta, Prajakta Nimbhorkar Log-Space Algorithms for Paths and Matchings in k-Trees. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
13Abuzer Yakaryilmaz Log-space counter is useful for unary languages by help of a constant-size quantum register. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
13Christian 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 ICALP (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
13Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran On the power of unambiguity in log-space. Search on Bibsonomy Comput. Complex. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
13Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc How to meet when you forget: log-space rendezvous in arbitrary graphs. Search on Bibsonomy Distributed Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
13Johannes 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 CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
13Abuzer Yakaryilmaz, A. C. Cem Say NP has log-space verifiers with fixed-size public quantum registers Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
13Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar Longest Paths in Planar DAGs in Unambiguous Log-Space. Search on Bibsonomy Chic. J. Theor. Comput. Sci. The full citation details ... 2010 DBLP  BibTeX  RDF
13Ajesh Babu, Nutan Limaye, Girish Varma Streaming algorithms for some problems in log-space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2010 DBLP  BibTeX  RDF
13Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner Graph Isomorphism for K3,3-free and K5-free graphs is in Log-space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2010 DBLP  BibTeX  RDF
13Hiroaki Kotera Image Color Mapping in Complex Log Space. Search on Bibsonomy CIC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
13Ajesh Babu, Nutan Limaye, Girish Varma Streaming Algorithms for Some Problems in Log-Space. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
13Bireswar Das, Samir Datta, Prajakta Nimbhorkar Log-space Algorithms for Paths and Matchings in k-trees. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
13Derrick Stolee, Chris Bourke, N. V. Vinodchandran A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. Search on Bibsonomy CCC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF acyclic digraph, logspace algorithm, planar graph, reachability
13Derrick Stolee, Chris Bourke, N. V. Vinodchandran A log-space algorithm for reachability in planar DAGs with few sources. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2009 DBLP  BibTeX  RDF
13Fabian Wagner, Thomas Thierauf Reachability in K3,3-free Graphs and K5-free Graphs is in Unambiguous Log-Space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2009 DBLP  BibTeX  RDF
13Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf Planar Graph Isomorphism is in Log-space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2009 DBLP  BibTeX  RDF
13Bireswar Das, Samir Datta, Prajakta Nimbhorkar Log-space Algorithms for Paths and Matchings in k-trees Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
13Chris Bourke, Raghunath Tewari, N. V. Vinodchandran Directed Planar Reachability Is in Unambiguous Log-Space. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner Planar Graph Isomorphism is in Log-Space. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2009 DBLP  BibTeX  RDF
13Samir 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 FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner Planar Graph Isomorphism is in Log-Space. Search on Bibsonomy CCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Samir Datta, Nutan Limaye, Prajakta Nimbhorkar 3-connected Planar Graph Isomorphism is in Log-space Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
13Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner A Log-space Algorithm for Canonization of Planar Graphs Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
13Samir Datta, Nutan Limaye, Prajakta Nimbhorkar 3-connected Planar Graph Isomorphism is in Log-space. Search on Bibsonomy FSTTCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
13Chris Bourke, Raghunath Tewari, N. V. Vinodchandran Directed Planar Reachability is in Unambiguous Log-Space. Search on Bibsonomy CCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Omer Reingold Undirected ST-Connectivity in Log-Space Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2004 DBLP  BibTeX  RDF
13Michael Szydlo Merkle Tree Traversal in Log Space and Time. Search on Bibsonomy EUROCRYPT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF authentication path, tail zipping, fractal traversal, binary tree, pebbling, Merkle tree, amortization
13Chris Pollett A theory for Log-Space and NLIN versus coNLIN. Search on Bibsonomy J. Symb. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Michal Koucký 0001 Log-space constructible universal traversal sequences for cycles of length O(n4.03). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
13Michal Koucký 0001 Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03) Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2001 DBLP  BibTeX  RDF
13Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén Log-Space Polynomial End-to-End Communication. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
13Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén Log-Space Polynomial End-to-End Communication (Abstract). Search on Bibsonomy PODC The full citation details ... 1995 DBLP  BibTeX  RDF
13Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén Log-space polynomial end-to-end communication. Search on Bibsonomy STOC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
13Carme Àlvarez, Birgit Jenner A Very Hard log-Space Counting Class. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
13Maria J. Serna Approximating Linear Programming is Log-Space Complete for P. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
13Seinosuke Toda Positive Relativizations for Log Space Computability. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
13Carme Àlvarez, Birgit Jenner A Very Hard Log Space Counting Class. Search on Bibsonomy SCT The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
13Lefteris M. Kirousis, Paul G. Spirakis Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. Search on Bibsonomy SWAT The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
13Shigeki Iwata, Takumi Kasai Simultaneous (Poly-Time, Log-Space) Lower Bounds. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
13Takumi Kasai, Shigeki Iwata Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. Search on Bibsonomy Math. Syst. Theory The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
13Marek Ejsmont On the log-space reducibility among array languages /preliminary version/. Search on Bibsonomy Symposium on Computation Theory The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
13Walter J. Savitch A Note on Relativized Log Space. Search on Bibsonomy Math. Syst. Theory The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
13Leslie M. Goldschlager, Ralph A. Shaw, John Staples The Maximum Flow Problem is Log Space Complete for P. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
13David P. Dobkin, Richard J. Lipton, Steven P. Reiss Linear Programming is Log-Space Hard for P. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
13Nancy A. Lynch Log Space Machines with Multiple Oracle Tapes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1978 DBLP  DOI  BibTeX  RDF
13Nancy A. Lynch Log Space Recognition and Translation of Parenthesis Languages. Search on Bibsonomy J. ACM The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
13Leslie M. Goldschlager The monotone and planar circuit value problems are log space complete for P. Search on Bibsonomy SIGACT News The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
13Richard E. Ladner, Nancy A. Lynch Relativization of Questions About Log Space Computability. Search on Bibsonomy Math. Syst. Theory The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
13Richard E. Ladner The circuit value problem is log space complete for P. Search on Bibsonomy SIGACT News The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
13Richard J. Lipton, Nancy A. Lynch A quantifier characterization for nondeterministic log space. Search on Bibsonomy SIGACT News The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
13John Lind, Albert R. Meyer A characterization of log-space computable functions. Search on Bibsonomy SIGACT News The full citation details ... 1973 DBLP  DOI  BibTeX  RDF
12Meena Mahajan, B. V. Raghavendra Rao Small-Space Analogues of Valiant's Classes. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Omer Reingold, Luca Trevisan, Salil P. Vadhan Pseudorandom walks on regular digraphs and the RL vs. L problem. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF universal traversal sequence, zig-zag product, derandomization, expander graphs, mixing time, space-bounded computation
12Jun Tarui, Seinosuke Toda Some Observations on the Computational Complexity of Graph Accessibility Problem. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
12Thomas Zeugmann Computing Large Polynomial Powers Very Fast in Parallel. Search on Bibsonomy MFCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
12Michael Mñuk A Div(n) Depth Boolean Circuit for Smooth Modular Inverse. Search on Bibsonomy IMYCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
10Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Space Efficient Algorithms for Series-Parallel Graphs. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 134 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license