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
[1]
Hilfe
Suche: Journal=Inf.~Comput. AND YEAR=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the almighty wand
Rémi Brochenin
,
Stéphane Demri
,
Etienne Lozes
Information and Computation
211
, 2012, pp. 106-137
Low dimensional hybrid systems - decidable, undecidable, don't know
Eugene Asarin
,
Venkatesh P. Mysore
,
Amir Pnueli
,
Gerardo Schneider
Information and Computation
211
, 2012, pp. 138-159
How to build a probability-free casino
Adam Chalcraft
,
Randall Dougherty
,
Chris Freiling
,
Jason Teutsch
Information and Computation
211
, 2012, pp. 160-164
Coping with selfish on-going behaviors
Orna Kupferman
,
Tami Tamir
Information and Computation
210
, 2012, pp. 1-12
On Ladner's result for a class of real machines with restricted use of constants
Klaus Meer
Information and Computation
210
, 2012, pp. 13-20
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Laurent Bienvenu
,
Adam R. Day
,
Mathieu Hoyrup
,
Ilya Mezhirov
,
Alexander Shen
Information and Computation
210
, 2012, pp. 21-30
Sparse reliable graph backbones
Shiri Chechik
,
Yuval Emek
,
Boaz Patt-Shamir
,
David Peleg
Information and Computation
210
, 2012, pp. 31-39
Temporal logics over linear time domains are in PSPACE
Alexander Rabinovich
Information and Computation
210
, 2012, pp. 40-67
Improved model checking of hierarchical systems
Benjamin Aminof
,
Orna Kupferman
,
Aniello Murano
Information and Computation
210
, 2012, pp. 68-86
Space-efficient scheduling of stochastically generated tasks
Tomás̑ Brázdil
,
Javier Esparza
,
Stefan Kiefer
,
Michael Luttenberger
Information and Computation
210
, 2012, pp. 87-110
The complexity of approximating bounded-degree Boolean \#CSP
Martin Dyer
,
Leslie Ann Goldberg
,
Markus Jalsenius
,
David Richerby
Information and Computation
220-221
, 2012, pp. 1-14
Inclusion problems for patterns with a bounded number of variables
Joachim Bremer
,
Dominik D. Freydenberger
Information and Computation
220-221
, 2012, pp. 15-43
Weighted automata and weighted MSO logics for average and long-time behaviors
Manfred Droste
,
Ingmar Meinecke
Information and Computation
220-221
, 2012, pp. 44-59
Learning secrets interactively. Dynamic modeling in inductive inference
John Case
,
Timo Kötzing
Information and Computation
220-221
, 2012, pp. 60-73
Seiten
<
1
2
3