Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 40
Volume 40, Number 1, February 2007
- Valérie Berthé, Michel Rigo
:
Odometers on Regular Languages. 1-31 - Igor E. Shparlinski, Ron Steinfeld:
Chinese Remaindering with Multiplicative Noise. 33-41 - Vesa Halava, Tero Harju, Juhani Karhumäki:
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. 43-54 - Haim Kaplan, Tova Milo, Ronen Shabo:
Compact Labeling Scheme for XML Ancestor Queries. 55-99 - Matthias Krause:
OBDD-Based Cryptanalysis of Oblivious Keystream Generators. 101-121
Volume 40, Number 2, February 2007
- Yung H. Tsin:
A Simple 3-Edge-Connected Component Algorithm. 125-142 - Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. 143-162 - Frank Drewes, Johanna Högberg:
Query Learning of Regular Tree Languages: How to Avoid Dead States. 163-185 - Guang Xu, Jinhui Xu:
Constant Approximation Algorithms for Rectangle Stabbing and Related Problems. 187-204
Volume 40, Number 3, April 2007
- Peter J. Grabner, Michel Rigo:
Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages. 205-223 - Euripides Markou, Andrzej Pelc:
Efficient Exploration of Faulty Trees. 225-247 - Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
Randomized Algorithms for 3-SAT. 249-262 - Ondrej Klíma, Pascal Tesson, Denis Thérien:
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. 263-297
Volume 40, Number 4, June 2007
- Volker Diekert, Bruno Durand:
Foreword. 301 - Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups. 303-325 - Gianni Franceschini:
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves. 327-353 - Volker Weber, Thomas Schwentick:
Dynamic Complexity Theory Revisited. 355-377 - Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf:
Robust Polynomials and Quantum Algorithms. 379-395 - Emmanuel Jeandel:
Topological Automata. 397-407 - Victor Poupet:
Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods. 409-421 - Nir Andelman, Yossi Azar, Motti Sorani:
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. 423-436 - Dietmar Berwanger, Erich Grädel, Giacomo Lenzi:
The Variable Hierarchy of the µ-Calculus Is Strict. 437-466 - Benjamin Doerr:
Roundings Respecting Hard Constraints. 467-483 - Telikepalli Kavitha, Kurt Mehlhorn:
Algorithms to Compute Minimum Cycle Basis in Directed Graphs. 485-505 - Fabio Burderi, Antonio Restivo:
Varieties of Codes and Kraft Inequality. 507-520 - Michal Kunc:
The Power of Commuting with Finite Sets of Words. 521-551 - Gregorio Malajovich, Klaus Meer:
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. 553-570
a service of 
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-04-22 20:02 CEST 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:
