default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 37
Volume 37, Number 1, January 2004
- Achim Blumensath:
Axiomatising Tree-Interpretable Structures. 3-27 - Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe
:
Games with Uniqueness Properties. 29-47 - Amos Korman, David Peleg, Yoav Rodeh:
Labeling Schemes for Dynamic Tree Networks. 49-75 - Hans Ulrich Simon:
How Many Missing Answers Can Be Tolerated by Query Learners? 77-94 - Till Tantau:
Comparing Verboseness for Finite Automata and Turing Machines. 95-109 - Denis Thérien, Thomas Wilke:
Nesting Until and Since in Linear Temporal Logic. 111-131 - Volker Diekert, Markus Lohrey:
Existential and Positive Theories of Equations in Graph Products. 133-156 - Markus Frick:
Generalized Model-Checking over Locally Tree-Decomposable Classes. 157-191 - Martin Grohe, György Turán:
Learnability and Definability in Trees and Similar Structures. 193-220 - Hartmut Klauck:
Quantum and Approximate Privacy. 221-246
Volume 37, Number 2, March 2004
- Emmanuel Godard, Yves Métivier, Anca Muscholl:
Characterizations of Classes of Graphs Recognizable by Local Computations. 249-293 - Marc Snir:
A Note on N-Body Computations with Cutoffs. 295-318
Volume 37, Number 3, May 2004
- Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking:
Foreword. 321 - Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To:
Extra Processors versus Future Information in Optimal Deadline Scheduling. 323-341 - Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald:
Congestion, Dilation, and Energy in Radio Networks. 343-370 - Costas Busch:
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks. 371-396 - Enoch Peserico:
The Lazy Adversary Conjecture Fails. 397-403 - Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao:
Distributed Object Location in a Dynamic Network. 405-440 - Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. 441-456 - Phillip B. Gibbons, Srikanta Tirthapura:
Distributed Streams Algorithms for Sliding Windows. 457-478
Volume 37, Number 4, July 2004
- Arnold L. Rosenberg:
Obituary: Shimon Even. 481 - Marie-Pierre Béal, Olivier Carton:
Determinization of Transducers over Infinite Words: The General Case. 483-502 - Kohei Hatano:
A Simple Boosting Algorithm Using Multi-Way Branching Decision Trees. 503-518 - Serge Burckel, Marianne Morillon:
Quadratic Sequential Computations of Boolean Mappings. 519-525 - Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm. 527-546 - Wei-Mei Chen, Gen-Huey Chen, D. Frank Hsu:
Generalized Diameters of the Mesh of Trees. 547-556
Volume 37, Number 5, September 2004
- Dominique Barth, Pascal Berthomé:
Periodic Gossiping in Commuted Networks. 559-584 - Danny Krizanc, Flaminia L. Luccio, Rajeev Raman:
Compact Routing Schemes for Dynamic Ring Networks. 585-607 - Keijo Ruohonen:
Chomskian Hierarchies of Families of Sets of Piecewise Continuous Functions. 609-638
Volume 37, Number 6, December 2004
- Georg Gottlob, Miki Hermann, Michaël Rusinowitch:
2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword. 639-640 - Achim Blumensath, Erich Grädel:
Finite Presentations of Infinite Structures: Automata and Interpretations. 641-674 - Dietmar Berwanger, Erich Grädel:
Fixed-Point Logics and Solitaire Games. 675-694 - Lefteris M. Kirousis, Phokion G. Kolaitis:
A Dichotomy in the Complexity of Propositional Circumscription. 695-715 - Manfred Schmidt-Schauß, Jürgen Stuber:
The Complexity of Linear and Stratified Context Matching Problems. 717-740
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-03 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
