- Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger:
On the Chromatic Number of Random Graphs. ICALP 2007: 777-788 - Thomas Colcombet:
A Combinatorial Theorem for Trees. ICALP 2007: 901-912 - Ivan Damgård:
A "proof-reading" of Some Issues in Cryptography. ICALP 2007: 2-11 - Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Model Theory Makes Formulas Large. ICALP 2007: 913-924 - Nenad Dedic, Payman Mohassel:
Constant-Round Private Database Queries. ICALP 2007: 255-266 - Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann:
An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157 - Nachum Dershowitz, Iddo Tzameret:
Complexity of Propositional Proofs Under a Promise. ICALP 2007: 291-302 - Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms. ICALP 2007: 15-27 - Michael Elkin:
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners. ICALP 2007: 716-727 - Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351 - Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing. ICALP 2007: 583-594 - Marcelo P. Fiore, Chung-Kil Hur:
Equational Systems and Free Constructions (Extended Abstract). ICALP 2007: 607-618 - Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242 - Gianni Franceschini, S. Muthukrishnan:
In-Place Suffix Sorting. ICALP 2007: 533-545 - Jun Furukawa, Nuttapong Attrapadung:
Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys. ICALP 2007: 496-508 - Hugo Gimbert, Wieslaw Zielonka:
Perfect Information Stochastic Priority Games. ICALP 2007: 850-861 - Jean Goubault-Larrecq:
Continuous Capacities on Continuous State Spaces. ICALP 2007: 764-776 - Martin Grohe, Magdalena Grüber:
Parameterized Approximability of the Disjoint Cycle Problem. ICALP 2007: 363-374 - Sudipto Guha, Andrew McGregor:
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming. ICALP 2007: 704-715 - Jiong Guo, Rolf Niedermeier:
Linear Problem Kernels for NP-Hard Problems on Planar Graphs. ICALP 2007: 375-386 - Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter:
A Framework for Dynamizing Succinct Data Structures. ICALP 2007: 521-532 - Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu:
Categorical Views on Computations on Trees (Extended Abstract). ICALP 2007: 619-630 - Meng He, J. Ian Munro, S. Srinivasa Rao:
Succinct Ordinal Trees Based on Tree Covering. ICALP 2007: 509-520 - Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright:
Private Multiparty Sampling and Approximation of Vector Combinations. ICALP 2007: 243-254 - Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Unbounded-Error One-Way Classical and Quantum Communication Complexity. ICALP 2007: 110-121 - Marcin Jurdzinski, Ashutosh Trivedi:
Reachability-Time Games on Timed Automata. ICALP 2007: 838-849 - Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh:
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). ICALP 2007: 328-339 - Karianto Wong, Christof Löding:
Unranked Tree Automata with Sibling Equalities and Disequalities. ICALP 2007: 875-887 - Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal:
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. ICALP 2007: 171-182 - Aggelos Kiayias, Hong-Sheng Zhou:
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge. ICALP 2007: 316-327