Abstract is missing.
- Ushering in a New Era of Algorithm DesignBernard Chazelle. 1 [doi]
- A proof-reading of Some Issues in CryptographyIvan Damgård. 2-11 [doi]
- Credentials-Based Authorization: Evaluation and ImplementationFred B. Schneider. 12-14 [doi]
- Subexponential Parameterized AlgorithmsFrederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. 15-27 [doi]
- Competitive Algorithms for Due Date SchedulingNikhil Bansal, Ho-Leung Chan, Kirk Pruhs. 28-39 [doi]
- Mechanism Design for Fractional Scheduling on Unrelated MachinesGeorge Christodoulou, Elias Koutsoupias, Annamária Kovács. 40-52 [doi]
- Estimating Sum by Weighted SamplingRajeev Motwani, Rina Panigrahy, Ying Xu 0002. 53-64 [doi]
- Sampling Methods for Shortest Vectors, Closest Vectors and Successive MinimaJohannes Blömer, Stefanie Naewe. 65-77 [doi]
- Low Distortion SpannersSeth Pettie. 78-89 [doi]
- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar GraphsAndré Berger, Michelangelo Grigni. 90-101 [doi]
- Labeling Schemes for Vertex ConnectivityAmos Korman. 102-109 [doi]
- Unbounded-Error One-Way Classical and Quantum Communication ComplexityKazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita. 110-121 [doi]
- A Lower Bound on Entanglement-Assisted Quantum Communication ComplexityAshley Montanaro, Andreas Winter. 122-133 [doi]
- Separating Deterministic from Nondeterministic NOF Multiparty Communication ComplexityPaul Beame, Matei David, Toniann Pitassi, Philipp Woelfel. 134-145 [doi]
- An Optimal Decomposition Algorithm for Tree Edit DistanceErik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. 146-157 [doi]
- On Commutativity Based Edge Lean SearchDragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled. 158-170 [doi]
- Commitment Under Uncertainty: Two-Stage Stochastic Matching ProblemsIrit Katriel, Claire Kenyon-Mathieu, Eli Upfal. 171-182 [doi]
- On the Complexity of Hard-Core Set ConstructionsChi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu. 183-194 [doi]
- Approximation by DNF: Examples and CounterexamplesRyan O Donnell, Karl Wimmer. 195-206 [doi]
- Exotic Quantifiers, Complexity Classes, and Complete ProblemsPeter Bürgisser, Felipe Cucker. 207-218 [doi]
- Online Conflict-Free Colorings for HypergraphsAmotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky. 219-230 [doi]
- Distributed Computing with Advice: Information Sensitivity of Graph ColoringPierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. 231-242 [doi]
- Private Multiparty Sampling and Approximation of Vector CombinationsYuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright. 243-254 [doi]
- Constant-Round Private Database QueriesNenad Dedic, Payman Mohassel. 255-266 [doi]
- Universal Algebra and Hardness Results for Constraint Satisfaction ProblemsBenoit Larose, Pascal Tesson. 267-278 [doi]
- On the Power of ::::k:::: -ConsistencyAlbert Atserias, Andrei A. Bulatov, Víctor Dalmau. 279-290 [doi]
- Complexity of Propositional Proofs Under a PromiseNachum Dershowitz, Iddo Tzameret. 291-302 [doi]
- Deterministic History-Independent Strategies for Storing Information on Write-Once MemoriesTal Moran, Moni Naor, Gil Segev. 303-315 [doi]
- Trading Static for Adaptive Security in Universally Composable Zero-KnowledgeAggelos Kiayias, Hong-Sheng Zhou. 316-327 [doi]
- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh. 328-339 [doi]
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored GraphsMichael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. 340-351 [doi]
- Parameterized Algorithms for Directed Maximum Leaf ProblemsNoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh. 352-362 [doi]
- Parameterized Approximability of the Disjoint Cycle ProblemMartin Grohe, Magdalena Grüber. 363-374 [doi]
- Linear Problem Kernels for NP-Hard Problems on Planar GraphsJiong Guo, Rolf Niedermeier. 375-386 [doi]
- Private Locally Decodable CodesRafail Ostrovsky, Omkant Pandey, Amit Sahai. 387-398 [doi]
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP TransformsMihir Bellare, Thomas Ristenpart. 399-410 [doi]
- Unrestricted Aggregate SignaturesMihir Bellare, Chanathip Namprempre, Gregory Neven. 411-422 [doi]
- Ring Signatures of Sub-linear Size Without Random OraclesNishanth Chandran, Jens Groth, Amit Sahai. 423-434 [doi]
- Balanced Families of Perfect Hash Functions and Their ApplicationsNoga Alon, Shai Gutner. 435-446 [doi]
- An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless NetworksIoannis Caragiannis, Michele Flammini, Luca Moscardelli. 447-458 [doi]
- Modular Algorithms for Heterogeneous Modal LogicsLutz Schröder, Dirk Pattinson. 459-471 [doi]
- Co-Logic Programming: Extending Logic Programming with CoinductionLuke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta. 472-483 [doi]
- Offline/Online MixingBen Adida, Douglas Wikström. 484-495 [doi]
- Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private KeysJun Furukawa, Nuttapong Attrapadung. 496-508 [doi]
- Succinct Ordinal Trees Based on Tree CoveringMeng He, J. Ian Munro, S. Srinivasa Rao. 509-520 [doi]
- A Framework for Dynamizing Succinct Data StructuresAnkur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter. 521-532 [doi]
- In-Place Suffix SortingGianni Franceschini, S. Muthukrishnan. 533-545 [doi]
- Maximal Infinite-Valued Constraint LanguagesManuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen. 546-557 [doi]
- Affine Systems of Equations and Counting Infinitary LogicAlbert Atserias, Andrei A. Bulatov, Anuj Dawar. 558-570 [doi]
- Boundedness of Monadic FO over Acyclic StructuresStephan Kreutzer, Martin Otto, Nicole Schweikardt. 571-582 [doi]
- Strong Price of Anarchy for Machine Load BalancingAmos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky. 583-594 [doi]
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix GamesSpyros C. Kontogiannis, Paul G. Spirakis. 595-606 [doi]
- Equational Systems and Free Constructions (Extended Abstract)Marcelo P. Fiore, Chung-Kil Hur. 607-618 [doi]
- Categorical Views on Computations on Trees (Extended Abstract)Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu. 619-630 [doi]
- Holographic Algorithms: The Power of Dimensionality ResolvedJin-yi Cai, Pinyan Lu. 631-642 [doi]
- Reconciling Data Compression and Kolmogorov ComplexityLaurent Bienvenu, Wolfgang Merkle. 643-654 [doi]
- Size Competitive Meshing Without Large AnglesGary L. Miller, Todd Phillips, Donald Sheehy. 655-666 [doi]
- A Fully Abstract Trace Semantics for General ReferencesJames Laird. 667-679 [doi]
- Aliased Register Allocation for Straight-Line Programs Is NP-CompleteJonathan K. Lee, Jens Palsberg, Fernando Magno Quintão Pereira. 680-691 [doi]
- Conservative Ambiguity Detection in Context-Free GrammarsSylvain Schmitz. 692-703 [doi]
- Lower Bounds for Quantile Estimation in Random-Order and Multi-pass StreamingSudipto Guha, Andrew McGregor. 704-715 [doi]
- Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse SpannersMichael Elkin. 716-727 [doi]
- Checking and Spot-Checking the Correctness of Priority QueuesMatthew Chu, Sampath Kannan, Andrew McGregor. 728-739 [doi]
- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the ::::pi:::: -CalculusNaoki Kobayashi, Takashi Suto. 740-751 [doi]
- Ready Simulation for Concurrency: It s Logical!Gerald Lüttgen, Walter Vogler. 752-763 [doi]
- Continuous Capacities on Continuous State SpacesJean Goubault-Larrecq. 764-776 [doi]
- On the Chromatic Number of Random GraphsAmin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger. 777-788 [doi]
- Quasi-randomness and Algorithmic Regularity for Graphs with General Degree DistributionsNoga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht. 789-800 [doi]
- Complexity of the Cover PolynomialMarkus Bläser, Holger Dell. 801-812 [doi]
- A Generalization of Cobham s Theorem to Automata over Real NumbersBernard Boigelot, Julien Brusten. 813-824 [doi]
- Minimum-Time Reachability in Timed GamesThomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin. 825-837 [doi]
- Reachability-Time Games on Timed AutomataMarcin Jurdzinski, Ashutosh Trivedi. 838-849 [doi]
- Perfect Information Stochastic Priority GamesHugo Gimbert, Wieslaw Zielonka. 850-861 [doi]
- Bounded Depth Data TreesHenrik Björklund, Mikolaj Bojanczyk. 862-874 [doi]
- Unranked Tree Automata with Sibling Equalities and DisequalitiesWong Karianto, Christof Löding. 875-887 [doi]
- Regular Languages of Nested Words: Fixed Points, Automata, and SynchronizationMarcelo Arenas, Pablo Barceló, Leonid Libkin. 888-900 [doi]
- A Combinatorial Theorem for TreesThomas Colcombet. 901-912 [doi]
- Model Theory Makes Formulas LargeAnuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt. 913-924 [doi]
- Decision Problems for Lower/Upper Bound Parametric Timed AutomataLaura Bozzelli, Salvatore La Torre. 925-936 [doi]
- On the Complexity of LtlModel-Checking of Recursive State MachinesSalvatore La Torre, Gennaro Parlato. 937-948 [doi]
- Paper Retraction: On the Hardness of Embeddings Between Two Finite MetricsMatthew Cary, Atri Rudra, Ashish Sabharwal. 949 [doi]