The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for LogDCFL with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1986-2023 (15)
Publication types (Num. hits)
article(6) inproceedings(9)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords

Results
Found 15 publication records. Showing 15 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
95Tanmoy Chakraborty 0001, Samir Datta One-Input-Face MPCVP Is Hard for L, But in LogDCFL. Search on Bibsonomy FSTTCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF L, LogDCFL, monotone planar circuits
90Nutan Limaye, Meena Mahajan, Antoine Meyer On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
45H. Venkateswaran Derandomization of Probabilistic Auxiliary Pushdown Automata Classes. Search on Bibsonomy CCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36Tomoyuki Yamakami Between SC and LOGDCFL: families of languages accepted by logarithmic-space deterministic auxiliary depth-k storage automata. Search on Bibsonomy Int. J. Comput. Math. Comput. Syst. Theory The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
36Tomoyuki Yamakami Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
36Tomoyuki Yamakami Parameterizations of Logarithmic-Space Reductions, Stack-State Complexity of Nonuniform Families of Pushdown Automata, and a Road to the LOGCFL⊆LOGDCFL/poly Question. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
36Tomoyuki Yamakami Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata. Search on Bibsonomy COCOON The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
36Tanmoy Chakraborty 0001, Samir Datta One-input-face MPCVP is Hard for L, but in LogDCFL. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2006 DBLP  BibTeX  RDF
23Lars Kuhtz, Bernd Finkbeiner LTL Path Checking Is Efficiently Parallelizable. Search on Bibsonomy ICALP (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Peter Bro Miltersen The Computational Complexity of One-Dimensional Sandpiles. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Patrick 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
23Pierre McKenzie, Klaus Reinhardt, V. Vinay Circuits and Context-Free Languages. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum On Monotone Planar Circuits. Search on Bibsonomy CCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Klaus-Jörn Lange, Rolf Niedermeier Data-Independences of Parallel Random Access Machines. Search on Bibsonomy FSTTCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
23Patrick W. Dymond, Walter L. Ruzzo Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #15 of 15 (100 per page; Change: )
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