- Some NP-complete geometric problems M. R. Garey R. L. Graham D. S. Johnson Fri 02 March 2012
- NP-complete decision problems for quadratic polynomials Kenneth Manders Leonard Adleman Fri 02 March 2012
- The complexity of satisfiability problems Thomas J. Schaefer Fri 02 March 2012
- Nondeterminism and the size of two way finite automata William J. Sakoda Michael Sipser Fri 02 March 2012
- Presburger arithmetic with bounded quantifier alternation C. R. Reddy D. W. Loveland Fri 02 March 2012
- Completeness classes in algebra L. G. Valiant Fri 02 March 2012
- Testing polynomials which are easy to compute (Extended Abstract) J. Heintz C. P. Schnorr Fri 02 March 2012
- Context-free grammars on trees William C. Rounds Fri 02 March 2012
- Design and verification of secure systems J. M. Rushby Fri 02 March 2012
- Implementation and applications of Scotttextquotesingles logic for computable functions Robin Milner Fri 02 March 2012
- Elimination theory for differential difference polynomials E. L. Mansfield A. Szanto Fri 02 March 2012
- Polar varieties and computation of one point in each connected component of a smooth real algebraic set Mohab Safey El Din Éric Schost Fri 02 March 2012
- The Yampa arcade Antony Courtney Henrik Nilsson John Peterson Fri 02 March 2012
- Helium, for learning Haskell Bastiaan Heeren Daan Leijen Arjan van IJzendoorn Fri 02 March 2012
- Automatic discovery of mutual exclusion algorithms Yoah Bar-David Gadi Taubenfeld Fri 02 March 2012
- Prolog - the language and its implementation compared with Lisp David H D Warren Luis M. Pereira Fernando Pereira Fri 02 March 2012
- Definable relations and first-order query languages over strings Michael Benedikt Leonid Libkin Thomas Schwentick Luc Segoufin Fri 02 March 2012
- Call-by-value is dual to call-by-name Philip Wadler Fri 02 March 2012
- RacerX Dawson Engler Ken Ashcraft Fri 02 March 2012
- Parsing expression grammars Bryan Ford Fri 02 March 2012
Library Size: 13G (12943 entries),
Last Updated: Apr 05, 2026, 21:58:59,
Build Time: N/A
