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=1627
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scheduling trees onto hypercubes and grids is
NP
-complete
Satoshi Tayu
Lecture Notes in Computer Science
1627
, 1999, pp. 251-260
Approximations of weighted independent set and hereditary subset problems
Magnús M. Halldórsson
Lecture Notes in Computer Science
1627
, 1999, pp. 261-270
Multi-coloring trees
Magnús M. Halldórsson
,
Guy Kortsarz
,
Andrzej Proskurowski
,
Rabit Salman
,
Hadas Shachnai
,
Jan Arne Telle
Lecture Notes in Computer Science
1627
, 1999, pp. 271-280
On the complexity of approximating colored-graph problems
Andrea E.F. Clementi
,
Pierluigi Crescenzi
,
Gianluca Rossi
Lecture Notes in Computer Science
1627
, 1999, pp. 281-290
On the average sensitivity of testing square-free numbers
Anna Bernasconi
,
Carsten Damm
,
Igor E. Shparlinski
Lecture Notes in Computer Science
1627
, 1999, pp. 291-299
Binary enumerability of real numbers
Xizhong Zheng
Lecture Notes in Computer Science
1627
, 1999, pp. 300-309
GCD of many integers
Gene Cooperman
,
Sandra Feisel
,
Joachim von zur Gathen
,
George Havas
Lecture Notes in Computer Science
1627
, 1999, pp. 310-317
Multi-party finite computations
Tomasz Jurdziński
,
Mirosƚaw Kutyƚowski
,
Krzysztof Loryś
Lecture Notes in Computer Science
1627
, 1999, pp. 318-329
A dynamic-programming bound for the quadratic assignment problem
Ambros Marzetta
,
Adrian Brüngger
Lecture Notes in Computer Science
1627
, 1999, pp. 339-348
A new approach for speeding up enumeration algorithms and its application for matroid bases
Takeaki Uno
Lecture Notes in Computer Science
1627
, 1999, pp. 349-359
On routing in circulant graphs
Jin-Yi Cai
,
George Havas
,
Bernard Mans
,
Ajay Nerurkar
,
Jean-Pierre Seifert
,
Igor Shparlinski
Lecture Notes in Computer Science
1627
, 1999, pp. 360-369
Minimum congestion embedding of complete binary trees into tori
Akira Matsubayashi
,
Ryo Takasu
Lecture Notes in Computer Science
1627
, 1999, pp. 370-378
Maximum stabbing line in 2D plane
Francis Y.L. Chin
,
Cao An Wang
,
Fu Lee Wang
Lecture Notes in Computer Science
1627
, 1999, pp. 379-388
Generalized shooter location problem
Jeet Chaudhuri
,
Subhas C. Nandy
Lecture Notes in Computer Science
1627
, 1999, pp. 389-399
A competitive online algorithm for the paging problem with ``shelf'' memory
Sung-Pil Hong
Lecture Notes in Computer Science
1627
, 1999, pp. 400-408
Using generalized forecasts for online currency conversion
Kazuo Iwama
,
Kouki Yonezawa
Lecture Notes in Computer Science
1627
, 1999, pp. 409-421
On
S
-regular prefix-rewriting systems and automatic structures
Friedrich Otto
Lecture Notes in Computer Science
1627
, 1999, pp. 422-431
Tractable and intractable second-order matching problems
Kouichi Hirata
,
Keizo Yamada
,
Masateru Harao
Lecture Notes in Computer Science
1627
, 1999, pp. 432-441
Efficient fixed-size systolic arrays for the modular multiplication
Sung-Woo Lee
,
Hyun-Sung Kim
,
Jung-Joon Kim
,
Tae-Geun Kim
,
Kee-Young Yoo
Lecture Notes in Computer Science
1627
, 1999, pp. 442-451
Improving parallel computation with fast integer sorting
Ka Wong Chong
,
Yijie Han
,
Yoshihide Igarashi
,
Tak Wah Lam
Lecture Notes in Computer Science
1627
, 1999, pp. 452-461
A combinatorial approach to performance analysis of a shared-memory multiprocessor
Sajal K. Das
,
Bhabani P. Sinha
,
Rajarshi Chaudhuri
Lecture Notes in Computer Science
1627
, 1999, pp. 462-472
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
Joachim Gudmundsson
,
Christos Levcopoulos
Lecture Notes in Computer Science
1627
, 1999, pp. 473-482
The greedier the better: An efficient algorithm for approximating maximum independent set
H.Y. Lau
,
H.F. Ting
Lecture Notes in Computer Science
1627
, 1999, pp. 483-492
Seiten
<
1
2