Skip to main content
  • Conference proceedings
  • © 2007

SOFSEM 2007: Theory and Practice of Computer Science

33nd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings

Conference proceedings info: SOFSEM 2007.

Buy it now

Buying options

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 (80 papers)

  1. Front Matter

  2. Invited Talks

    1. Graphs from Search Engine Queries

      • Ricardo Baeza-Yates
      Pages 1-8
    2. Model-Checking Large Finite-State Systems and Beyond

      • Luboš Brim, Mojmír Křetínský
      Pages 9-28
    3. Interaction and Realizability

      • Manfred Broy
      Pages 29-50
    4. A Short Introduction to Computational Social Choice

      • Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet
      Pages 51-69
    5. Distributed Models and Algorithms for Mobile Robot Systems

      • Asaf Efrima, David Peleg
      Pages 70-87
    6. Agreement Technologies

      • Nicholas R. Jennings
      Pages 111-113
    7. Automatic Testing of Object-Oriented Software

      • Bertrand Meyer, Ilinca Ciupa, Andreas Leitner, Lisa Ling Liu
      Pages 114-129
    8. Multimedia Retrieval Algorithmics

      • Remco C. Veltkamp
      Pages 138-154
  3. Foundations of Computer Science

    1. Size of Quantum Finite State Transducers

      • Ruben Agadzanyan, Rūsiņš Freivalds
      Pages 155-163
    2. Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles

      • Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
      Pages 164-175
    3. Straightening Drawings of Clustered Hierarchical Graphs

      • Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang
      Pages 176-187
    4. Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars

      • Hajo Broersma, Bert Marchal, Daniel Paulusma, A. N. M. Salman
      Pages 188-199
    5. About the Termination Detection in the Asynchronous Message Passing Model

      • Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel
      Pages 200-211
    6. Fast Approximate Point Set Matching for Information Retrieval

      • Raphaël Clifford, Benjamin Sach
      Pages 212-223
    7. Compressed Prefix Sums

      • O’Neil Delpratt, Naila Rahman, Rajeev Raman
      Pages 235-247

Other Volumes

  1. SOFSEM 2007: Theory and Practice of Computer Science

Bibliographic Information

Buy it now

Buying options

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