default search action
Information and Computation, Volume 243
Volume 243, August 2015
- Fedor V. Fomin
, Marta Z. Kwiatkowska, David Peleg:
40th international colloquium on automata, languages and programming. 1 - Mark Bun, Justin Thaler:
Dual lower bounds for approximate degree and Markov-Bernstein inequalities. 2-25 - John Fearnley, Marcin Jurdzinski
Reachability in two-clock timed automata is PSPACE-complete. 26-36 - Dariusz Dereniowski
Fast collaborative graph exploration. 37-49 - Nicolas Basset:
A maximal entropy stochastic process for a timed automaton. 50-74 - Marek Cygan
Faster exponential-time algorithms in graphs of bounded average degree. 75-85 - Hans L. Bodlaender
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. 86-111 - Ran Duan, Kurt Mehlhorn:
A combinatorial polynomial algorithm for the linear Arrow-Debreu market. 112-132 - Markus Bläser:
Noncommutativity makes determinants hard. 133-144 - Tom Gur
Arthur-Merlin streaming complexity. 145-165 - Philip Bille
Tree compression with top trees. 166-177 - Brett Hemenway, Rafail Ostrovsky, Mary Wootters:
Local correctability of expander codes. 178-190 - Markus Lohrey, Benjamin Steinberg
Rational subsets and submonoids of wreath products. 191-204 - Gregory M. Kobele, Sylvain Salvati:
The IO and OI hierarchies revisited. 205-221 - David Janin:
On labeled birooted tree languages: Algebras, automata and logic. 222-248 - Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
A refined complexity analysis of degree anonymization in graphs. 249-262 - Seth Pettie, Hsin-Hao Su:
Distributed coloring algorithms for triangle-free graphs. 263-280
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-09-30 20:47 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: