- On the security of ping-pong protocols D. Dolev S. Even R.M. Karp Fri 02 March 2012
- On LL(k) parsing Seppo Sippu Eljas Soisalon-Soininen Fri 02 March 2012
- The non-sequential behaviour of Petri nets U. Goltz W. Reisig Fri 02 March 2012
- Temporal logic can be more expressive Pierre Wolper Fri 02 March 2012
- Process algebra for synchronous communication J.A. Bergstra J.W. Klop Fri 02 March 2012
- Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem Peter H. Schmitt Fri 02 March 2012
- A logic for constant-depth circuits Yuri Gurevich Harry R. Lewis Fri 02 March 2012
- A zero-one law for logic with a fixed-point operator Andreas Blass Yuri Gurevich Dexter Kozen Fri 02 March 2012
- Relational queries computable in polynomial time Neil Immerman Fri 02 March 2012
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems Dung T. Huynh Fri 02 March 2012
- On the orthographic dimension of definable sets Stavros Cosmadakis Gabriel Kuper Leonid Libkin Fri 02 March 2012
- The hardest linear conjunctive language Alexander Okhotin Fri 02 March 2012
- Uniform generation of a Schröder tree L. Alonso J.L. Rémy R. Schott Fri 02 March 2012
- On secret sharing schemes Carlo Blundo Alfredo De Santis Ugo Vaccaro Fri 02 March 2012
- Invariants for the construction of a handshake register Wim H. Hesselink Fri 02 March 2012
- The consensus string problem and the complexity of comparing hidden Markov models Rune B. Lyngsø Christian N.S. Pedersen Fri 02 March 2012
- Uniform constant-depth threshold circuits for division and iterated multiplication William Hesse Eric Allender David A. Mix Barrington Fri 02 March 2012
- Typechecking for XML transformers Tova Milo Dan Suciu Victor Vianu Fri 02 March 2012
- Hardness vs randomness Noam Nisan Avi Wigderson Fri 02 March 2012
- Datalog vs first-order logic Miklos Ajtai Yuri Gurevich Fri 02 March 2012
Library Size: 13G (12947 entries),
Last Updated: Apr 09, 2026, 18:14:57,
Build Time: N/A
