- Deciding first-order properties of locally tree-decomposable structures Markus Frick Martin Grohe Fri 02 March 2012
- Fast context-free grammar parsing requires fast boolean matrix multiplication Lillian Lee Fri 02 March 2012
- Map graphs Zhi-Zhong Chen Michelangelo Grigni Christos H. Papadimitriou Fri 02 March 2012
- Using dependent types to express modular structure David B. MacQueen Fri 02 March 2012
- A Metalanguage for interactive proof in LCF M. Gordon R. Milner L. Morris M. Newey C. Wadsworth Fri 02 March 2012
- Symbolic evaluation and the global value graph John H. Reif Harry R. Lewis Fri 02 March 2012
- Social processes and proofs of theorems and programs Richard A. DeMillo Richard J. Lipton Alan J. Perlis Fri 02 March 2012
- Automatic verification of finite-state concurrent systems using temporal logic specifications E. M. Clarke E. A. Emerson A. P. Sistla Fri 02 March 2012
- Models and issues in data stream systems Brian Babcock Shivnath Babu Mayur Datar Rajeev Motwani Jennifer Widom Fri 02 March 2012
- Validating streaming XML documents Luc Segoufin Victor Vianu Fri 02 March 2012
- On the temporal analysis of fairness Dov Gabbay Amir Pnueli Saharon Shelah Jonathan Stavi Fri 02 March 2012
- Systematic design of program analysis frameworks Patrick Cousot Radhia Cousot Fri 02 March 2012
- Source-level global optimizations for fine-grain distributed shared memory systems R. Veldema R. F. H. Hofman R. A. F. Bhoedjang C. J. H. Jacobs H. E. Bal Fri 02 March 2012
- Introduction to automata theory, languages, and computation, 2nd edition John E. Hopcroft Rajeev Motwani Jeffrey D. Ullman Fri 02 March 2012
- Packrat parsing: Bryan Ford Fri 02 March 2012
- Composing monads using coproducts Christoph Lüth Neil Ghani Fri 02 March 2012
- A compiled implementation of strong reduction Benjamin Grégoire Xavier Leroy Fri 02 March 2012
- A lightweight implementation of generics and dynamics James Cheney Ralf Hinze Fri 02 March 2012
- K-clustering in wireless ad hoc networks Yaacov Fernandess Dahlia Malkhi Fri 02 March 2012
- A note on the height of binary search trees Luc Devroye Fri 02 March 2012
Library Size: 13G (12943 entries),
Last Updated: Apr 05, 2026, 21:58:59,
Build Time: N/A
