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 [1]	Hilfe

Suche: Series=LNCS AND Volume=2108

• Competitive online scheduling with level of service
  Ee-Chien Chang, Chee Yap
  Lecture Notes in Computer Science 2108, 2001, pp. 453-462
• On-line variable sized covering
  Leah Epstein
  Lecture Notes in Computer Science 2108, 2001, pp. 463-472
• On testing for zero polynomials by a set of points with bounded precision
  Jin-Yi Cai, Eric Bach
  Lecture Notes in Computer Science 2108, 2001, pp. 473-482
• A randomized algorithm for gossiping in radio networks
  Marek Chrobak, Leszek Ga̧sieniec, Wojciech Rytter
  Lecture Notes in Computer Science 2108, 2001, pp. 483-492
• Deterministic application of Grover's quantum search algorithm
  Kyoichi Okamoto, Osamu Watanabe
  Lecture Notes in Computer Science 2108, 2001, pp. 493-501
• Random instance generation for MAX 3SAT
  Mitsuo Motoki
  Lecture Notes in Computer Science 2108, 2001, pp. 502-508
• The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points
  Dingzhu Du, Lusheng Wang, Baogang Xu
  Lecture Notes in Computer Science 2108, 2001, pp. 509-518
• An FPTAS for weight-constrained Steiner trees in series-parallel graphs
  Guangting Chen, Guoliang Xue
  Lecture Notes in Computer Science 2108, 2001, pp. 519-528
• Decidable approximations on generalized and parameterized discrete timed automata
  Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
  Lecture Notes in Computer Science 2108, 2001, pp. 529-539
• Multiplicative adaptive algorithms for user preference retrieval
  Zhixiang Chen
  Lecture Notes in Computer Science 2108, 2001, pp. 540-549
• Parametric scheduling for network constraints
  K. Subramani
  Lecture Notes in Computer Science 2108, 2001, pp. 550-560
• A logical framework for knowledge sharing in multi-agent systems
  Kaile Su, Xudong Luo, Huaiqing Wang, Chengqi Zhang, Shichao Zhang, Qingfeng Chen
  Lecture Notes in Computer Science 2108, 2001, pp. 561-570
• A lockout avoidance algorithm without using time-stamps for the k-exclusion problem
  Kumiko Obokata, Michiko Omori, Kazuhiro Motegi, Yoshihide Igarashi
  Lecture Notes in Computer Science 2108, 2001, pp. 571-575
• Prefix-free languages and initial segments of computably enumerable degrees
  Guohua Wu
  Lecture Notes in Computer Science 2108, 2001, pp. 576-585
• Weakly computable real numbers and total computable real functions
  Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl
  Lecture Notes in Computer Science 2108, 2001, pp. 586-595
• Turing computability of a nonlinear Schrödinger propagator
  Klaus Weihrauch, Ning Zhong
  Lecture Notes in Computer Science 2108, 2001, pp. 596-599