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=209
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Extensions of MSO and the monadic counting hierarchy
Juha Kontinen
,
Hannu Niemistö
Information and Computation
209
(1), 2011, pp. 1-19
On the consistency, expressiveness, and precision of partial modeling formalisms
Ou Wei
,
Arie Gurfinkel
,
Marsha Chechik
Information and Computation
209
(1), 2011, pp. 20-47
Nominal abstraction
Andrew Gacek
,
Dale Miller
,
Gopalan Nadathur
Information and Computation
209
(1), 2011, pp. 48-73
Optimality and competitiveness of exploring polygons by mobile robots
Jurek Czyzowicz
,
Arnaud Labourel
,
Andrzej Pelc
Information and Computation
209
(1), 2011, pp. 74-88
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control
Piotr Faliszewski
,
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Jörg Rothe
Information and Computation
209
(2), 2011, pp. 89-107
Coinduction for preordered algebra
Rȃzvan Diaconescu
Information and Computation
209
(2), 2011, pp. 108-117
Light logics and optimal reduction: Completeness and complexity
Patrick Baillot
,
Paolo Coppola
,
Ugo Dal Lago
Information and Computation
209
(2), 2011, pp. 118-142
On the complexity of some colorful problems parameterized by treewidth
Michael R. Fellows
,
Fedor V. Fomin
,
Daniel Lokshtanov
,
Frances Rosamond
,
Saket Saurabh
,
Stefan Szeider
,
Carsten Thomassen
Information and Computation
209
(2), 2011, pp. 143-153
Probabilistic logical characterization
Holger Hermanns
,
Augusto Parma
,
Roberto Segala
,
Björn Wachter
,
Lijun Zhang
Information and Computation
209
(2), 2011, pp. 154-172
Observations on complete sets between linear time and polynomial time
Armin Hemmerling
Information and Computation
209
(2), 2011, pp. 173-182
Algorithmic randomness and monotone complexity on product space
Hayato Takahashi
Information and Computation
209
(2), 2011, pp. 183-197
On the expressiveness and decidability of higher-order process calculi
Ivan Lanese
,
Jorge A. Pérez
,
Davide Sangiorgi
,
Alan Schmitt
Information and Computation
209
(2), 2011, pp. 198-226
Levels of undecidability in rewriting
Jörg Endrullis
,
Herman Geuvers
,
Jakob Grue Simonsen
,
Hans Zantema
Information and Computation
209
(2), 2011, pp. 227-245
A classification of the expressive power of well-structured transition systems
Parosh Aziz Abdulla
,
Giorgio Delzanno
,
Laurent Van Begin
Information and Computation
209
(3), 2011, pp. 248-279
Absolute convergence of rational series is semi-decidable
Raphaël Bailly
,
François Denis
Information and Computation
209
(3), 2011, pp. 280-295
Teaching randomized learners with feedback
Frank J. Balbach
,
Thomas Zeugmann
Information and Computation
209
(3), 2011, pp. 296-319
Proof systems that take advice
Olaf Beyersdorff
,
Johannes Köbler
,
Sebastian Müller
Information and Computation
209
(3), 2011, pp. 320-332
Larger lower bounds on the OBDD complexity of integer multiplication
Bollig Beate
Information and Computation
209
(3), 2011, pp. 333-343
Decidability of operation problems for T0L languages and subclasses
Henning Bordihn
,
Markus Holzer
,
Martin Kutrib
Information and Computation
209
(3), 2011, pp. 344-352
Decision problems for convex languages
Janusz Brzozowski
,
Jeffrey Shallit
,
Zhi Xu
Information and Computation
209
(3), 2011, pp. 353-367
The role of evolutionary operations in accepting hybrid networks of evolutionary processors
Jürgen Dassow
,
Victor Mitrana
,
Bianca Truthe
Information and Computation
209
(3), 2011, pp. 368-382
Finite identification from the viewpoint of epistemic update
Cédric Dégremont
,
Nina Gierasimczuk
Information and Computation
209
(3), 2011, pp. 383-396
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality
Fujioka Kaoru
Information and Computation
209
(3), 2011, pp. 397-408
Queries on
Xml
streams with bounded delay and concurrency
Olivier Gauwin
,
Joachim Niehren
,
Sophie Tison
Information and Computation
209
(3), 2011, pp. 409-442
The fault tolerance of NP-hard problems
Christian Glaßer
,
A. Pavan
,
Stephen Travers
Information and Computation
209
(3), 2011, pp. 443-455
Seiten 1
2
3
4
>