|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 42 occurrences of 29 keywords
|
|
|
Results
Found 38 publication records. Showing 38 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
163 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Computing LOGCFL Certificates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 361-371, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
88 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 444-454, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
67 | Georg Gottlob, Christoph Koch 0001, Reinhard Pichler, Luc Segoufin |
The complexity of XPath query evaluation and XML typing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(2), pp. 284-335, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
LOGCFL, XML, Complexity, XPath, DTD |
67 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
The Complexity of Acyclic Conjunctive Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 706-715, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
acyclic hypergraph, join tree, LOGCFL, parallel algorithms, computational complexity, database theory, constraint satisfaction problem, conjunctive query, subsumption, query containment, tree query |
51 | Holger Petersen 0001 |
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 513-522, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Egon Wanke |
Bounded Tree-Width and LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings, pp. 33-44, 1993, Springer, 3-540-57899-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
37 | Nutan Limaye, Meena Mahajan |
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, pp. 493-504, 2009, Springer, 978-3-642-00981-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Michaela Götz, Christoph Koch 0001, Wim Martens |
Efficient Algorithms for the Tree Homeomorphism Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBPL ![In: Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers, pp. 17-31, 2007, Springer, 978-3-540-75986-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Carsten Damm, Markus Holzer 0001, Pierre McKenzie |
The complexity of tensor calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 11(1-2), pp. 54-89, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 15A69, 68Q70, 68Q17, 68Q15, 68Q05 |
37 | Changwook Kim |
Efficient recognition algorithms for boundary and linear eNCE graph languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 37(9), pp. 619-632, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
37 | Carsten Damm, Markus Holzer 0001, Pierre McKenzie |
The Complexity of Tensor Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 70-86, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Tomoyuki 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](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.12779, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
32 | Satoru Kuroda |
Generalized quantifier and a bounded arithmetic theory for LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(5-6), pp. 489-516, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03F30, 68Q15 |
32 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Computing LOGCFL certificates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 270(1-2), pp. 761-777, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 62(4), pp. 629-652, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The Descriptive Complexity Approach to LOGCFL ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR98, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
32 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
The descriptive complexity approach to LOGCFL ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.CC/9809114, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
32 | Egon Wanke |
Bounded Tree-Width and LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 16(3), pp. 470-491, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
32 | H. Venkateswaran |
Properties that Characterize LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 43(2), pp. 380-404, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
32 | H. Venkateswaran |
Properties that Characterize LOGCFL ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 141-150, 1987, ACM, 0-89791-221-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
29 | Eric Allender, Klaus-Jörn Lange |
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. ![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. 172-180, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Symmetric Computation, Auxiliary Pushdown Automata, LogCFL, Reversible Computation |
29 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
The complexity of acyclic conjunctive queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(3), pp. 431-498, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
LOGCFL, acyclic hypergraph, degree of cyclicity, hinge, join tree, qury-idth, algorithm, parallel algorithm, constraint, CSP, database theory, constraint satisfaction problem, conjunctive query, subsumption, query containment, bounded treewidth, tree query |
19 | Volker Weber, Thomas Schwentick |
Dynamic Complexity Theory Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 40(4), pp. 355-377, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Tomasz Jurdzinski |
The Boolean Closure of Growing Context-Sensitive Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, pp. 248-259, 2006, Springer, 3-540-35428-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Volker Weber, Thomas Schwentick |
Dynamic Complexity Theory Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pp. 256-268, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Markus Lohrey |
Decidability and Complexity in Automatic Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, pp. 308-320, 2004, Springer, 3-540-24014-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli 0001 |
Computational properties of metaquerying problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 4(2), pp. 149-180, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
data mining, Computational complexity |
19 | Georg Gottlob, Gianluigi Greco, Francesco Scarcello |
Pure Nash equilibria: hard and easy games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), Bloomington, Indiana, USA, June 20-22, 2003, pp. 215-230, 2003, ACM, 1-58113-731-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Georg Gottlob, Christoph Koch 0001, Reinhard Pichler |
The complexity of XPath query evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA, pp. 179-190, 2003, ACM, 1-58113-670-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
XML |
19 | Lucian Ilie, Baozhen Shan, Sheng Yu 0001 |
Fast Algorithms for Extended Regular Expression Matching and Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 179-190, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
extended regular expressions, algorithms, complexity, pattern matching, finite automata |
19 | Matthias Galota, Heribert Vollmer |
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 355-368, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli 0001 |
Computational Properties of Metaquerying Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, May 15-17, 2000, Dallas, Texas, USA, pp. 237-244, 2000, ACM, 1-58113-214-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum |
On Monotone Planar Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 24-, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Klaus Reinhardt, Eric Allender |
Making Nondeterminism Unambiguous. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 244-253, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
nonuniform complexity, nondeterministic logarithmic space bounded computation, computational complexity, nondeterminism, complexity classes, context-free languages |
19 | Birgit Jenner |
Closure under Complementation of Logspace Complexity Classes - A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Foundations of Computer Science: Potential - Theory - Cognition ![In: Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday, pp. 163-175, 1997, Springer, 3-540-63746-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | V. Vinay |
Hierarchies of Circuit Classes that are Closed under Complement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 108-117, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Circuits, Complexity Theory, Complementation |
19 | Lance Fortnow, Carsten Lund |
Interactive Proof Systems and Alternating Time-Space Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings, pp. 263-274, 1991, Springer, 3-540-53709-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Clemens Lautemann |
Efficient Algorithms on Context-Free Graph Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 362-378, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #38 of 38 (100 per page; Change: )
|
|