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=285
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Towards the notion of stability of approximation for hard optimization tasks and the Traveling Salesman problem
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Ralf Klasing
,
Sebastian Seibert
,
Walter Unger
Theoretical Computer Science
285
(1), 2002, pp. 3-24
QuickHeapsort, an efficient mix of classical sorting algorithms
D. Cantone
,
G. Cincotti
Theoretical Computer Science
285
(1), 2002, pp. 25-42
Online strategies for backups
Peter Damaschke
Theoretical Computer Science
285
(1), 2002, pp. 43-53
Approximating SVP
\infty
to within almost-polynomial factors is
NP
-hard
Irit Dinur
Theoretical Computer Science
285
(1), 2002, pp. 55-71
Modified binary searching for static tables
Donatella Merlini
,
Renzo Sprugnoli
,
M. Cecilia Verri
Theoretical Computer Science
285
(1), 2002, pp. 73-88
The hardness of placing street names in a Manhattan type map
Sebastian Seibert
,
Walter Unger
Theoretical Computer Science
285
(1), 2002, pp. 89-99
The convergence of stochastic algorithms solving flow shop scheduling
K. Steinhöfel
,
A. Albrecht
,
C.K. Wong
Theoretical Computer Science
285
(1), 2002, pp. 101-117
Rewriting logic: Roadmap and bibliography
Martí-Oliet
,
José Meseguer
Theoretical Computer Science
285
(2), 2002, pp. 121-154
ELAN from a rewriting logic point of view
Peter Borovanský
,
Claude Kirchner
,
Hélène Kirchner
,
Pierre-Etienne Moreau
Theoretical Computer Science
285
(2), 2002, pp. 155-185
Maude: Specification and programming in rewriting logic
M. Clavel
,
F. Durán
,
S. Eker
,
P. Lincoln
,
N. Martí-Oliet
,
J. Meseguer
,
J.F. Quesada
Theoretical Computer Science
285
(2), 2002, pp. 187-243
Reflection in conditional rewriting logic
Manuel Clavel
,
José Meseguer
Theoretical Computer Science
285
(2), 2002, pp. 245-288
Logical foundations of CafeOBJ
Răzvan Diaconescu
,
Kokichi Futatsugi
Theoretical Computer Science
285
(2), 2002, pp. 289-318
Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
Fabio Gadduccci
,
Ugo Montanari
Theoretical Computer Science
285
(2), 2002, pp. 319-358
Specification of real-time and hybrid systems in rewriting logic
Peter Csaba Ölveczky
,
José Meseguer
Theoretical Computer Science
285
(2), 2002, pp. 359-405
A Maude specification of an object-oriented model for telecommunication networks
Isabel Pita
,
Narciso Martí-Oliet
Theoretical Computer Science
285
(2), 2002, pp. 407-439
Actor theories in rewriting logic
Carolyn Talcott
Theoretical Computer Science
285
(2), 2002, pp. 441-485
Equational rules for rewriting logic
Patrick Viry
Theoretical Computer Science
285
(2), 2002, pp. 487-517
A formal approach to object-oriented software engineering
Martin Wirsing
,
Alexander Knapp
Theoretical Computer Science
285
(2), 2002, pp. 519-560