The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Benjamin Rossman" ( http://dblp.L3S.de/Authors/Benjamin_Rossman )

  Author page on DBLP  Author page in RDF  Community of Benjamin Rossman in ASPL-2

Publication years (Num. hits)
2003-2008 (16) 2009-2012 (7)
Publication types (Num. hits)
article(14) inproceedings(9)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 6 keywords

Results
Found 23 publication records. Showing 23 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Akinori Kawachi, Benjamin Rossman, Osamu Watanabe Query Complexity and Error Tolerance of Witness Finding Algorithms. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Swastik Kopparty, Benjamin Rossman The homomorphism domination exponent. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman Choiceless Computation and Symmetry. Search on Bibsonomy Fields of Logic and Computation The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman The Monotone Complexity of k-clique on Random Graphs. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann An optimal decomposition algorithm for tree edit distance. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman Ehrenfeucht-Fraïssé Games on Random Structures. Search on Bibsonomy WoLLIC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman Combining Ehrenfeucht-Fraïssé Games. Search on Bibsonomy LICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Anuj Dawar, David Richerby, Benjamin Rossman Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman Homomorphism preservation theorems. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF preservation theorems, quantifier-rank, tree-depth, first-order logic, conjunctive queries, homomorphisms, Finite model theory
1Benjamin Rossman On the constant-depth complexity of k-clique. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ac0, bounded variable hierarchy, k-clique, first-order logic, circuit complexity, constant-depth circuits
1Benjamin Rossman Successor-invariant first-order logic on finite structures. Search on Bibsonomy J. Symb. Log. The full citation details ... 2007 DBLP  BibTeX  RDF
1Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman Interactive Small-Step Algorithms I: Axiomatization. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman Interactive Small-Step Algorithms I: Axiomatization Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann An Optimal Decomposition Algorithm for Tree Edit Distance. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Anuj Dawar, David Richerby, Benjamin Rossman Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann An O(n^3)-Time Algorithm for Tree Edit Distance Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Yuri Gurevich, Benjamin Rossman, Wolfram Schulte Semantic essence of AsmL. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Blass, Benjamin Rossman Explicit Graphs with Extension Properties. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2005 DBLP  BibTeX  RDF
1Benjamin Rossman Existential Positive Types and Preservation under Homomorphisisms. Search on Bibsonomy LICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Yuri Gurevich, Benjamin Rossman, Wolfram Schulte Semantic Essence of AsmL. Search on Bibsonomy FMCO The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman Successor-Invariance in the Finite. Search on Bibsonomy LICS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #23 of 23 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.