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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A well-structured framework for analysing Petri net extensions
Alain Finkel
,
Pierre McKenzie
,
Claudine Picaronny
Information and Computation
195
(1-2), 2004, pp. 1-29
Local temporal logic is expressively complete for cograph dependence alphabets
Volker Diekert
,
Paul Gastin
Information and Computation
195
(1-2), 2004, pp. 30-52
Minimizing the maximum starting time on-line
Leah Epstein
,
Rob van Stee
Information and Computation
195
(1-2), 2004, pp. 53-65
Remarks on Thatte's transformation of term rewriting systems
Bas Luttik
,
Piet Rodenburg
,
Rakesh Verma
Information and Computation
195
(1-2), 2004, pp. 66-87
Applicability of fair simulation
Doron Bustan
,
Orna Grumberg
Information and Computation
194
(1), 2004, pp. 1-18
Boolean grammars
Alexander Okhotin
Information and Computation
194
(1), 2004, pp. 19-48
On multi-partition communication complexity
Pavol D̑uris̑
,
Juraj Hromkovic̑
,
Stasys Jukna
,
Martin Sauerhoff
,
Georg Schnitger
Information and Computation
194
(1), 2004, pp. 49-75
Towards an algebraic theory of information integration
Gösta Grahne
,
Victoria Kiricenko
Information and Computation
194
(2), 2004, pp. 79-100
Turing machines, transition systems, and interaction
Dina Q. Goldin
,
Scott A. Smolka
,
Paul C. Attie
,
Elaine L. Sonderegger
Information and Computation
194
(2), 2004, pp. 101-128
On the computational complexity of bisimulation, redux
Faron Moller
,
Scott Smolka
,
Jiȓí Srba
Information and Computation
194
(2), 2004, pp. 129-143
Stack size analysis for interrupt-driven programs
Krishnendu Chatterjee
,
Di Ma
,
Rupak Majumdar
,
Tian Zhao
,
Thomas A. Henzinger
,
Jens Palsberg
Information and Computation
194
(2), 2004, pp. 144-174
A simple and deterministic competitive algorithm for online facility location
Aris Anagnostopoulos
,
Russell Bent
,
Eli Upfal
,
Pascal van Hentenryck
Information and Computation
194
(2), 2004, pp. 175-202
Bounded similarity querying for time-series data
Dina Q. Goldin
,
Todd D. Millstein
,
Ayferi Kutlu
Information and Computation
194
(2), 2004, pp. 203-241
Strong normalization of the second-order symmetric
\lambda\mu
-calculus
Yoriyuki Yamagata
Information and Computation
193
(1), 2004, pp. 1-20
(Optimal) duplication is not elementary recursive
Andrea Asperti
,
Paolo Coppola
,
Simone Martini
Information and Computation
193
(1), 2004, pp. 21-56
On learning monotone DNF under product distributions
Rocco A. Servedio
Information and Computation
193
(1), 2004, pp. 57-74
Dynamic nested brackets
Stephen Alstrup
,
Thore Husfeldt
,
Theis Rauhe
Information and Computation
193
(2), 2004, pp. 75-83
Finite-tree analysis for constraint logic-based languages
Roberto Bagnara
,
Roberta Gori
,
Patricia M. Hill
,
Enea Zaffanella
Information and Computation
193
(2), 2004, pp. 84-116
The synthesis of Petri nets from path-automatic specifications
E. Badouel
,
Ph. Darondeau
Information and Computation
193
(2), 2004, pp. 117-135
Multiparty communication complexity and very hard functions
Pavol D̑uris̑
Information and Computation
192
(1), 2004, pp. 1-14
On the classification of recursive languages
John Case
,
Efim Kinber
,
Arun Sharma
,
Frank Stephan
Information and Computation
192
(1), 2004, pp. 15-40
An information-theoretic model for steganography
Christian Cachin
Information and Computation
192
(1), 2004, pp. 41-56
Real numbers having ultimately periodic representations in abstract numeration systems
P. Lecomte
,
M. Rigo
Information and Computation
192
(1), 2004, pp. 57-83
Ultimate approximation and its application in nonmonotonic knowledge representation systems
Marc Denecker
,
Victor W. Marek
,
Mirosƚaw Truszczyński
Information and Computation
192
(1), 2004, pp. 84-121
Computing the vertex separation of unicyclic graphs
John Ellis
,
Minko Markov
Information and Computation
192
(2), 2004, pp. 123-161
Seiten 1
2
3
>