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 Volume=343
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A mathematical model for the TCP tragedy of the commons
Luis López
,
Gemma del Rey Almansa
,
Stéphane Paquelet
,
Antonio Fernández
Theoretical Computer Science
343
(1-2), 2005, pp. 4-26
On the approximability of the range assignment problem on radio networks in presence of selfish agents
Christoph Ambühl
,
Andrea E.F. Clementi
,
Paolo Penna
,
Gianluca Rossi
,
Riccardo Silvestri
Theoretical Computer Science
343
(1-2), 2005, pp. 27-41
Games on triangulations
Oswin Aichholzer
,
David Bremner
,
Erik D. Demaine
,
Ferran Hurtado
,
Evangelos Kranakis
,
Hannes Krasser
,
Suneeta Ramaswami
,
Saurabh Sethia
,
Jorge Urrutia
Theoretical Computer Science
343
(1-2), 2005, pp. 42-71
P
SPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
Robert A. Hearn
,
Erik D. Demaine
Theoretical Computer Science
343
(1-2), 2005, pp. 72-96
Non-cooperative computation: Boolean functions with correctness and exclusivity
Yoav Shoham
,
Moshe Tennenholtz
Theoretical Computer Science
343
(1-2), 2005, pp. 97-113
Computation in a distributed information market
Joan Feigenbaum
,
Lance Fortnow
,
David M. Pennock
,
Rahul Sami
Theoretical Computer Science
343
(1-2), 2005, pp. 114-132
Structure and complexity of extreme nash equilibria
M. Gairing
,
T. Lücking
,
M. Mavronicolas
,
B. Monien
,
P. Spirakis
Theoretical Computer Science
343
(1-2), 2005, pp. 133-157
The first order definability of graphs with separators via the Ehrenfeucht game
Oleg Verbitsky
Theoretical Computer Science
343
(1-2), 2005, pp. 158-176
Syntax vs. semantics: A polarized approach
Olivier Laurent
Theoretical Computer Science
343
(1-2), 2005, pp. 177-206
Games for complexity of second-order call-by-name programs
Andrzej S. Murawski
Theoretical Computer Science
343
(1-2), 2005, pp. 207-236
Sequential algorithms and strongly stable functions
Paul-André Melliès
Theoretical Computer Science
343
(1-2), 2005, pp. 237-281
Polarized process algebra with reactive composition
J.A. Bergstra
,
I. Bethke
Theoretical Computer Science
343
(3), 2005, pp. 285-304
Behavioural specification for hierarchical object composition
Răzvan Diaconescu
Theoretical Computer Science
343
(3), 2005, pp. 305-331
Parameterised Boolean equation systems
Jan Friso Groote
,
Tim A.C. Willemse
Theoretical Computer Science
343
(3), 2005, pp. 332-369
Semantic essence of AsmL
Yuri Gurevich
,
Benjamin Rossman
,
Wolfram Schulte
Theoretical Computer Science
343
(3), 2005, pp. 370-412
A proof outline logic for object-oriented programming
Cees Pierik
,
Frank S. de Boer
Theoretical Computer Science
343
(3), 2005, pp. 413-442
A tutorial on coinductive stream calculus and signal flow graphs
J.J.M.M. Rutten
Theoretical Computer Science
343
(3), 2005, pp. 443-481
Formal specification and verification of the
C\sharp
thread model
Robert F. Stärk
Theoretical Computer Science
343
(3), 2005, pp. 482-508
Slicing techniques for verification re-use
Heike Wehrheim
Theoretical Computer Science
343
(3), 2005, pp. 509-528