Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4698

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

Nash equilibria: Where we stand
Christos H. Papadimitriou
Lecture Notes in Computer Science 4698, 2007, pp. 1-1
Small worlds as navigable augmented networks: Model, analysis, and validation
Pierre Fraigniaud
Lecture Notes in Computer Science 4698, 2007, pp. 2-11
Arrangements in geometry: Recent advances and challenges
Micha Sharir
Lecture Notes in Computer Science 4698, 2007, pp. 12-16
Nash equilibria in Voronoi games on graphs
Christoph Dürr, Nguyen Kim Thang
Lecture Notes in Computer Science 4698, 2007, pp. 17-28
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Petra Berenbrink, Oliver Schulte
Lecture Notes in Computer Science 4698, 2007, pp. 29-40
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu
Lecture Notes in Computer Science 4698, 2007, pp. 41-52
Finding frequent elements in non-bursty streams
Rina Panigrahy, Dilys Thomas
Lecture Notes in Computer Science 4698, 2007, pp. 53-62
Tradeoffs and average-case equilibria in selfish routing
Martin Hoefer, Alexander Souza
Lecture Notes in Computer Science 4698, 2007, pp. 63-74
On the variance of subset sum estimation
Mario Szegedy, Mikkel Thorup
Lecture Notes in Computer Science 4698, 2007, pp. 75-86
On minimum power connectivity problems
Yuval Lando, Zeev Nutov
Lecture Notes in Computer Science 4698, 2007, pp. 87-98
On the cost of interchange rearrangement in strings
Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
Lecture Notes in Computer Science 4698, 2007, pp. 99-110
Finding mobile data: Efficiency vs. location inaccuracy
Amotz Bar-Noy, Joanna Klukowska
Lecture Notes in Computer Science 4698, 2007, pp. 111-122
A faster query algorithm for the text fingerprinting problem
Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang
Lecture Notes in Computer Science 4698, 2007, pp. 123-135
Polynomial time algorithms for minimum energy scheduling
Philippe Baptiste, Marek Chrobak, Christoph Dürr
Lecture Notes in Computer Science 4698, 2007, pp. 136-150
k-mismatch with don't cares
Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
Lecture Notes in Computer Science 4698, 2007, pp. 151-162
Finding branch-decompositions and rank-decompositions
Petr Hlinȇný, Sang-il Oum
Lecture Notes in Computer Science 4698, 2007, pp. 163-174
Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover
Noga Alon, Raphael Yuster
Lecture Notes in Computer Science 4698, 2007, pp. 175-186
Linear-time ranking of permutations
Martin Mares̑, Milan Straka
Lecture Notes in Computer Science 4698, 2007, pp. 187-193
Radix sorting with no extra space
Gianni Franceschini, S. Muthukrishnan, Mihai Pȃtraşcu
Lecture Notes in Computer Science 4698, 2007, pp. 194-205
Fast low degree connectivity of ad-hoc networks via percolation
Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi
Lecture Notes in Computer Science 4698, 2007, pp. 206-217
Order statistics in the Farey sequences in sublinear time
Jakub Pawlewicz
Lecture Notes in Computer Science 4698, 2007, pp. 218-229
New results on minimax regret single facility ordered median location problems on networks
Justo Puerto, Antonio M. Rodriguez-Chia, Arie Tamir
Lecture Notes in Computer Science 4698, 2007, pp. 230-240
Dial a ride from k-forest
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
Lecture Notes in Computer Science 4698, 2007, pp. 241-252
Online primal-dual algorithms for maximizing ad-auctions revenue
Niv Buchbinder, Kamal Jain, Joseph (Seffi) Naor
Lecture Notes in Computer Science 4698, 2007, pp. 253-264
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
Mirosƚaw Kowaluk, Andrzej Lingas
Lecture Notes in Computer Science 4698, 2007, pp. 265-274

Seiten 1 2 3 >