Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2007

Algorithms - ESA 2007

15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings

Editors:

  1. Lars Arge
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michael Hoffmann
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Emo Welzl
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4698)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ESA: European Symposium on Algorithms

Conference proceedings info: ESA 2007.

Sections

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (66 papers)

  1. Front Matter

    PDF

  2. Invited Lectures

    1. Nash Equilibria: Where We Stand

      • Christos H. Papadimitriou
      Pages 1-1

  3. Contributed Papers: Design and Analysis Track

    1. Nash Equilibria in Voronoi Games on Graphs

      • Christoph Dürr, Nguyen Kim Thang
      Pages 17-28

    3. Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks

      • Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu
      Pages 41-52

    4. Finding Frequent Elements in Non-bursty Streams

      • Rina Panigrahy, Dilys Thomas
      Pages 53-62

    5. Tradeoffs and Average-Case Equilibria in Selfish Routing

      • Martin Hoefer, Alexander Souza
      Pages 63-74

    6. On the Variance of Subset Sum Estimation

      • Mario Szegedy, Mikkel Thorup
      Pages 75-86

    7. On Minimum Power Connectivity Problems

      • Yuval Lando, Zeev Nutov
      Pages 87-98

    8. On the Cost of Interchange Rearrangement in Strings

      • Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
      Pages 99-110

    9. Finding Mobile Data: Efficiency vs. Location Inaccuracy

      • Amotz Bar-Noy, Joanna Klukowska
      Pages 111-122

    10. A Faster Query Algorithm for the Text Fingerprinting Problem

      • Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang
      Pages 123-135

    11. Polynomial Time Algorithms for Minimum Energy Scheduling

      • Philippe Baptiste, Marek Chrobak, Christoph Dürr
      Pages 136-150

    12. k-Mismatch with Don’t Cares

      • Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
      Pages 151-162

    13. Finding Branch-Decompositions and Rank-Decompositions

      • Petr Hliněný, Sang-il Oum
      Pages 163-174

    15. Linear-Time Ranking of Permutations

      • Martin Mareš, Milan Straka
      Pages 187-193

    16. Radix Sorting with No Extra Space

      • Gianni Franceschini, S. Muthukrishnan, Mihai Pǎtraşcu
      Pages 194-205
Back to top

Other Volumes

  1. Algorithms – ESA 2007

Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation