| 2007 | A "proof-reading" of Some Issues in Cryptography. Ivan Damgård |
| 2007 | A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh |
| 2007 | A Combinatorial Theorem for Trees. Thomas Colcombet |
| 2007 | A Framework for Dynamizing Succinct Data Structures. Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter |
| 2007 | A Fully Abstract Trace Semantics for General References. James Laird |
| 2007 | A Generalization of Cobham's Theorem to Automata over Real Numbers. Bernard Boigelot, Julien Brusten |
| 2007 | A Lower Bound on Entanglement-Assisted Quantum Communication Complexity. Ashley Montanaro, Andreas J. Winter |
| 2007 | Affine Systems of Equations and Counting Infinitary Logic. Albert Atserias, Andrei A. Bulatov, Anuj Dawar |
| 2007 | Aliased Register Allocation for Straight-Line Programs Is NP-Complete. Jonathan K. Lee, Jens Palsberg, Fernando Magno Quintão Pereira |
| 2007 | An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. Ioannis Caragiannis, Michele Flammini, Luca Moscardelli |
| 2007 | An Optimal Decomposition Algorithm for Tree Edit Distance. Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann |
| 2007 | Approximation by DNF: Examples and Counterexamples. Ryan O'Donnell, Karl Wimmer |
| 2007 | Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki |
| 2007 | Balanced Families of Perfect Hash Functions and Their Applications. Noga Alon, Shai Gutner |
| 2007 | Bounded Depth Data Trees. Henrik Björklund, Mikolaj Bojanczyk |
| 2007 | Boundedness of Monadic FO over Acyclic Structures. Stephan Kreutzer, Martin Otto, Nicole Schweikardt |
| 2007 | Categorical Views on Computations on Trees (Extended Abstract). Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu |
| 2007 | Checking and Spot-Checking the Correctness of Priority Queues. Matthew Chu, Sampath Kannan, Andrew McGregor |
| 2007 | Co-Logic Programming: Extending Logic Programming with Coinduction. Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta |
| 2007 | Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal |
| 2007 | Competitive Algorithms for Due Date Scheduling. Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs |
| 2007 | Complexity of Propositional Proofs Under a Promise. Nachum Dershowitz, Iddo Tzameret |
| 2007 | Complexity of the Cover Polynomial. Markus Bläser, Holger Dell |
| 2007 | Conservative Ambiguity Detection in Context-Free Grammars. Sylvain Schmitz |
| 2007 | Constant-Round Private Database Queries. Nenad Dedic, Payman Mohassel |
| 2007 | Continuous Capacities on Continuous State Spaces. Jean Goubault-Larrecq |
| 2007 | Credentials-Based Authorization: Evaluation and Implementation. Fred B. Schneider |
| 2007 | Decision Problems for Lower/Upper Bound Parametric Timed Automata. Laura Bozzelli, Salvatore La Torre |
| 2007 | Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. Tal Moran, Moni Naor, Gil Segev |
| 2007 | Distributed Computing with Advice: Information Sensitivity of Graph Coloring. Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc |
| 2007 | Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. Spyros C. Kontogiannis, Paul G. Spirakis |
| 2007 | Equational Systems and Free Constructions (Extended Abstract). Marcelo P. Fiore, Chung-Kil Hur |
| 2007 | Estimating Sum by Weighted Sampling. Rajeev Motwani, Rina Panigrahy, Ying Xu |
| 2007 | Exotic Quantifiers, Complexity Classes, and Complete Problems. Peter Bürgisser, Felipe Cucker |
| 2007 | Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys. Jun Furukawa, Nuttapong Attrapadung |
| 2007 | Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. Mihir Bellare, Thomas Ristenpart |
| 2007 | Holographic Algorithms: The Power of Dimensionality Resolved. Jin-Yi Cai, Pinyan Lu |
| 2007 | In-Place Suffix Sorting. Gianni Franceschini, S. Muthukrishnan |
| 2007 | Labeling Schemes for Vertex Connectivity. Amos Korman |
| 2007 | Linear Problem Kernels for NP-Hard Problems on Planar Graphs. Jiong Guo, Rolf Niedermeier |
| 2007 | Low Distortion Spanners. Seth Pettie |
| 2007 | Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming. Sudipto Guha, Andrew McGregor |
| 2007 | Maximal Infinite-Valued Constraint Languages. Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen |
| 2007 | Mechanism Design for Fractional Scheduling on Unrelated Machines. George Christodoulou, Elias Koutsoupias, Annamária Kovács |
| 2007 | Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. André Berger, Michelangelo Grigni |
| 2007 | Minimum-Time Reachability in Timed Games. Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin |
| 2007 | Model Theory Makes Formulas Large. Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
| 2007 | Modular Algorithms for Heterogeneous Modal Logics. Lutz Schröder, Dirk Pattinson |
| 2007 | Offline/Online Mixing. Ben Adida, Douglas Wikström |
| 2007 | On Commutativity Based Edge Lean Search. Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron A. Peled |
| 2007 | On the Chromatic Number of Random Graphs. Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger |
| 2007 | On the Complexity of Hard-Core Set Constructions. Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu |
| 2007 | On the Complexity of LtlModel-Checking of Recursive State Machines. Salvatore La Torre, Gennaro Parlato |
| 2007 | On the Power of Albert Atserias, Andrei A. Bulatov, Víctor Dalmau |
| 2007 | Online Conflict-Free Colorings for Hypergraphs. Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky |
| 2007 | Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics. Matthew Cary, Atri Rudra, Ashish Sabharwal |
| 2007 | Parameterized Algorithms for Directed Maximum Leaf Problems. Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh |
| 2007 | Parameterized Approximability of the Disjoint Cycle Problem. Martin Grohe, Magdalena Grüber |
| 2007 | Perfect Information Stochastic Priority Games. Hugo Gimbert, Wieslaw Zielonka |
| 2007 | Private Locally Decodable Codes. Rafail Ostrovsky, Omkant Pandey, Amit Sahai |
| 2007 | Private Multiparty Sampling and Approximation of Vector Combinations. Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright |
| 2007 | Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht |
| 2007 | Reachability-Time Games on Timed Automata. Marcin Jurdzinski, Ashutosh Trivedi |
| 2007 | Ready Simulation for Concurrency: It's Logical! Gerald Lüttgen, Walter Vogler |
| 2007 | Reconciling Data Compression and Kolmogorov Complexity. Laurent Bienvenu, Wolfgang Merkle |
| 2007 | Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. Marcelo Arenas, Pablo Barceló, Leonid Libkin |
| 2007 | Ring Signatures of Sub-linear Size Without Random Oracles. Nishanth Chandran, Jens Groth, Amit Sahai |
| 2007 | Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima. Johannes Blömer, Stefanie Naewe |
| 2007 | Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel |
| 2007 | Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette |
| 2007 | Size Competitive Meshing Without Large Angles. Gary L. Miller, Todd Phillips, Donald R. Sheehy |
| 2007 | Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners. Michael Elkin |
| 2007 | Strong Price of Anarchy for Machine Load Balancing. Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky |
| 2007 | Subexponential Parameterized Algorithms. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
| 2007 | Succinct Ordinal Trees Based on Tree Covering. Meng He, J. Ian Munro, S. Srinivasa Rao |
| 2007 | Trading Static for Adaptive Security in Universally Composable Zero-Knowledge. Aggelos Kiayias, Hong-Sheng Zhou |
| 2007 | Unbounded-Error One-Way Classical and Quantum Communication Complexity. Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita |
| 2007 | Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the Naoki Kobayashi, Takashi Suto |
| 2007 | Universal Algebra and Hardness Results for Constraint Satisfaction Problems. Benoît Larose, Pascal Tesson |
| 2007 | Unranked Tree Automata with Sibling Equalities and Disequalities. Karianto Wong, Christof Löding |
| 2007 | Unrestricted Aggregate Signatures. Mihir Bellare, Chanathip Namprempre, Gregory Neven |
| 2007 | Ushering in a New Era of Algorithm Design. Bernard Chazelle |