@article{Bergstra-Middelburg/07a,
AUTHOR = {Bergstra, J.A. and Middelburg, C.A.},
TITLE = {A thread algebra with multi-level strategic interleaving},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {1},
PAGES = {3-32},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1337-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Collins/07,
AUTHOR = {Collins, Pieter},
TITLE = {Optimal semicomputable approximations to reachable and invariant sets},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {1},
PAGES = {33-48},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1338-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Farjudian/07,
AUTHOR = {Farjudian, Amin},
TITLE = {SHRAD: A language for sequential real number computation},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {1},
PAGES = {49-105},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1339-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Meer/07a,
AUTHOR = {Meer, Klaus},
TITLE = {Some relations between approximation problems and PCPs over the real numbers},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {1},
PAGES = {107-118},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1336-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Miltersen/07,
AUTHOR = {Miltersen, Peter Bro},
TITLE = {The computational complexity of one-dimensional sandpiles},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {1},
PAGES = {119-125},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1341-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Niqui/07,
AUTHOR = {Niqui, Milad},
TITLE = {Productivity of Edalat-Potts exact arithmetic in constructive type theory},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {1},
PAGES = {127-154},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1342-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zhong/07,
AUTHOR = {Zhong, Ning},
TITLE = {Computable analysis of a boundary-value problem for the Korteweg-de Vries equation},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {1},
PAGES = {155-175},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1335-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ziegler/07,
AUTHOR = {Ziegler, Martin},
TITLE = {Real hypercomputation and continuity},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {1},
PAGES = {177-206},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1343-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Krieger/07a,
AUTHOR = {Krieger, Matthias P.},
TITLE = {On the incompressibility of monotone DNFs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {2},
PAGES = {211-231},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-2013-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jurdzinski-Lorys/07a,
AUTHOR = {Jurdzi{\'n}ski, Tomasz and Lory{\'s}, Krzysztof},
TITLE = {Leftist grammars and the Chomsky hierarchy},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {2},
PAGES = {233-256},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-2017-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Meister/07a,
AUTHOR = {Meister, Daniel},
TITLE = {Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {2},
PAGES = {257-289},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-2034-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Spakowski-Tripathi/07,
AUTHOR = {Spakowski, Holger and Tripathi, Rahul},
TITLE = {On the power of unambiguity in alternating machines},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {2},
PAGES = {291-326},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-2014-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tantau/07,
AUTHOR = {Tantau, Till},
TITLE = {Logspace optimization problems and their approximability properties},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {2},
PAGES = {327-350},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-2011-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Schelm/07,
AUTHOR = {Schelm, Birgit},
TITLE = {Average-case non-approximability of optimisation problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {2},
PAGES = {351-368},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-2012-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brinkmeier/07,
AUTHOR = {Brinkmeier, Michael},
TITLE = {A simple and fast min-cut algorithm},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {2},
PAGES = {369-380},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-2010-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fomin-Heggernes-Kratsch/07,
AUTHOR = {Fomin, Fedor V. and Heggernes, Pinar and Kratsch, Dieter},
TITLE = {Exact algorithms for graph homomorphisms},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {2},
PAGES = {381-393},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-2007-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Abu-Khzam/07a,
AUTHOR = {Abu-Khzam, Faisal N.},
TITLE = {Pseudo-kernelization: A branch-then-reduce approach for FPT problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {399-410},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1344-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Abu-Khzam-Fellows-Langston-Suters/07,
AUTHOR = {Abu-Khzam, Faisal N. and Fellows, Michael R. and Langston, Michael A. and Suters, W. Henry},
TITLE = {Crown structures for vertex cover kernelization},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {411-430},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1328-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bockenhauer-Hromkovic-Kneis-Kupke/07,
AUTHOR = {B{\"o}ckenhauer, Hans-Joachim and Hromkovi{\v{c}}, Juraj and Kneis, Joachim and Kupke, Joachim},
TITLE = {The parameterized approximability of TSP with deadlines},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {431-444},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1347-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Buss-Islam/07,
AUTHOR = {Buss, Jonathan F. and Islam, Tarique},
TITLE = {Algorithms in the $W$-hierarchy},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {445-457},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1325-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cai-Fellows-Juedes-Rosamond/07,
AUTHOR = {Cai, Liming and Fellows, Michael and Juedes, David and Rosamond, Frances},
TITLE = {The complexity of polynomial-time approximation},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {459-477},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1346-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dehne-Fellows-Langston-Rosamond-Stevens/07,
AUTHOR = {Dehne, Frank and Fellows, Michael and Langston, Michael and Rosamond, Frances and Stevens, Kim},
TITLE = {An $O(2^{0(k)}n^3)$ FPT algorithm for the undirected Feedback Vertex Set problem},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {479-492},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1345-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fuchs-Kern-Molle-Richter-Rossmanith-Wang/07,
AUTHOR = {Fuchs, B. and Kern, W. and M{\"o}lle, D. and Richter, S. and Rossmanith, P. and Wang, X.},
TITLE = {Dynamic programming for minimum Steiner trees},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {493-500},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1324-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guo-Niedermeier-Wernicke/07,
AUTHOR = {Guo, Jiong and Niedermeier, Rolf and Wernicke, Sebastian},
TITLE = {Parameterized complexity of Vertex Cover Variants},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {501-520},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1309-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gutin-Rafiey-Szeider-Yeo/07,
AUTHOR = {Gutin, Gregory and Rafiey, Arash and Szeider, Stefan and Yeo, Anders},
TITLE = {The linear arrangement problem parameterized above guaranteed value},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {521-538},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1330-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {see Corrigendum in Theory of Computing Systems, Vol. 53, 2013, No. 4, 690-691},
}
@article{Hallett-McCartin/07,
AUTHOR = {Hallett, Michael and McCartin, Catherine},
TITLE = {A faster FPT algorithm for the maximum Agreement Forest problem},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {539-550},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1329-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hlineny/07,
AUTHOR = {Hlin{\v{e}}n{\'y}, Petr},
TITLE = {Some hard problems on matroid spikes},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {551-562},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1307-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Raman-Saurabh-Sikdar/07,
AUTHOR = {Raman, Venkatesh and Saurabh, Saket and Sikdar, Somnath},
TITLE = {Efficient exact algorithms through enumerating maximal independent sets and other techniques},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {3},
PAGES = {563-587},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-007-1334-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sadakane/07,
AUTHOR = {Sadakane, Kunihiko},
TITLE = {Compressed suffix trees with full functionality},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {4},
PAGES = {589-607},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1198-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cedo-Cortes-Ripoll-Senar-Luque/07,
AUTHOR = {Ced{\'o}, F. and Cort{\'e}s, A. and Ripoll, A. and Senar, M.A. and Luque, E.},
TITLE = {The convergence of realistic distributed load-balancing algorithms},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {4},
PAGES = {609-618},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1214-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Voigtlander/07,
AUTHOR = {Voigtlander, Janis},
TITLE = {Formal efficiency analysis for tree transducer composition},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {4},
PAGES = {619-689},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1235-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Elkin-Peleg/07,
AUTHOR = {Elkin, Michael and Peleg, David},
TITLE = {The hardness of approximating spanner problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {4},
PAGES = {691-729},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1266-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gao-Malewicz/07,
AUTHOR = {Gao, Li and Malewicz, Grzegorz},
TITLE = {Toward maximizing the quality of results of dependent tasks computed unreliably},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {4},
PAGES = {731-752},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1296-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bohler-Schnoor/07,
AUTHOR = {B{\"o}hler, Elmar and Schnoor, Henning},
TITLE = {The complexity of the descriptiveness of Boolean circuits over different sets of gates},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {4},
PAGES = {753-777},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1301-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kapoor-Sarwat/07,
AUTHOR = {Kapoor, Sanjiv and Sarwat, Mohammad},
TITLE = {Bounded-diameter minimum-cost graph problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {41},
NUMBER = {4},
PAGES = {779-794},
YEAR = {2007},
EDITOR = {Selman, Alan L.},
URL = {http://dx.doi.org/10.1007/s00224-006-1305-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berthe-Rigo/07,
AUTHOR = {Berth{\'e}, Val{\'e}rie and Rigo, Michel},
TITLE = {Odometers on regular languages},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {1},
PAGES = {1-31},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1215-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Shparlinski-Steinfeld/07,
AUTHOR = {Shparlinski, Igor E. and Steinfeld, Ron},
TITLE = {Chinese remaindering with multiplicative noise},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {1},
PAGES = {33-41},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1272-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Halava-Harju-Karhumaki/07,
AUTHOR = {Halava, Vesa and Harju, Tero and Karhum{\"a}ki, Juhani},
TITLE = {The structure of infinite solutions of marked and binary post correspondence problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {1},
PAGES = {43-54},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1222-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kaplan-Milo-Shabo/07,
AUTHOR = {Kaplan, Haim and Milo, Tova and Shabo, Ronen},
TITLE = {Compact labeling scheme for XML ancestor queries},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {1},
PAGES = {55-99},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1281-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Krause/07,
AUTHOR = {Krause, Matthias},
TITLE = {OBDD-based cryptanalysis of oblivious keystream generators},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {1},
PAGES = {101-121},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1282-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tsin/07a,
AUTHOR = {Tsin, Yung H.},
TITLE = {A simple 3-edge-connected component algorithm},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {2},
PAGES = {125-142},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1269-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Barriere-Flocchini-Fraigniaud-Santoro/07,
AUTHOR = {Barri{\`e}re, Lali and Flocchini, Paola and Fraigniaud, Pierre and Santoro, Nicola},
TITLE = {Rendezvous and election of mobile agents: Impact of sense of direction},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {2},
PAGES = {143-162},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1223-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Drewes-Hogberg/07,
AUTHOR = {Drewes, Frank and H{\"o}gberg, Johanna},
TITLE = {Query learning of regular tree languages: How to avoid dead states},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {2},
PAGES = {163-185},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1233-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Xu-Xu/07a,
AUTHOR = {Xu, Guang and Xu, Jinhui},
TITLE = {Constant approximation algorithms for rectangle stabbing and related problems},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {2},
PAGES = {187-204},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1273-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Grabner-Rigo/07,
AUTHOR = {Grabner, Peter J. and Rigo, Michel},
TITLE = {Distribution of additive functions with respect to numeration systems on regular languages},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {3},
PAGES = {205-223},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1231-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Markou-Pelc/07,
AUTHOR = {Markou, Euripides and Pelc, Andrzej},
TITLE = {Efficient exploration of faulty trees},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {3},
PAGES = {225-247},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1252-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hofmeister-Schoning-Schuler-Watanabe/07,
AUTHOR = {Hofmeister, Thomas and Sch{\"o}ning, Uwe and Schuler, Rainer and Watanabe, Osamu},
TITLE = {Randomized algorithms for 3-SAT},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {3},
PAGES = {249-262},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1275-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Klima-Tesson-Therien/07,
AUTHOR = {Kl{\'{i}}ma, O. and Tesson, P. and Th{\'e}rien, D.},
TITLE = {Dichotomies in the complexity of solving systems of equations over finite semigroups},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {3},
PAGES = {263-297},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-005-1279-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Krebs-Lange-Reifferscheid/07,
AUTHOR = {Krebs, Andreas and Lange, Klaus-J{\"o}rn and Reifferscheid, Stephanie},
TITLE = {Characterizing TC$^0$ in terms of infinite groups},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {303-325},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1310-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Franceschini/07,
AUTHOR = {Franceschini, Gianni},
TITLE = {Sorting stably, in place, with $O(n \log n)$ comparisons and $O(n)$ moves},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {327-353},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1311-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Weber-Schwentick/07,
AUTHOR = {Weber, Volker and Schwentick, Thomas},
TITLE = {Dynamic complexity theory revisited},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {355-377},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1312-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Buhrman-Newman-Rohrig-de_Wolf/07,
AUTHOR = {Buhrman, Harry and Newman, Ilan and R{\"o}hrig, Hein and de Wolf, Ronald},
TITLE = {Robust polynomials and quantum algorithms},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {379-395},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1313-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jeandel/07,
AUTHOR = {Jeandel, Emmanuel},
TITLE = {Topological automata},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {397-407},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1314-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Poupet/07,
AUTHOR = {Poupet, Victor},
TITLE = {Cellular automata: Real-time equivalence between one-dimensional neighborhoods},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {409-421},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1315-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Andelman-Azar-Sorani/07,
AUTHOR = {Andelman, Nir and Azar, Yossi and Sorani, Motti},
TITLE = {Truthful approximation mechanisms for scheduling selfish related machines},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {423-436},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1316-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berwanger-Gradel-Lenzi/07,
AUTHOR = {Berwanger, Dietmar and Gr{\"a}del, Erich and Lenzi, Giacomo},
TITLE = {The variable hierarchy of the $\mu$-calculus is strict},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {437-466},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1317-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Doerr/07a,
AUTHOR = {Doerr, Benjamin},
TITLE = {Roundings respecting hard constraints},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {467-483},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1318-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kavitha-Mehlhorn/07,
AUTHOR = {Kavitha, Telikepalli and Mehlhorn, Kurt},
TITLE = {Algorithms to compute minimum cycle basis in directed graphs},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {485-505},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1319-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Burderi-Restivo/07,
AUTHOR = {Burderi, F. and Restivo, A.},
TITLE = {Varieties of codes and Kraft inequality},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {507-520},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1320-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kunc/07,
AUTHOR = {Kunc, Michal},
TITLE = {The power of commuting with finite sets of words},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {521-551},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1321-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Malajovich-Meer/07,
AUTHOR = {Malajovich, Gregorio and Meer, Klaus},
TITLE = {Computing minimal multi-homogeneous B{\'e}zout numbers is hard},
JOURNAL = {Theory of Computing Systems},
VOLUME = {40},
NUMBER = {4},
PAGES = {553-570},
YEAR = {2007},
URL = {http://dx.doi.org/10.1007/s00224-006-1322-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}