Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Comput. AND Volume=222
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebraic independence and blackbox identity testing
M. Beecken
,
J. Mittmann
,
N. Saxena
Information and Computation
222
, 2013, pp. 2-19
Local matching dynamics in social networks
Martin Hoefer
Information and Computation
222
, 2013, pp. 20-35
Fault-tolerant compact routing schemes for general graphs
Shiri Chechik
Information and Computation
222
, 2013, pp. 36-44
A 1.488 approximation algorithm for the uncapacitated facility location problem
Shi Li
Information and Computation
222
, 2013, pp. 45-58
Linear programming in the semi-streaming model with application to the maximum matching problem
Kook Jin Ahn
,
Sudipto Guha
Information and Computation
222
, 2013, pp. 59-79
Limits on the computational power of random strings
Eric Allender
,
Luke Friedman
,
William Gasarch
Information and Computation
222
, 2013, pp. 80-92
Approximation algorithms for spanner problems and Directed Steiner Forest
Piotr Berman
,
Arnab Bhattacharyya
,
Konstantin Makarychev
,
Sofya Raskhodnikova
,
Grigory Yaroslavtsev
Information and Computation
222
, 2013, pp. 93-107
Generic expression hardness results for primitive positive formula comparison
Simone Bova
,
Hubie Chen
,
Matthew Valeriote
Information and Computation
222
, 2013, pp. 108-120
Approximating the termination value of one-counter MDPs and stochastic games
Tomás̑ Brázdil
,
Václav Broz̑ek
,
Kousha Etessami
,
Antonín Kuc̑era
Information and Computation
222
, 2013, pp. 121-138
On the semantics of Markov automata
Yuxin Deng
,
Matthew Hennessy
Information and Computation
222
, 2013, pp. 139-168
Range majority in constant time and linear space
Stephane Durocher
,
Meng He
,
J. Ian Munro
,
Patrick K. Nicholson
,
Matthew Skala
Information and Computation
222
, 2013, pp. 169-179
Popular matchings in the stable marriage problem
Chien-Chung Huang
,
Telikepalli Kavitha
Information and Computation
222
, 2013, pp. 180-194
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Maurice Jansen
,
Rahul Santhanam
Information and Computation
222
, 2013, pp. 195-207
Nondeterminism is essential in small two-way finite automata with few reversals
Christos A. Kapoutsis
Information and Computation
222
, 2013, pp. 208-227
Relating computational effects by
\top\top
-lifting
Shin-ya Katsumata
Information and Computation
222
, 2013, pp. 228-246
Constructing differential categories and deconstructing categories of games
Jim Laird
,
Giulio Manzonetto
,
Guy McCusker
Information and Computation
222
, 2013, pp. 247-264
Vertex cover in graphs with locally few colors
Fabian Kuhn
,
Monaldo Mastrolilli
Information and Computation
222
, 2013, pp. 265-277
Clustering with local restrictions
Daniel Lokshtanov
,
Dániel Marx
Information and Computation
222
, 2013, pp. 278-292
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Carsten Moldenhauer
Information and Computation
222
, 2013, pp. 293-306