Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=6347

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Data structures: Time, I/Os, entropy, joules!
Paolo Ferragina
Lecture Notes in Computer Science 6347, 2010, pp. 1-16
Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
Lecture Notes in Computer Science 6347, 2010, pp. 17-28
Computing pure Nash and strong equilibria in bottleneck congestion games
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
Lecture Notes in Computer Science 6347, 2010, pp. 29-38
Combinatorial auctions with verification are tractable
Piotr Krysta, Carmine Ventre
Lecture Notes in Computer Science 6347, 2010, pp. 39-50
How to allocate goods in an online market?
Yossi Azar, Niv Buchbinder, Kamal Jain
Lecture Notes in Computer Science 6347, 2010, pp. 51-62
Fréchet distance of surfaces: Some simple hard cases
Kevin Buchin, Maike Buchin, André Schulz
Lecture Notes in Computer Science 6347, 2010, pp. 63-74
Geometric algorithms for private-cache chip multiprocessors
Deepak Ajwani, Nodari Sitchinava, Norbert Zeh
Lecture Notes in Computer Science 6347, 2010, pp. 75-86
Volume in general metric spaces
Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
Lecture Notes in Computer Science 6347, 2010, pp. 87-99
Shortest cut graph of a surface with prescribed vertex set
Éric Colin de Verdi`ere
Lecture Notes in Computer Science 6347, 2010, pp. 100-111
Induced matchings in subcubic planar graphs
Ross J. Kang, Matthias Mnich, Tobias Müller
Lecture Notes in Computer Science 6347, 2010, pp. 112-122
Robust matchings and matroid intersections
Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino
Lecture Notes in Computer Science 6347, 2010, pp. 123-134
A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
Lecture Notes in Computer Science 6347, 2010, pp. 135-146
Strongly stable assignment
Ning Chen, Arpita Ghosh
Lecture Notes in Computer Science 6347, 2010, pp. 147-158
Data structures for storing small sets in the bitprobe model
Jaikumar Radhakrishnan, Smit Shah, Saswata Shannigrahi
Lecture Notes in Computer Science 6347, 2010, pp. 159-170
On space efficient two dimensional range minimum data structures
Gerth Stlting Brdal, Pooya Davoodi, S. Srinivasa Rao
Lecture Notes in Computer Science 6347, 2010, pp. 171-182
Pairing heaps with costless meld
Amr Elmasry
Lecture Notes in Computer Science 6347, 2010, pp. 183-193
Top-k ranked document search in general text databases
J. Shane Culpepper, Gonzalo Navarro, Simon J. Puglisi, Andrew Turpin
Lecture Notes in Computer Science 6347, 2010, pp. 194-205
Shortest paths in planar graphs with real lengths in O(n\log^{2}n/\log\log n) time
Shay Mozes, Christian Wulff-Nilsen
Lecture Notes in Computer Science 6347, 2010, pp. 206-217
When LP is the cure for your matching woes: Improved bounds for stochastic matchings
Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra
Lecture Notes in Computer Science 6347, 2010, pp. 218-229
Feasibility analysis of sporadic real-time multiprocessor task systems
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela
Lecture Notes in Computer Science 6347, 2010, pp. 230-241