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=Theor.~Comput.~Sci. AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Branching bisimulation for probabilistic systems: Characteristics and decidability
Suzana Andova
,
Tim A.C. Willemse
Theoretical Computer Science
356
(3), 2006, pp. 325-355
Concurrent nets: A study of prefixing in process calculi
Emmanuel Beffara
,
François Maurel
Theoretical Computer Science
356
(3), 2006, pp. 356-373
On the
\omega
-language expressive power of extended Petri nets
A. Finkel
,
G. Geeraerts
,
J.-F. Raskin
,
L. Van Begin
Theoretical Computer Science
356
(3), 2006, pp. 374-386
On the expressive power of KLAIM-based calculi
Rocco De Nicola
,
Daniele Gorla
,
Rosario Pugliese
Theoretical Computer Science
356
(3), 2006, pp. 387-421
A CPS encoding of name-passing in higher-order mobile embedded resources
Mikkel Bundgaard
,
Thomas Hildebrandt
,
Jens Chr. Godskesen
Theoretical Computer Science
356
(3), 2006, pp. 422-439
Name-passing in an ambient-like calculus and its proof using spatial logic
Xudong Guan
Theoretical Computer Science
356
(3), 2006, pp. 440-467
Exploring networks with traceroute-like probes: Theory and simulations
Luca Dall'Asta
,
Ignacio Alvarez-Hamelin
,
Alain Barrat
,
Alexei Vázquez
,
Alessandro Vespignani
Theoretical Computer Science
355
(1), 2006, pp. 6-24
Broadcasting in unstructured peer-to-peer overlay networks
Fred S. Annexstein
,
Kenneth A. Berman
,
Mijhalo A. Jovanović
Theoretical Computer Science
355
(1), 2006, pp. 25-36
Efficiently covering complex networks with cliques of similar vertices
Michael Behrisch
,
Anusch Taraz
Theoretical Computer Science
355
(1), 2006, pp. 37-47
D2B: A de Bruijn based content-addressable network
Pierre Fraigniaud
,
Philippe Gauron
Theoretical Computer Science
355
(1), 2006, pp. 65-79
Could any graph be turned into a small-world?
Philippe Duchon
,
Nicolas Hanusse
,
Emmanuelle Lebhar
,
Nicolas Schabanel
Theoretical Computer Science
355
(1), 2006, pp. 96-103
Intersection types and lambda models
Fabio Alessi
,
Franco Barbanera
,
Mariangiola Dezani-Ciancaglini
Theoretical Computer Science
355
(2), 2006, pp. 108-126
NL-printable sets and nondeterministic Kolmogorov complexity
Eric Allender
Theoretical Computer Science
355
(2), 2006, pp. 127-138
k
-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Denis Béchet
,
Annie Foret
Theoretical Computer Science
355
(2), 2006, pp. 139-152
The universe of propositional approximations
Marcelo Finger
,
Renata Wassermann
Theoretical Computer Science
355
(2), 2006, pp. 153-166
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
Sven Hartmann
,
Sebastian Link
,
Klaus-Dieter Schewe
Theoretical Computer Science
355
(2), 2006, pp. 167-196
Computing queries with higher-order logics
Lauri Hella
,
José María Turull-Torres
Theoretical Computer Science
355
(2), 2006, pp. 197-214
Quantifier-free logic for nondeterministic theories
Yngve Lamo
,
Michaƚ Walicki
Theoretical Computer Science
355
(2), 2006, pp. 215-227
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Stavros G. Kolliopoulos
,
George Steiner
Theoretical Computer Science
355
(3), 2006, pp. 261-273
Asynchronous deterministic rendezvous in graphs
Gianluca De Marco
,
Luisa Gargano
,
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
,
Ugo Vaccaro
Theoretical Computer Science
355
(3), 2006, pp. 315-326
On the
k
-path cover problem for cacti
Zemin Jin
,
Xueliang Li
Theoretical Computer Science
355
(3), 2006, pp. 354-363
Edge-colouring of join graphs
Caterina De Simone
,
C.P. de Mello
Theoretical Computer Science
355
(3), 2006, pp. 364-370
The scientific works of Rainer Kemp (1949-2004)
Philippe Flajolet
,
Markus Nebel
,
Helmut Prodinger
Theoretical Computer Science
355
(3), 2006, pp. 371-381
Hausdorff dimension and oracle constructions
John M. Hitchcock
Theoretical Computer Science
355
(3), 2006, pp. 382-388
Degree-constrained decompositions of graphs: Bounded treewidth and planarity
Cristina Bazgan
,
Zsolt Tuza
,
Daniel Vanderpooten
Theoretical Computer Science
355
(3), 2006, pp. 389-395
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>