Theory of Computing Systems

Titel Veröffentlichungsdatum Sprache Zitate
A Faster FPT Algorithm for the Maximum Agreement Forest Problem2007/10/01English10
The Parameterized Approximability of TSP with Deadlines2007/10/01English10
Computing Nash Equilibria for Scheduling on Restricted Parallel Links2009/02/12English10
Performance of One-Round Walks in Linear Congestion Games2010/12/21English10
Extended Regular Expressions: Succinctness and Decidability2012/03/06English10
Knowledge Compilation Meets Database Theory: Compiling Queries to Decision Diagrams2012/03/06English10
Motion Planning with Pulley, Rope, and Baskets2013/01/25English10
A Logic for Document Spanners2018/09/11English10
Regular Queries on Graph Databases2016/04/16English10
Paradigms for Parameterized Enumeration2016/09/13English9
Optimal Semicomputable Approximations to Reachable and Invariant Sets2007/05/07English9
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online2013/12/06English9
Playing Mastermind with Constant-Size Memory2012/11/11English9
Software Engineering with Transactional Memory Versus Locks in Practice2013/03/03English9
A Randomized Polynomial Kernel for Subset Feedback Vertex Set2017/09/11English9
Document Spanners: From Expressive Power to Decision Problems2017/05/22English9
Parameterizing by the Number of Numbers2011/10/29English9
Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs2011/12/03English9
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders2001/01/01English9
Directed Graphs and Substitutions2001/01/01English9
The Feline Josephus Problem2011/06/10English9
On the Hardness of Losing Width2013/05/18English9
Sensitivity of Wardrop Equilibria2009/02/27English9
Weighted Logics for Unranked Tree Automata2009/06/27English9
The Impact of Network Structure on the Stability of Greedy Protocols2005/01/28English9
Dynamic Generation of Discrete Random Variates2003/06/06English9
Effective Jordan Decomposition2004/12/13English9
Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds1999/09/109
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions1998/11/019
The Price of Fairness for Indivisible Goods2021/03/29English9