Theory of Computing Systems

Titel Veröffentlichungsdatum Sprache Zitate
The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science2011/01/05English13
Efficient Detection of Determinacy Races in Cilk Programs1999/06/0113
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines2007/06/01English13
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata2013/11/14English13
On Covering Problems of Codes1997/03/0112
Solving the 2-Disjoint Paths Problem in Nearly Linear Time2005/11/08English12
Improved Results for a Memory Allocation Problem2009/08/01English12
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings2010/07/08English12
Competitive Online Multicommodity Routing2009/02/12English12
Exponential Separation of Quantum and Classical Online Space Complexity2007/12/07English12
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks2005/04/14English12
Superposition Based on Watson–Crick-Like Complementarity2004/12/20English12
Sophistication Revisited2007/11/28English12
Weak MSO with the Unbounding Quantifier2010/07/28English12
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation2013/01/24English12
Non-clairvoyant Scheduling Games2011/02/17English12
Quotient Complexity of Closed Languages2013/11/19English12
Symbolic Dynamics: Entropy = Dimension = Complexity2014/05/01English12
Space Efficient Linear Time Algorithms for BFS, DFS and Applications2018/01/22English12
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs2008/04/15English12
The Cache Complexity of Multithreaded Cache Oblivious Algorithms2007/12/14English12
Semi-Online Preemptive Scheduling: One Algorithm for All Variants2010/09/08English12
Embedding Complete Binary Trees into Star and Pancake Graphs1998/05/0111
Analyses of Load Stealing Models Based on Families of Differential Equations2000/02/01English11
Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines2006/09/29English11
Online Removable Square Packing2007/09/11English11
Scheduling Time-Constrained Communication in Linear Networks2002/06/18English11
Approximate Self-Assembly of the Sierpinski Triangle2011/07/01English11
Adversarial Queueing Model for Continuous Network Dynamics2007/09/28English11
Dynamic Complexity Theory Revisited2007/06/01English11