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 YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time and space optimal implementations of atomic multi-writer register
Amos Israeli
,
Amnon Shaham
Information and Computation
200
(1), 2005, pp. 62-106
Notions of bisimulation and congruence formats for SOS with data
Mohammad Reza Mousavi
,
Michel A. Reniers
,
Jan Friso Groote
Information and Computation
200
(1), 2005, pp. 107-147
Comparative branching-time semantics for Markov chains
Christel Baier
,
Joost-Pieter Katoen
,
Holger Hermanns
,
Verena Wolf
Information and Computation
200
(2), 2005, pp. 149-214
Types and full abstraction for polyadic
\pi
-calculus
Paola Quaglia
,
David Walker
Information and Computation
200
(2), 2005, pp. 215-246
Reductions between disjoint
NP
-pairs
Christian Glaßer
,
Alan L. Selman
,
Samik Sengupta
Information and Computation
200
(2), 2005, pp. 247-267
Superposition with equivalence reasoning and delayed clause normal form transformation
Harald Ganzinger
,
Jürgen Stuber
Information and Computation
199
(1-2), 2005, pp. 3-23
Translation of resolution proofs into short first-order proofs without choice axioms
Hans de Nivelle
Information and Computation
199
(1-2), 2005, pp. 24-54
Mechanising first-order temporal resolution
Boris Konev
,
Anatoli Degtyarev
,
Clare Dixon
,
Michael Fisher
,
Ullrich Hustadt
Information and Computation
199
(1-2), 2005, pp. 55-86
Canonization for disjoint unions of theories
Sava Krstić
,
Sylvain Conchon
Information and Computation
199
(1-2), 2005, pp. 87-106
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
Sumit Gulwani
,
George C. Necula
Information and Computation
199
(1-2), 2005, pp. 107-131
The complexity of finite model reasoning in description logics
Carsten Lutz
,
Ulrike Sattler
,
Lidia Tendera
Information and Computation
199
(1-2), 2005, pp. 132-171
Automating the dependency pair method
Nao Hirokawa
,
Aart Middeldorp
Information and Computation
199
(1-2), 2005, pp. 172-199
Proving pointer programs in higher-order logic
Farhad Mehta
,
Tobias Nipkow
Information and Computation
199
(1-2), 2005, pp. 200-227
Efficient instance retrieval with standard and relational path indexing
Alexandre Riazanov
,
Andrei Voronkov
Information and Computation
199
(1-2), 2005, pp. 228-252
Competing provers yield improved Karp-Lipton collapse results
Jin-Yi Cai
,
Venkatesan T. Chakaravarthy
,
Lane A. Hemaspaandra
,
Mitsunori Ogihara
Information and Computation
198
(1), 2005, pp. 1-23
Integrated prefetching and caching in single and parallel disk systems
Susanne Albers
,
Markus Büttner
Information and Computation
198
(1), 2005, pp. 24-39
Locally guided randomized elections in trees: The totally fair case
Yves Métivier
,
Nasser Saheb-Djahromi
,
Akka Zemmari
Information and Computation
198
(1), 2005, pp. 40-55
Functions computable in polynomial space
Matthias Galota
,
Heribert Vollmer
Information and Computation
198
(1), 2005, pp. 56-70
Subtyping, recursion, and parametric polymorphism in kernel Fun
Dario Colazzo
,
Giorgio Ghelli
Information and Computation
198
(2), 2005, pp. 71-147
Timer formulas and decidable metric temporal logic
Yoram Hirshfeld
,
Alexander Rabinovich
Information and Computation
198
(2), 2005, pp. 148-178
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
Gundula Niemann
,
Friedrich Otto
Information and Computation
197
(1-2), 2005, pp. 1-21
Simulating perfect channels with probabilistic lossy channels
Parosh Abdulla
,
Christel Baier
,
S. Purushothaman Iyer
,
Bengt Jonsson
Information and Computation
197
(1-2), 2005, pp. 22-40
Weakly useful sequences
Stephen A. Fenner
,
Jack H. Lutz
,
Elvira Mayordomo
,
Patrick Reardon
Information and Computation
197
(1-2), 2005, pp. 41-54
The equational theory of regular words
Stephen L. Bloom
,
Zoltán Ésik
Information and Computation
197
(1-2), 2005, pp. 55-89
Minimal-change integrity maintenance using tuple deletions
Jan Chomicki
,
Jerzy Marcinkowski
Information and Computation
197
(1-2), 2005, pp. 90-121
Seiten
<
1
2
3
>