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 Volume=650
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Honest iteration schemes of randomizing algorithms
Jie Wang
,
Jay Belanger
Lecture Notes in Computer Science
650
, 1992, pp. 259-268
Approximating vertices of a convex polygon with grid points in the polygon
H.S. Lee
,
R.C. Chang
Lecture Notes in Computer Science
650
, 1992, pp. 269-278
Algorithms for determining the geometrical congruity in two and three dimensions
Tatsuya Akutsu
Lecture Notes in Computer Science
650
, 1992, pp. 279-288
On the relationships among constrained geometric structures
Esther Jennings
,
Andrzej Lingas
Lecture Notes in Computer Science
650
, 1992, pp. 289-298
Generating small convergent systems can be extremely hard
Klaus Madlener
,
Friedrich Otto
,
Andrea Sattler-Klein
Lecture Notes in Computer Science
650
, 1992, pp. 299-308
Chew's theorem revisited - uniquely normalizing property of nonlinear term rewriting systems
Mizuhito Ogawa
Lecture Notes in Computer Science
650
, 1992, pp. 309-318
Higher order communicating processes with value-passing, assignment and return of results
Dominique Bolignano
,
Mourad Debabi
Lecture Notes in Computer Science
650
, 1992, pp. 319-331
Searching informed game trees
Wim Pijls
,
Arie de Bruin
Lecture Notes in Computer Science
650
, 1992, pp. 332-341
How to generate realistic sample problems for network optimization
Masao Iri
Lecture Notes in Computer Science
650
, 1992, pp. 342-350
Generalized assignment problems
Silvano Martello
,
Paolo Toth
Lecture Notes in Computer Science
650
, 1992, pp. 351-369
Recognizing an envelope of lines in linear time
Eric Guévremont
,
Jack Snoeyink
Lecture Notes in Computer Science
650
, 1992, pp. 370-377
Approximation of polygonal curves with minimum number of line segments
W.S. Chan
,
F. Chin
Lecture Notes in Computer Science
650
, 1992, pp. 378-387
Wiring knock-knee layouts: A global approach
Majid Sarrafzadeh
,
Dorothea Wagner
,
Frank Wagner
,
Karsten Weihe
Lecture Notes in Computer Science
650
, 1992, pp. 388-399
Algorithms for finding non-crossing paths with minimum total length in plane graphs
Jun-ya Takahashi
,
Hitoshi Suzuki
,
Takao Nishizeki
Lecture Notes in Computer Science
650
, 1992, pp. 400-409
On symmetry of information and polynomial time invertibility
Luc Longpré
,
Osamu Watanabe
Lecture Notes in Computer Science
650
, 1992, pp. 410-419
On probabilistic ACC circuits with an exact-threshold output gate
Richard Beigel
,
Jun Tarui
,
Seinosuke Toda
Lecture Notes in Computer Science
650
, 1992, pp. 420-429
Computational and statistical indistinguishabilities
Kaoru Kurosawa
,
Osamu Watanabe
Lecture Notes in Computer Science
650
, 1992, pp. 430-438
On symmetric differences of NP-hard sets with weakly-P-selective sets
Bin Fu
,
Hong-zhou Li
Lecture Notes in Computer Science
650
, 1992, pp. 439-448
Restricted track assignment with applications
Majid Sarrafzadeh
,
D.T. Lee
Lecture Notes in Computer Science
650
, 1992, pp. 449-458
A simple test for the consecutive ones property
Wen-Lian Hsu
Lecture Notes in Computer Science
650
, 1992, pp. 459-468
The longest common subsequence problem for small alphabet size between many strings
Koji Hakata
,
Hiroshi Imai
Lecture Notes in Computer Science
650
, 1992, pp. 469-478
The implicit dictionary problem revisited
Tak Wah Lam
,
Ka Hing Lee
Lecture Notes in Computer Science
650
, 1992, pp. 479-488
Sorting in-place with a worst case complexity of
n\log n-1.3n+O(\log n)
comparisons and
\varepsilon n \log n+O(1)
transports
Klaus Reinhardt
Lecture Notes in Computer Science
650
, 1992, pp. 489-498
Sorting and/by merging finger trees
Alistair Moffat
,
Ola Petersson
,
Nicholas C. Wormald
Lecture Notes in Computer Science
650
, 1992, pp. 499-508
Seiten
<
1
2