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: Series=LNCS AND YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hard promise problems and nonuniform complexity
L. Longpré
,
A.L. Selman
Lecture Notes in Computer Science
415
, 1990, pp. 216-226
On the construction of abstract Voronoi diagrams
K. Mehlhorn
,
St. Meiser
,
C. O'DĂșnlaing
Lecture Notes in Computer Science
415
, 1990, pp. 227-239
Approximation of convex figures by pairs of rectangles
O. Schwarzkopf
,
U. Fuchs
,
G. Rote
,
E. Welzl
Lecture Notes in Computer Science
415
, 1990, pp. 240-249
Nonblocking graphs: Greedy algorithms to compute disjoint paths
A. Schwill
Lecture Notes in Computer Science
415
, 1990, pp. 250-262
Infinite trees and automaton definable relations over
\omega
-words
W. Thomas
Lecture Notes in Computer Science
415
, 1990, pp. 263-277
Enumerative combinatorics and computer science
G. Viennot
Lecture Notes in Computer Science
415
, 1990, pp. 278-284
Failures semantics based on interval semiwords is a congruence for refinement
W. Vogler
Lecture Notes in Computer Science
415
, 1990, pp. 285-297
The analysis of local search problems and their heuristics
M. Yannakakis
Lecture Notes in Computer Science
415
, 1990, pp. 298-311
Seiten
<
1
2
3
4
5
6
7
8
9
10
11