default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 222
Volume 222, January 2013
- Luca Aceto, Monika Henzinger, Jirí Sgall
:
38th International Colloquium on Automata, Languages and Programming. 1
- Malte Beecken, Johannes Mittmann, Nitin Saxena:
Algebraic independence and blackbox identity testing. 2-19 - Martin Hoefer:
Local matching dynamics in social networks. 20-35 - Shiri Chechik:
Fault-tolerant compact routing schemes for general graphs. 36-44 - Shi Li:
A 1.488 approximation algorithm for the uncapacitated facility location problem. 45-58 - Kook Jin Ahn, Sudipto Guha:
Linear programming in the semi-streaming model with application to the maximum matching problem. 59-79 - Eric Allender, Luke Friedman, William I. Gasarch:
Limits on the computational power of random strings. 80-92 - Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Approximation algorithms for spanner problems and Directed Steiner Forest. 93-107 - Simone Bova, Hubie Chen, Matthew Valeriote:
Generic expression hardness results for primitive positive formula comparison. 108-120 - Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera:
Approximating the termination value of one-counter MDPs and stochastic games. 121-138 - Yuxin Deng, Matthew Hennessy:
On the semantics of Markov automata. 139-168 - Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala:
Range majority in constant time and linear space. 169-179 - Chien-Chung Huang, Telikepalli Kavitha:
Popular matchings in the stable marriage problem. 180-194 - Maurice J. Jansen, Rahul Santhanam:
Permanent does not have succinct polynomial size arithmetic circuits of constant depth. 195-207 - Christos A. Kapoutsis:
Nondeterminism is essential in small two-way finite automata with few reversals. 208-227 - Shin-ya Katsumata:
Relating computational effects by ⊤⊤-lifting. 228-246 - Jim Laird, Giulio Manzonetto, Guy McCusker:
Constructing differential categories and deconstructing categories of games. 247-264 - Fabian Kuhn, Monaldo Mastrolilli:
Vertex cover in graphs with locally few colors. 265-277 - Daniel Lokshtanov, Dániel Marx:
Clustering with local restrictions. 278-292 - Carsten Moldenhauer:
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs. 293-306
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 2025-11-02 21:08 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:
