- 2004
- Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe
:
Games with Uniqueness Properties. Theory Comput. Syst. 37(1): 29-47 (2004) - Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. Theory Comput. Syst. 37(3): 441-456 (2004) - Dominique Barth, Pascal Berthomé:
Periodic Gossiping in Commuted Networks. Theory Comput. Syst. 37(5): 559-584 (2004) - Marie-Pierre Béal, Olivier Carton
:
Determinization of Transducers over Infinite Words: The General Case. Theory Comput. Syst. 37(4): 483-502 (2004) - Dietmar Berwanger
, Erich Grädel:
Fixed-Point Logics and Solitaire Games. Theory Comput. Syst. 37(6): 675-694 (2004) - Achim Blumensath:
Axiomatising Tree-Interpretable Structures. Theory Comput. Syst. 37(1): 3-27 (2004) - Achim Blumensath, Erich Grädel:
Finite Presentations of Infinite Structures: Automata and Interpretations. Theory Comput. Syst. 37(6): 641-674 (2004) - Serge Burckel, Marianne Morillon:
Quadratic Sequential Computations of Boolean Mappings. Theory Comput. Syst. 37(4): 519-525 (2004) - Costas Busch:
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks. Theory Comput. Syst. 37(3): 371-396 (2004) - Wei-Mei Chen, Gen-Huey Chen, D. Frank Hsu:
Generalized Diameters of the Mesh of Trees. Theory Comput. Syst. 37(4): 547-556 (2004) - Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm. Theory Comput. Syst. 37(4): 527-546 (2004) - Volker Diekert, Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products. Theory Comput. Syst. 37(1): 133-156 (2004) - Markus Frick:
Generalized Model-Checking over Locally Tree-Decomposable Classes. Theory Comput. Syst. 37(1): 157-191 (2004) - Phillip B. Gibbons, Srikanta Tirthapura
:
Distributed Streams Algorithms for Sliding Windows. Theory Comput. Syst. 37(3): 457-478 (2004) - Emmanuel Godard, Yves Métivier, Anca Muscholl:
Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37(2): 249-293 (2004) - Georg Gottlob, Miki Hermann, Michaël Rusinowitch:
2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword. Theory Comput. Syst. 37(6): 639-640 (2004) - Martin Grohe
, György Turán:
Learnability and Definability in Trees and Similar Structures. Theory Comput. Syst. 37(1): 193-220 (2004) - Kohei Hatano:
A Simple Boosting Algorithm Using Multi-Way Branching Decision Trees. Theory Comput. Syst. 37(4): 503-518 (2004) - Friedhelm Meyer auf der Heide, Christian Schindelhauer
, Klaus Volbert, Matthias Grünewald:
Congestion, Dilation, and Energy in Radio Networks. Theory Comput. Syst. 37(3): 343-370 (2004) - Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao:
Distributed Object Location in a Dynamic Network. Theory Comput. Syst. 37(3): 405-440 (2004) - Lefteris M. Kirousis, Phokion G. Kolaitis:
A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput. Syst. 37(6): 695-715 (2004) - Hartmut Klauck
:
Quantum and Approximate Privacy. Theory Comput. Syst. 37(1): 221-246 (2004) - Chiu-Yuen Koo, Tak Wah Lam
, Tsuen-Wan Ngan, Kar-Keung To:
Extra Processors versus Future Information in Optimal Deadline Scheduling. Theory Comput. Syst. 37(3): 323-341 (2004) - Amos Korman, David Peleg, Yoav Rodeh:
Labeling Schemes for Dynamic Tree Networks. Theory Comput. Syst. 37(1): 49-75 (2004) - Danny Krizanc, Flaminia L. Luccio
, Rajeev Raman
:
Compact Routing Schemes for Dynamic Ring Networks. Theory Comput. Syst. 37(5): 585-607 (2004) - Enoch Peserico:
The Lazy Adversary Conjecture Fails. Theory Comput. Syst. 37(3): 397-403 (2004) - Arnold L. Rosenberg:
Obituary: Shimon Even. Theory Comput. Syst. 37(4): 481 (2004) - Keijo Ruohonen:
Chomskian Hierarchies of Families of Sets of Piecewise Continuous Functions. Theory Comput. Syst. 37(5): 609-638 (2004) - Manfred Schmidt-Schauß, Jürgen Stuber:
The Complexity of Linear and Stratified Context Matching Problems. Theory Comput. Syst. 37(6): 717-740 (2004) - Hans Ulrich Simon
:
How Many Missing Answers Can Be Tolerated by Query Learners? Theory Comput. Syst. 37(1): 77-94 (2004)