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=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Secure mechanical verification of mutually recursive procedures
Peter V. Homeier
,
David F. Martin
Information and Computation
187
(1), 2003, pp. 1-19
The complexity of minimal satisfiability problems
Lefteris M. Kirousis
,
Phokion G. Kolaitis
Information and Computation
187
(1), 2003, pp. 20-39
A simple undecidable problem: The inclusion problem for finite substitutions on
ab^{\ast} c
J. Karhumäki
,
L.P. Lisovik
Information and Computation
187
(1), 2003, pp. 40-48
The dimensions of individual strings and sequences
Jack H. Lutz
Information and Computation
187
(1), 2003, pp. 49-79
Regular sets of infinite message sequence charts
Dietrich Kuske
Information and Computation
187
(1), 2003, pp. 80-109
Splitting information securely with entanglement
Takashi Mihara
Information and Computation
187
(1), 2003, pp. 110-122
Ground reducibility is EXPTIME-complete
Hubert Comon
,
Florent Jacquemard
Information and Computation
187
(1), 2003, pp. 123-153
Testing metric properties
Michal Parnas
,
Dana Ron
Information and Computation
187
(2), 2003, pp. 155-195
Future temporal logic needs infinitely many modalities
Yoram Hirshfeld
,
Alexander Rabinovich
Information and Computation
187
(2), 2003, pp. 196-208
On regular drawn symbolic picture languages
Gennaro Costagliola
,
Vincenzo Deufemia
,
Filomena Ferrucci
,
Carmine Gravino
Information and Computation
187
(2), 2003, pp. 209-245
Controlling the data space of tree structured computations
I. Gottlieb
,
B. Obrenić
Information and Computation
187
(2), 2003, pp. 246-276
Uniform-distribution attribute noise learnability
Nader H. Bshouty
,
Jeffrey C. Jackson
,
Christino Tamon
Information and Computation
187
(2), 2003, pp. 277-290
Describing parameterized complexity classes
Jörg Flum
,
Martin Grohe
Information and Computation
187
(2), 2003, pp. 291-319
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Steffen Reith
,
Heribert Vollmer
Information and Computation
186
(1), 2003, pp. 1-19
The monotone theory for the PAC-model
Nader H. Bshouty
Information and Computation
186
(1), 2003, pp. 20-35
Interval-based clock synchronization with optimal precision
Ulrich Schmid
,
Klaus Schossmaier
Information and Computation
186
(1), 2003, pp. 36-77
A lower bound for integer multiplication on randomized ordered read-once branching programs
Farid Ablayev
,
Marek Karpinski
Information and Computation
186
(1), 2003, pp. 78-89
Inverting onto functions
Stephen A. Fenner
,
Lance Fortnow
,
Ashish V. Naik
,
John D. Rogers
Information and Computation
186
(1), 2003, pp. 90-103
Some connections between bounded query classes and non-uniform complexity
Amihood Amir
,
Richard Beigel
,
William Gasarch
Information and Computation
186
(1), 2003, pp. 104-139
Follow automata
Lucian Ilie
,
Sheng Yu
Information and Computation
186
(1), 2003, pp. 140-162
Nominal logic, a first order theory of names and binding
Andrew M. Pitts
Information and Computation
186
(2), 2003, pp. 165-193
A spatial logic for concurrency (part I)
Luís Caires
,
Luca Cardelli
Information and Computation
186
(2), 2003, pp. 194-235
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Mizuhito Ogawa
Information and Computation
186
(2), 2003, pp. 236-259
The Girard-Reynolds isomorphism
Philip Wadler
Information and Computation
186
(2), 2003, pp. 260-284
Infinite intersection types
Marcello M. Bonsangue
,
Joost N. Kok
Information and Computation
186
(2), 2003, pp. 285-318
Seiten 1
2
3
4
>