- Query languages for graph databases Peter T. Wood Fri 02 March 2012
- On identity testing of tensors, low-rank recovery and compressed sensing Michael A. Forbes Amir Shpilka Fri 02 March 2012
- Multiplying matrices faster than coppersmith-winograd Virginia Vassilevska Williams Fri 02 March 2012
- Size and Treewidth Bounds for Conjunctive Queries Georg Gottlob Stephanie Tien Lee Gregory Valiant Paul Valiant Fri 02 March 2012
- A focus+context technique based on hyperbolic geometry for visualizing large hierarchies John Lamping Ramana Rao Peter Pirolli Fri 02 March 2012
- Spreadsheet data manipulation using examples Sumit Gulwani William R. Harris Rishabh Singh Fri 02 March 2012
- Parallelism in sequential functional languages Guy Blelloch John Greiner Fri 02 March 2012
- Deep Blue system overview Feng-hsiung Hsu Murray S. Campbell A. Joseph Hoane Fri 02 March 2012
- The relative complexity of NP search problems Paul Beame Stephen Cook Jeff Edmonds Russell Impagliazzo Toniann Pitassi Fri 02 March 2012
- Descriptive complexity theory over the real numbers Erich Grädel Klaus Meer Fri 02 March 2012
- Efficient state merging in symbolic execution Volodymyr Kuznetsov Johannes Kinder Stefan Bucur George Candea Fri 02 March 2012
- RockSalt Greg Morrisett Gang Tan Joseph Tassarotti Jean-Baptiste Tristan Edward Gan Fri 02 March 2012
- Regular path queries on graphs with data Leonid Libkin Domagoj Vrgoč Fri 02 March 2012
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Michel X. Goemans David P. Williamson Fri 02 March 2012
- Verification games Werner Dietl Stephanie Dietzel Michael D. Ernst Nathaniel Mote Brian Walker Seth Cooper Timothy Pavlik Zoran Popović Fri 02 March 2012
- Automatic Fréchet Differentiation for the Numerical Solution of Boundary-Value Problems Asgeir Birkisson Tobin A. Driscoll Fri 02 March 2012
- Weak models of distributed computing, with connections to modal logic Lauri Hella Matti Järvisalo Antti Kuusisto Juhana Laurinharju Tuomo Lempiäinen Kerkko Luosto Jukka Suomela Jonni Virtema Fri 02 March 2012
- Efficient reasoning about data trees via integer linear programming Claire David Leonid Libkin Tony Tan Fri 02 March 2012
- Synthesizing software verifiers from proof rules Sergey Grebenshchikov Nuno P. Lopes Corneliu Popeea Andrey Rybalchenko Fri 02 March 2012
- Complexity of Makanintextquotesingles algorithm Antoni Kościelski Leszek Pacholski Fri 02 March 2012
Library Size: 13G (12943 entries),
Last Updated: Apr 05, 2026, 21:58:59,
Build Time: N/A
