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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Presheaf models for CCS-like languages
Gian Luca Cattani
,
Glynn Winskel
Theoretical Computer Science
300
(1-3), 2003, pp. 47-89
A new framework for declarative programming
Stacy E. Finkelstein
,
Peter Freyd
,
James Lipton
Theoretical Computer Science
300
(1-3), 2003, pp. 91-160
A polynomial space construction of tree-like models for logics with local chains of modal connectives
Stéphane Demri
Theoretical Computer Science
300
(1-3), 2003, pp. 235-258
General parameterised refinement and recursion for the
M
-net calculus
Raymond Devillers
,
Hanna Klaudel
,
Robert-C. Riemann
Theoretical Computer Science
300
(1-3), 2003, pp. 259-300
Decision procedures for inductive Boolean functions based on alternating automata
Abdelwaheb Ayari
,
David Basin
,
Felix Klaedtke
Theoretical Computer Science
300
(1-3), 2003, pp. 301-329
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem
Lorenzo Carlucci
Theoretical Computer Science
300
(1-3), 2003, pp. 365-378
Typing correspondence assertions for communication protocols
Andrew D. Gordon
,
Alan Jeffrey
Theoretical Computer Science
300
(1-3), 2003, pp. 379-409
The power of reachability testing for timed automata
Luca Aceto
,
Patricia Bouyer
,
Augusto Burgueño
,
Kim G. Larsen
Theoretical Computer Science
300
(1-3), 2003, pp. 411-475
Decidability results for primitive recursive algorithms
R. David
Theoretical Computer Science
300
(1-3), 2003, pp. 477-504
The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications
Bruno Courcelle
Theoretical Computer Science
299
(1-3), 2003, pp. 1-36
Complexity of perceptron recognition for a class of geometric patterns
Julio Aracena
,
Eric Goles
Theoretical Computer Science
299
(1-3), 2003, pp. 65-79
On a conjecture on bidimensional words
Chiara Epifanio
,
Michel Koskas
,
Filippo Mignosi
Theoretical Computer Science
299
(1-3), 2003, pp. 123-150
Structuring the elementary components of graphs having a perfect internal matching
Miklós Bartha
,
Miklós Krész
Theoretical Computer Science
299
(1-3), 2003, pp. 179-210
Approximation algorithms for NMR spectral peak assignment
Zhi-Zhong Chen
,
Tao Jiang
,
Guohui Lin
,
Jianjun Wen
,
Dong Xu
,
Jinbo Xu
,
Ying Xu
Theoretical Computer Science
299
(1-3), 2003, pp. 211-229
Fringe analysis of synchronized parallel insertion algorithms in 2-3 trees
R. Baeza-Yates
,
J. Gabarró
,
X. Messeguer
Theoretical Computer Science
299
(1-3), 2003, pp. 231-271
Alternating and empty alternating auxiliary stack automata
Markus Holzer
,
Pierre McKenzie
Theoretical Computer Science
299
(1-3), 2003, pp. 307-326
On omega context free languages which are Borel sets of infinte rank
Olivier Finkel
Theoretical Computer Science
299
(1-3), 2003, pp. 327-346
Presburger liveness verification of discrete timed automata
Zhe Dang
,
Pierluigi San Pietro
,
Richard A. Kemmerer
Theoretical Computer Science
299
(1-3), 2003, pp. 413-438
Lower bounds for on-line single-machine scheduling
Leah Epstein
,
Rob van Stee
Theoretical Computer Science
299
(1-3), 2003, pp. 439-450
Cellular automata and strongly irreducible shifts of finite type
Francesca Fiorenzi
Theoretical Computer Science
299
(1-3), 2003, pp. 477-493
Number-conserving cellular automata I: Decidability
Bruno Durand
,
Enrico Formenti
,
Zsuzsanna Róka
Theoretical Computer Science
299
(1-3), 2003, pp. 523-535
Towards optimal lower bounds for clique and chromatic number
Lars Engebretsen
,
Jonas Holmerin
Theoretical Computer Science
299
(1-3), 2003, pp. 537-584
An asymptotic study for path reversal
Alain Giorgetti
Theoretical Computer Science
299
(1-3), 2003, pp. 585-602
Hybrid modes in cooperating distributed grammar systems: Combining the
t
-mode with the modes
\leq k
and
=k
H. Fernau
,
M. Holzer
,
R. Freund
Theoretical Computer Science
299
(1-3), 2003, pp. 633-662
On finding common neighborhoods in massive graphs
Adam L. Buchsbaum
,
Raffaele Giancarlo
,
Jeffery R. Westbrook
Theoretical Computer Science
299
(1-3), 2003, pp. 707-718
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>