Searching for authors named "Benjamin Rossman" – sorted by Relevance.
-
Homomorphisms and First-Order Logic
- Homomorphisms and First-Order Logic (Revision of August 16, 2007 — not for distribution) Benjamin
- Cited by 2 (0 self) – Add To MetaCart
-
Explicit graphs with extension properties
- EXPLICIT GRAPHS WITH EXTENSION PROPERTIES ANDREAS BLASS AND BENJAMIN ROSSMAN Abstract. We exhibit
- Cited by 3 (2 self) – Add To MetaCart
-
Interactive small-step algorithms II: Abstract state machines and the characterization theorem
- ANDREAS BLASS, YURI GUREVICH, DEAN ROSENZWEIG, AND BENJAMIN ROSSMAN Mathematics Dept., University
- Cited by 3 (2 self) – Add To MetaCart
-
General Interactive Small-Step Algorithms
- ‡ Benjamin Rossman § Microsoft Research Technical Report MSR-TR-2005-113 Abstract In earlier work
- Cited by 4 (3 self) – Add To MetaCart
-
Semantic Essence of AsmL
- Semantic Essence of AsmL Yuri Gurevich, Benjamin Rossman, Wolfram Schulte Microsoft Research One
- Cited by 20 (4 self) – Add To MetaCart
-
Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs (extended abstract
- -84, Athens, Greece. Benjamin Rossman Massachusetts Institute of Technology, 77 Massachusetts Avenue
- Cited by 3 (0 self) – Add To MetaCart
-
Interactive small-step algorithms I: Axiomatization,
- , AND BENJAMIN ROSSMAN Mathematics Dept., University of Michigan, Ann Arbor, MI 48109, U.S.A. e-mail address
- Cited by 3 (2 self) – Add To MetaCart
-
Semantic Essence of AsmL: Extended Abstract ⋆
- Semantic Essence of AsmL: Extended Abstract ⋆ Yuri Gurevich, Benjamin Rossman and Wolfram Schulte
- Add To MetaCart
-
Semantic Essence of AsmL
- Semantic Essence of AsmL Yuri Gurevich, Benjamin Rossman, Wolfram Schulte Microsoft Research One
- Add To MetaCart
-
An optimal decomposition algorithm for tree edit distance
- ⋆⋆ , Benjamin Rossman, and Oren Weimann MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar
- Cited by 5 (1 self) – Add To MetaCart

