- Almost-natural proofs Timothy Y. Chow Fri 02 March 2012
- Implicit branching and parameterized partial cover problems Omid Amini Fedor V. Fomin Saket Saurabh Fri 02 March 2012
- Space complexity of perfect matching in bounded genus bipartite graphs Samir Datta Raghav Kulkarni Raghunath Tewari N.V. Vinodchandran Fri 02 March 2012
- A spectral algorithm for learning Hidden Markov Models Daniel Hsu Sham M. Kakade Tong Zhang Fri 02 March 2012
- Datalog and constraint satisfaction with infinite templates Manuel Bodirsky Víctor Dalmau Fri 02 March 2012
- Expressiveness and static analysis of extended conjunctive regular path queries Dominik D. Freydenberger Nicole Schweikardt Fri 02 March 2012
- Trace semantics via determinization Bart Jacobs Alexandra Silva Ana Sokolova Fri 02 March 2012
- Synthesis of succinct systems John Fearnley Doron Peled Sven Schewe Fri 02 March 2012
- Regular expressions for data words Leonid Libkin Tony Tan Domagoj Vrgoč Fri 02 March 2012
- Satisfiability of ECTL with constraints Claudia Carapelle Alexander Kartzow Markus Lohrey Fri 02 March 2012
- Linking theorems for tree transducers Zoltán Fülöp Andreas Maletti Fri 02 March 2012
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata Tamar Aizikowitz Michael Kaminski Fri 02 March 2012
- Trading performance for stability in Markov decision processes Tomáš Brázdil Krishnendu Chatterjee Vojtěch Forejt Antonín Kučera Fri 02 March 2012
- Solving parity games in big steps Sven Schewe Fri 02 March 2012
- Hyperplane separation technique for multidimensional mean-payoff games Krishnendu Chatterjee Yaron Velner Fri 02 March 2012
- Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs Erik D. Demaine Felix Reidl Peter Rossmanith Fernando Sánchez Villaamil Somnath Sikdar Blair D. Sullivan Fri 02 March 2012
- Decidable weighted expressions with Presburger combinators Emmanuel Filiot Nicolas Mazzocchi Jean-François Raskin Fri 02 March 2012
- A trichotomy for regular simple path queries on graphs Guillaume Bagan Angela Bonifati Benoit Groz Fri 02 March 2012
- Circular pattern matching with k mismatches Panagiotis Charalampopoulos Tomasz Kociumaka Solon P. Pissis Jakub Radoszewski Wojciech Rytter Juliusz Straszyński Tomasz Waleń Wiktor Zuba Fri 02 March 2012
- The complexity of the parity argument with potential Takashi Ishizuka Fri 02 March 2012
Library Size: 13G (12948 entries),
Last Updated: Apr 11, 2026, 09:14:10,
Build Time: N/A
