- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c10 |      | Benjamin Rossman: A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs. WoLLIC 2012: 282-290 |
| i4 | | Akinori Kawachi, Benjamin Rossman, Osamu Watanabe: Query Complexity and Error Tolerance of Witness Finding Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 19: 2 (2012) |
| 2011 | ||
| j10 | | Swastik Kopparty, Benjamin Rossman: The homomorphism domination exponent. Eur. J. Comb. 32(7): 1097-1114 (2011) |
| 2010 | ||
| c9 | | Benjamin Rossman: Choiceless Computation and Symmetry. Fields of Logic and Computation 2010: 565-580 |
| c8 | | |
| 2009 | ||
| j9 | | Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An optimal decomposition algorithm for tree edit distance. ACM Transactions on Algorithms 6(1) (2009) |
| c7 | | |
| c6 | | |
| 2008 | ||
| j8 | | Anuj Dawar, David Richerby, Benjamin Rossman: Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Ann. Pure Appl. Logic 152(1-3): 31-50 (2008) |
| j7 | | |
| c5 | | |
| 2007 | ||
| j6 | | Benjamin Rossman: Successor-invariant first-order logic on finite structures. J. Symb. Log. 72(2): 601-618 (2007) |
| j5 | | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. Logical Methods in Computer Science 3(4) (2007) |
| j4 | | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Logical Methods in Computer Science 3(4) (2007) |
| c4 | | Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157 |
| i3 | | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. CoRR abs/0707.3782 (2007) |
| i2 | | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. CoRR abs/0707.3789 (2007) |
| 2006 | ||
| j3 | | Anuj Dawar, David Richerby, Benjamin Rossman: Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 143: 13-26 (2006) |
| i1 | | Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann: An O(n^3)-Time Algorithm for Tree Edit Distance. CoRR abs/cs/0604037 (2006) |
| 2005 | ||
| j2 |  | Andreas Blass, Benjamin Rossman: Explicit Graphs with Extension Properties. Bulletin of the EATCS 86: 166-175 (2005) |
| j1 | | Yuri Gurevich, Benjamin Rossman, Wolfram Schulte: Semantic essence of AsmL. Theor. Comput. Sci. 343(3): 370-412 (2005) |
| c3 | | Benjamin Rossman: Existential Positive Types and Preservation under Homomorphisisms. LICS 2005: 467-476 |
| 2003 | ||
| c2 | | |
| c1 | | |
| 1 | Andreas Blass | |
| 2 | Anuj Dawar | |
| 3 | Erik D. Demaine | |
| 4 | Yuri Gurevich | |
| 5 | Akinori Kawachi | |
| 6 | Swastik Kopparty | |
| 7 | Shay Mozes | |
| 8 | David Richerby | |
| 9 | Dean Rosenzweig | |
| 10 | Wolfram Schulte | |
| 11 | Osamu Watanabe | |
| 12 | Oren Weimann |
Colors in the list of coauthors
Last update Sat May 25 12:23:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page