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=2906

• A generalized Gale-Shapley algorithm for a discrete-concave stable-marriage model
  Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura
  Lecture Notes in Computer Science 2906, 2003, pp. 495-504
• Succinct data structures for searchable partial sums
  Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
  Lecture Notes in Computer Science 2906, 2003, pp. 505-516
• Range mode and range median queries on lists and trees
  Danny Krizanc, Pat Morin, Michiel Smid
  Lecture Notes in Computer Science 2906, 2003, pp. 517-526
• Quasi-perfect minimally adaptive q-ary search with unreliable tests
  Ferdinando Cicalese, Christian Deppe
  Lecture Notes in Computer Science 2906, 2003, pp. 527-536
• New ways to construct binary search trees
  Travis Gagie
  Lecture Notes in Computer Science 2906, 2003, pp. 537-543
• Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
  Artur Czumaj, Andrzej Lingas, Johan Nilsson
  Lecture Notes in Computer Science 2906, 2003, pp. 544-553
• Biconnectivity on symbolically represented graphs: A linear solution
  Raffaella Gentilini, Alberto Policriti
  Lecture Notes in Computer Science 2906, 2003, pp. 554-564
• A dynamic data structure for maintaining disjoint paths information in digraphs
  Torsten Tholey
  Lecture Notes in Computer Science 2906, 2003, pp. 565-574
• Deterministic algorithm for the t-threshold set problem
  Jérémy Barbay, Claire Kenyon
  Lecture Notes in Computer Science 2906, 2003, pp. 575-584
• Energy-efficient wireless network design
  Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
  Lecture Notes in Computer Science 2906, 2003, pp. 585-594
• Wavelength conversion in shortest-path all-optical networks
  Thomas Erlebach, Stamatis Stefanakos
  Lecture Notes in Computer Science 2906, 2003, pp. 595-604
• A heuristic for the stacker crane problem on trees which is almost surely exact
  Amin Coja-Oghlan, Sven O. Krumke, Till Nierhoff
  Lecture Notes in Computer Science 2906, 2003, pp. 605-614
• Flexible train rostering
  Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer
  Lecture Notes in Computer Science 2906, 2003, pp. 615-624
• Counting complexity classes over the reals I: The additive case
  Peter Bürgisser, Felipe Cucker
  Lecture Notes in Computer Science 2906, 2003, pp. 625-634
• Some properties of one-pebble Turing machines with sublogarithmic space
  Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki
  Lecture Notes in Computer Science 2906, 2003, pp. 635-644
• Hypergraph decomposition and secret sharing
  Giovanni Di Crescenzo, Clemente Galdi
  Lecture Notes in Computer Science 2906, 2003, pp. 645-654
• A promising key agreement protocol
  Eun-Kyung Ryu, Kee-Won Kim, Kee-Young Yoo
  Lecture Notes in Computer Science 2906, 2003, pp. 655-662
• Rapid mixing of several Markov chains for a hard-core model
  Ravi Kannan, Michael W. Mahoney, Ravi Montenegro
  Lecture Notes in Computer Science 2906, 2003, pp. 663-675
• Polynomial time approximate sampler for discretized Dirichlet distribution
  Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
  Lecture Notes in Computer Science 2906, 2003, pp. 676-685
• Fair cost allocations under conflicts - A game-theoretic point of view
  Yoshio Okamoto
  Lecture Notes in Computer Science 2906, 2003, pp. 686-695
• Equilibria for networks with malicious users
  George Karakostas, Anastasios Viglas
  Lecture Notes in Computer Science 2906, 2003, pp. 696-704
• Quasi-optimal arithmetic for quaternion polynomials
  Martin Ziegler
  Lecture Notes in Computer Science 2906, 2003, pp. 705-715
• Upper bounds on the complexity of some Galois theory problems
  V. Arvind, Piyush P. Kurur
  Lecture Notes in Computer Science 2906, 2003, pp. 716-725
• Unfolded modular multiplication
  Wieland Fischer, Jean-Pierre Seifert
  Lecture Notes in Computer Science 2906, 2003, pp. 726-735
• Gauss period, sparse polynomial, redundant basis, and efficient exponentiation for a class of finite fields with small characteristic
  Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong
  Lecture Notes in Computer Science 2906, 2003, pp. 736-745