Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Lars Arge
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Christian Cachin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Tomasz Jurdziński
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Andrzej Tarlecki
    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 4596)

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

Included in the following conference series:

Conference proceedings info: ICALP 2007.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (81 papers)

  1. Session A6

    1. Exotic Quantifiers, Complexity Classes, and Complete Problems

      • Peter Bürgisser, Felipe Cucker
      Pages 207-218

  2. Session A7

    1. Online Conflict-Free Colorings for Hypergraphs

      • Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
      Pages 219-230

    2. Distributed Computing with Advice: Information Sensitivity of Graph Coloring

      • Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
      Pages 231-242

  3. Session C1

    1. Private Multiparty Sampling and Approximation of Vector Combinations

      • Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
      Pages 243-254

    2. Constant-Round Private Database Queries

      • Nenad Dedic, Payman Mohassel
      Pages 255-266

  4. Session A8

    1. Universal Algebra and Hardness Results for Constraint Satisfaction Problems

      • Benoît Larose, Pascal Tesson
      Pages 267-278

    2. On the Power of k-Consistency

      • Albert Atserias, Andrei Bulatov, Victor Dalmau
      Pages 279-290

    3. Complexity of Propositional Proofs Under a Promise

      • Nachum Dershowitz, Iddo Tzameret
      Pages 291-302

  5. Session C2

    1. Deterministic History-Independent Strategies for Storing Information on Write-Once Memories

      • Tal Moran, Moni Naor, Gil Segev
      Pages 303-315

    2. Trading Static for Adaptive Security in Universally Composable Zero-Knowledge

      • Aggelos Kiayias, Hong-Sheng Zhou
      Pages 316-327

    3. A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)

      • Bruce Kapron, Lior Malka, Venkatesh Srinivasan
      Pages 328-339

  6. Session A9

    1. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs

      • Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
      Pages 340-351

    2. Parameterized Algorithms for Directed Maximum Leaf Problems

      • Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
      Pages 352-362

    3. Parameterized Approximability of the Disjoint Cycle Problem

      • Martin Grohe, Magdalena Grüber
      Pages 363-374

    4. Linear Problem Kernels for NP-Hard Problems on Planar Graphs

      • Jiong Guo, Rolf Niedermeier
      Pages 375-386

  7. Session C3

    1. Private Locally Decodable Codes

      • Rafail Ostrovsky, Omkant Pandey, Amit Sahai
      Pages 387-398

    2. Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms

      • Mihir Bellare, Thomas Ristenpart
      Pages 399-410

    3. Unrestricted Aggregate Signatures

      • Mihir Bellare, Chanathip Namprempre, Gregory Neven
      Pages 411-422

    4. Ring Signatures of Sub-linear Size Without Random Oracles

      • Nishanth Chandran, Jens Groth, Amit Sahai
      Pages 423-434

  8. Session A10

    1. Balanced Families of Perfect Hash Functions and Their Applications

      • Noga Alon, Shai Gutner
      Pages 435-446
Back to top

Other volumes

  1. Automata, Languages and Programming

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation