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.
An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal
Michael T. Goodrich
,
Mikhail J. Atallah
,
Mark H. Overmars
Lecture Notes in Computer Science
443
, 1990, pp. 689-702
Approximation of convex polygons
Helmut Alt
,
Johannes Blömer
,
Michael Godau
,
Hubert Wagener
Lecture Notes in Computer Science
443
, 1990, pp. 703-716
On the rectilinear art gallery problem
Frank Hoffmann
Lecture Notes in Computer Science
443
, 1990, pp. 717-728
On parallel hashing and integer sorting
Yossi Matias
,
Uzi Vishkin
Lecture Notes in Computer Science
443
, 1990, pp. 729-743
The parallel simplicity of compaction and chaining
Prabhakar Ragde
Lecture Notes in Computer Science
443
, 1990, pp. 744-751
The importance of the left merge operator in process algebras
Faron Moller
Lecture Notes in Computer Science
443
, 1990, pp. 752-764
Operational and algebraic semantics for Facile
Sanjiva Prasad
,
Alessandro Giacalone
,
Prateek Mishra
Lecture Notes in Computer Science
443
, 1990, pp. 765-780
A note on the almost-everywhere hierarchy for nondeterministic time
E. Allender
,
R. Beigel
,
U. Hertrampf
,
S. Homer
Lecture Notes in Computer Science
415
, 1990, pp. 1-11
The ring of
k
-regular sequences
J.-P. Allouche
,
J. Shallit
Lecture Notes in Computer Science
415
, 1990, pp. 12-23
Minimal pairs and complete problems
K. Ambos-Spies
,
S. Homer
,
R.I. Soare
Lecture Notes in Computer Science
415
, 1990, pp. 24-36
Hiding instances in multioracle queries
D. Beaver
,
J. Feigenbaum
Lecture Notes in Computer Science
415
, 1990, pp. 37-48
Counting classes: Thresholds, parity, mods, and fewness
R. Beigel
,
J. Gill
,
U. Hertrampf
Lecture Notes in Computer Science
415
, 1990, pp. 49-57
Playing games of incomplete information
J. Cai
,
A. Condon
,
R.J. Lipton
Lecture Notes in Computer Science
415
, 1990, pp. 58-69
Caterpillars and context-free languages
M.P. Chytil
,
B. Monien
Lecture Notes in Computer Science
415
, 1990, pp. 70-81
Semi-commutations and algebraic languages
M. Clerbout
,
Y. Roos
Lecture Notes in Computer Science
415
, 1990, pp. 82-94
Towards a process semantics in the logic programming style
A. Corradini
,
U. Montanari
Lecture Notes in Computer Science
415
, 1990, pp. 95-108
Parallel computations on strings and arrays
M. Crochemore
,
W. Rytter
Lecture Notes in Computer Science
415
, 1990, pp. 109-125
Minimum vertex hulls for polyhedral domains
G. Das
,
D. Joseph
Lecture Notes in Computer Science
415
, 1990, pp. 126-137
Combinatorial rewriting on traces
V. Diekert
Lecture Notes in Computer Science
415
, 1990, pp. 138-151
Kolmogorov complexity, restricted nondeterminism and generalized spectra
D. Joseph
,
M. Sitharam
Lecture Notes in Computer Science
415
, 1990, pp. 152-164
Relation-sorted algebraic specifications with built-in coercers: Basic notions and results
H.-J. Kreowski
,
Z. Qian
Lecture Notes in Computer Science
415
, 1990, pp. 165-175
Computational power of one-way multihead finite automata
M. Kutyƚowski
Lecture Notes in Computer Science
415
, 1990, pp. 176-187
Updating almost complete trees or One level makes all the difference
T.W. Lai
,
D. Wood
Lecture Notes in Computer Science
415
, 1990, pp. 188-194
Sorting the sums
(x_i + y_j)
in
O(n^2)
comparisons
J.-L. Lambert
Lecture Notes in Computer Science
415
, 1990, pp. 195-206
Efficient checking of computations
R.J. Lipton
Lecture Notes in Computer Science
415
, 1990, pp. 207-215
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
>