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=208
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient simulation algorithm based on abstract interpretation
Francesco Ranzato
,
Francesco Tapparo
Information and Computation
208
(1), 2010, pp. 1-22
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Stefano Galatolo
,
Mathieu Hoyrup
,
Cristóbal Rojas
Information and Computation
208
(1), 2010, pp. 23-41
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Sibylle Fröschle
,
Petr Janc̑ar
,
Slawomir Lasota
,
Zdenȇk Sawa
Information and Computation
208
(1), 2010, pp. 42-62
Mind change optimal learning of Bayes net structure from dependency and independency data
Oliver Schulte
,
Wei Luo
,
Russell Greiner
Information and Computation
208
(1), 2010, pp. 63-82
Bad news on decision problems for patterns
Dominik D. Freydenberger
,
Daniel Reidenbach
Information and Computation
208
(1), 2010, pp. 83-96
On the expressiveness of TPTL and MTL
Patricia Bouyer
,
Fabrice Chevalier
,
Nicolas Markey
Information and Computation
208
(2), 2010, pp. 97-116
Static analysis of topology-dependent broadcast networks
Sebastian Nanz
,
Flemming Nielson
,
Hanne Riis Nielson
Information and Computation
208
(2), 2010, pp. 117-139
Regaining cut admissibility in deduction modulo using abstract completion
Guillaume Burel
,
Claude Kirchner
Information and Computation
208
(2), 2010, pp. 140-164
Parameterized computational complexity of Dodgson and Young elections
Nadja Betzler
,
Jiong Guo
,
Rolf Niedermeier
Information and Computation
208
(2), 2010, pp. 165-177
Compositional verification and 3-valued abstractions join forces
Sharon Shoham
,
Orna Grumberg
Information and Computation
208
(2), 2010, pp. 178-202
Weak bisimulation is sound and complete for pCTL
Josée Desharnais
,
Vineet Gupta
,
Radha Jagadeesan
,
Prakash Panangaden
Information and Computation
208
(2), 2010, pp. 203-219
Efficient algorithms for the block edit problems
Hsing-Yen Ann
,
Chang-Biau Yang
,
Yung-Hsing Peng
,
Bern-Cherng Liaw
Information and Computation
208
(3), 2010, pp. 221-229
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
Murdoch J. Gabbay
,
Dominic P. Mulligan
Information and Computation
208
(3), 2010, pp. 230-258
Treewidth computations I. Upper bounds
Hans L. Bodlaender
,
Arie M.C.A. Koster
Information and Computation
208
(3), 2010, pp. 259-275
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Matthias Mann
,
Manfred Schmidt-Schausś
Information and Computation
208
(3), 2010, pp. 276-291
Algorithmically independent sequences
Cristian S. Calude
,
Marius Zimand
Information and Computation
208
(3), 2010, pp. 292-308
Testing the expansion of a graph
Asaf Nachmias
,
Asaf Shapira
Information and Computation
208
(4), 2010, pp. 309-314
Underapproximation for model-checking based on universal circuits
Arie Matsliah
,
Ofer Strichman
Information and Computation
208
(4), 2010, pp. 315-326
Topological properties of concept spaces (full version)
Matthew de Brecht
,
Akihiro Yamamoto
Information and Computation
208
(4), 2010, pp. 327-340
9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
Selçuk Kavut
,
Melek Diker Yücel
Information and Computation
208
(4), 2010, pp. 341-350
The ideal membership problem and polynomial identity testing
V. Arvind
,
Partha Mukhopadhyay
Information and Computation
208
(4), 2010, pp. 351-363
Models of active learning in group-structured state spaces
Gábor Bartók
,
Csaba Szepesvári
,
Sandra Zilles
Information and Computation
208
(4), 2010, pp. 364-384
More concise representation of regular languages by automata and regular expressions
Viliam Geffert
,
Carlo Mereghetti
,
Beatrice Palano
Information and Computation
208
(4), 2010, pp. 385-394
Continuation semantics for the Lambek-Grishin calculus
Raffaella Bernardi
,
Michael Moortgat
Information and Computation
208
(5), 2010, pp. 397-416
On quantifier-rank equivalence between linear orders
Ryan Siders
Information and Computation
208
(5), 2010, pp. 417-432
Seiten 1
2
3
>