Abstract is missing.
- Holographic CircuitsLeslie G. Valiant. 1-15 [doi]
- Probabilistic Polynomial-Time Semantics for a Protocol Security LogicAnupam Datta, Ante Derek, John C. Mitchell, Vitaly Shmatikov, Mathieu Turuani. 16-29 [doi]
- A Gentle Introduction to Semantic SubtypingGiuseppe Castagna, Alain Frisch. 30-34 [doi]
- Logics for Unranked Trees: An OverviewLeonid Libkin. 35-50 [doi]
- Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium ConjectureMartin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann. 51-65 [doi]
- The Tree Inclusion Problem: In Optimal Space and FasterPhilip Bille, Inge Li Gørtz. 66-77 [doi]
- Union-Find with Constant Time DeletionsStephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick. 78-89 [doi]
- Optimal In-place Sorting of Vectors and RecordsGianni Franceschini, Roberto Grossi. 90-102 [doi]
- Towards Optimal Multiple SelectionKanela Kaligosi, Kurt Mehlhorn, J. Ian Munro, Peter Sanders. 103-114 [doi]
- Simple Extractors via Constructions of Cryptographic Pseudo-random GeneratorsMarius Zimand. 115-127 [doi]
- Bounds on the Efficiency of Black-Box Commitment SchemesOmer Horvitz, Jonathan Katz. 128-139 [doi]
- On Round-Efficient Argument SystemsHoeteck Wee. 140-152 [doi]
- Computational Bounds on Hierarchical Data Processing with Applications to Information SecurityRoberto Tamassia, Nikos Triandopoulos. 153-165 [doi]
- Balanced Allocation and Dictionaries with Tightly Packed Constant Size BinsMartin Dietzfelbinger, Christoph Weidling. 166-178 [doi]
- Worst Case Optimal Union-Intersection Expression EvaluationEhsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh. 179-190 [doi]
- Measure and Conquer: Domination - A Case StudyFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. 191-203 [doi]
- Optimistic Asynchronous Atomic BroadcastKlaus Kursawe, Victor Shoup. 204-215 [doi]
- Asynchronous Perfectly Secure Communication over One-Time PadsGiovanni Di Crescenzo, Aggelos Kiayias. 216-227 [doi]
- Single-Prover Concurrent Zero Knowledge in Almost Constant RoundsGiuseppe Persiano, Ivan Visconti. 228-240 [doi]
- LCA Queries in Directed Acyclic GraphsMiroslaw Kowaluk, Andrzej Lingas. 241-248 [doi]
- Replacement Paths and ::::k:::: Simple Shortest Paths in Unweighted Directed GraphsLiam Roditty, Uri Zwick. 249-260 [doi]
- Deterministic Constructions of Approximate Distance Oracles and SpannersLiam Roditty, Mikkel Thorup, Uri Zwick. 261-272 [doi]
- An Õ(::::m:::::::2:::::::n::::) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed GraphTelikepalli Kavitha. 273-284 [doi]
- Basing Cryptographic Protocols on Tamper-Evident SealsTal Moran, Moni Naor. 285-297 [doi]
- Hybrid Trapdoor Commitments and Their ApplicationsDario Catalano, Ivan Visconti. 298-310 [doi]
- On Steganographic Chosen Covertext SecurityNicholas Hopper. 311-323 [doi]
- Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic PropertiesAn Braeken, Yuri L. Borissov, Svetla Nikova, Bart Preneel. 324-334 [doi]
- Label-Guided Graph Exploration by a Finite AutomatonReuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg. 335-346 [doi]
- On the Wake-Up Problem in Radio NetworksBogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik. 347-359 [doi]
- Distance Constrained Labelings of Graphs of Bounded TreewidthJirí Fiala, Petr A. Golovach, Jan Kratochvíl. 360-372 [doi]
- Optimal Branch-Decomposition of Planar Graphs in ::::O::::(::::n:::::::3:::) TimeQian-Ping Gu, Hisao Tamaki. 373-384 [doi]
- NFAs With and Without ::::epsilon::::-TransitionsJuraj Hromkovic, Georg Schnitger. 385-396 [doi]
- On the Equivalence of -AutomataMarie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch. 397-409 [doi]
- A Tight Linear Bound on the Neighborhood of Inverse Cellular AutomataEugen Czeizler, Jarkko Kari. 410-420 [doi]
- Groupoids That Recognize Only Regular LanguagesMartin Beaudry, François Lemieux, Denis Thérien. 421-433 [doi]
- Append-Only SignaturesEike Kiltz, Anton Mityagin, Saurabh Panjwani, Barath Raghavan. 434-445 [doi]
- Hierarchical Group SignaturesMårten Trolin, Douglas Wikström. 446-458 [doi]
- Designated Verifier Signature Schemes: Attacks, New Security Notions and a New ConstructionHelger Lipmaa, Guilin Wang, Feng Bao. 459-471 [doi]
- Single-Key AIL-MACs from Any FIL-MACUeli M. Maurer, Johan Sjödin. 472-484 [doi]
- The Efficiency and Fairness of a Fixed Budget Resource Allocation GameLi Zhang. 485-496 [doi]
- Braess s Paradox, Fibonacci Numbers, and Exponential InapproximabilityHenry Lin, Tim Roughgarden, Éva Tardos, Asher Walkover. 497-512 [doi]
- Weighted Automata and Weighted LogicsManfred Droste, Paul Gastin. 513-525 [doi]
- Restricted Two-Variable Sentences, Circuits and Communication ComplexityPascal Tesson, Denis Thérien. 526-538 [doi]
- Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type ::::y:::::::2:::=::::x:::::::2::::k::::+1:::+::::ax::::Mitsuhiro Haneda, Mitsuru Kawazoe, Tetsuya Takahashi. 539-550 [doi]
- Solvability of a System of Bivariate Polynomial Equations over a Finite FieldNeeraj Kayal. 551-562 [doi]
- Cache-Oblivious Planar Shortest PathsHema Jampala, Norbert Zeh. 563-575 [doi]
- Cache-Aware and Cache-Oblivious Adaptive SortingGerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz. 576-588 [doi]
- Simulated Annealing Beats Metropolis in Combinatorial OptimizationIngo Wegener. 589-601 [doi]
- Online Interval Coloring and VariantsLeah Epstein, Meital Levy. 602-613 [doi]
- Dynamic Bin Packing of Unit Fractions ItemsWun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong. 614-626 [doi]
- Reordering Buffer Management for Non-uniform Cost ModelsMatthias Englert, Matthias Westermann. 627-638 [doi]
- Combining Intruder TheoriesYannick Chevalier, Michaël Rusinowitch. 639-651 [doi]
- Computationally Sound Implementations of Equational Theories Against Passive AdversariesMathieu Baudet, Véronique Cortier, Steve Kremer. 652-663 [doi]
- Password-Based Encryption AnalyzedMartín Abadi, Bogdan Warinschi. 664-676 [doi]
- On the Cover Time of Random Geometric GraphsChen Avin, Gunes Ercal. 677-689 [doi]
- On the Existence of Hamiltonian Cycles in Random Intersection GraphsCharilaos Efthymiou, Paul G. Spirakis. 690-701 [doi]
- Optimal Cover Time for a Graph-Based Coupon Collector ProcessNedialko B. Dimitrov, C. Greg Plaxton. 702-716 [doi]
- Stability and Similarity of Link Analysis Ranking AlgorithmsDebora Donato, Stefano Leonardi, Panayiotis Tsaparas. 717-729 [doi]
- Up-to Techniques for Weak BisimulationDamien Pous. 730-741 [doi]
- Petri AlgebrasEric Badouel, Jules Chenou, Goulven Guillou. 742-754 [doi]
- A Finite Basis for Failure SemanticsWan Fokkink, Sumit Nain. 755-765 [doi]
- Spatial Logics for BigraphsGiovanni Conforti, Damiano Macedonio, Vladimiro Sassone. 766-778 [doi]
- Completely Non-malleable SchemesMarc Fischlin. 779-790 [doi]
- Boneh-Franklin Identity Based Encryption RevisitedDavid Galindo. 791-802 [doi]
- Single-Database Private Information Retrieval with Constant Communication RateCraig Gentry, Zulfikar Ramzan. 803-815 [doi]
- Concurrent Zero Knowledge in the Public-Key ModelGiovanni Di Crescenzo, Ivan Visconti. 816-827 [doi]
- A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel MachinesMartin Gairing, Burkhard Monien, Andreas Woclaw. 828-839 [doi]
- Polynomial Time Preemptive Sum-Multicoloring on PathsAnnamária Kovács. 840-852 [doi]
- The Generalized Deadlock Resolution ProblemKamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar. 853-865 [doi]
- Facility Location in Sublinear TimeMihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler. 866-877 [doi]
- The Complexity of Stochastic Rabin and Streett Games Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger. 878-890 [doi]
- Recursive Markov Decision Processes and Recursive Stochastic GamesKousha Etessami, Mihalis Yannakakis. 891-903 [doi]
- Decidability in Syntactic Control of InterferenceJames Laird. 904-916 [doi]
- Idealized Algol with Ground Recursion, and DPDA EquivalenceAndrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz. 917-929 [doi]
- From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest ProblemJochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam. 930-942 [doi]
- How Well Can Primal-Dual and Local-Ratio Algorithms Perform?Allan Borodin, David Cashman, Avner Magen. 943-955 [doi]
- Approximating - Outperforming a Random Assignment with Almost a Linear FactorGustav Hast. 956-968 [doi]
- On Dynamic Bit-Probe ComplexityCorina E. Patrascu, Mihai Patrascu. 969-981 [doi]
- Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized MachinesScott Diehl, Dieter van Melkebeek. 982-993 [doi]
- Lower Bounds for Circuits with Few Modular and Symmetric GatesArkadev Chattopadhyay, Kristoffer Arnsfelt Hansen. 994-1005 [doi]
- Discrete Random Variables over DomainsMichael W. Mislove. 1006-1017 [doi]
- An Accessible Approach to Behavioural PseudometricsFranck van Breugel, Claudio Hermida, Michael Makkai, James Worrell. 1018-1030 [doi]
- Noisy Turing MachinesEugene Asarin, Pieter Collins. 1031-1042 [doi]
- A Better Approximation Ratio for the Vertex Cover ProblemGeorge Karakostas. 1043-1050 [doi]
- Stochastic Steiner Trees Without a RootAnupam Gupta, Martin Pál. 1051-1063 [doi]
- Approximation Algorithms for the Max-coloring ProblemSriram V. Pemmaraju, Rajiv Raman. 1064-1075 [doi]
- Tight Lower Bounds for Query Processing on Streaming and External Memory DataMartin Grohe, Christoph Koch, Nicole Schweikardt. 1076-1088 [doi]
- Decidability and Complexity Results for Timed Automata via Channel MachinesParosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell. 1089-1101 [doi]
- Congruences for Visibly Pushdown LanguagesRajeev Alur, Viraj Kumar, P. Madhusudan, Mahesh Viswanathan. 1102-1114 [doi]
- Approximation Algorithms for Euclidean Group TSPKhaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters. 1115-1126 [doi]
- Influential Nodes in a Diffusion Model for Social NetworksDavid Kempe, Jon M. Kleinberg, Éva Tardos. 1127-1138 [doi]
- An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless NetworksChristoph Ambühl. 1139-1150 [doi]
- New Approaches for Virtual Private Network DesignFriedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella. 1151-1162 [doi]
- Hadamard Tensors and Lower Bounds on Multiparty Communication ComplexityJeff Ford, Anna Gál. 1163-1175 [doi]
- Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication ComplexityPaul Beame, Toniann Pitassi, Nathan Segerlind. 1176-1188 [doi]
- On the ::::l::::-Ary GCD-Algorithm in Rings of IntegersDouglas Wikström. 1189-1201 [doi]
- A Fully Abstract Encoding of the ::::pi::::-Calculus with Data TermsMichael Baldamus, Joachim Parrow, Björn Victor. 1202-1213 [doi]
- Orthogonal Extensions in Structural Operational SemanticsMohammad Reza Mousavi, Michel A. Reniers. 1214-1225 [doi]
- Basic Observables for a Calculus for Global ComputingRocco De Nicola, Daniele Gorla, Rosario Pugliese. 1226-1238 [doi]
- Compositional Verification of Asynchronous Processes via Constraint SolvingGiorgio Delzanno, Maurizio Gabbrielli. 1239-1250 [doi]
- Optimal Spaced Seeds for Faster Approximate String MatchingMartin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur. 1251-1262 [doi]
- Fast Neighbor JoiningIsaac Elias, Jens Lagergren. 1263-1274 [doi]
- Randomized Fast Design of Short DNA WordsMing-Yang Kao, Manan Sanghi, Robert T. Schweller. 1275-1286 [doi]
- A Quantum Lower Bound for the Query Complexity of Simon s ProblemPascal Koiran, Vincent Nesme, Natacha Portier. 1287-1298 [doi]
- All Quantum Adversary Methods Are EquivalentRobert Spalek, Mario Szegedy. 1299-1311 [doi]
- Quantum Complexity of Testing Group CommutativityFrédéric Magniez, Ashwin Nayak. 1312-1324 [doi]
- Semantic-Based Code Obfuscation by Abstract InterpretationMila Dalla Preda, Roberto Giacobazzi. 1325-1336 [doi]
- About Hoare Logics for Higher-Order StoreBernhard Reus, Thomas Streicher. 1337-1348 [doi]
- The Polyranking PrincipleAaron R. Bradley, Zohar Manna, Henny B. Sipma. 1349-1361 [doi]
- Approximate Guarding of Monotone and Rectilinear PolygonsBengt J. Nilsson. 1362-1373 [doi]
- Linear Time Algorithms for Clustering Problems in Any DimensionsAmit Kumar, Yogish Sabharwal, Sandeep Sen. 1374-1385 [doi]
- Dynamic Diffusion Load BalancingPetra Berenbrink, Tom Friedetzky, Russell A. Martin. 1386-1398 [doi]
- On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg GroupJaikumar Radhakrishnan, Martin Rötteler, Pranab Sen. 1399-1411 [doi]
- On the Hardness of Embeddings Between Two Finite MetricsMatthew Cary, Atri Rudra, Ashish Sabharwal. 1412-1423 [doi]
- Improved Lower Bounds for Locally Decodable Codes and Private Information RetrievalStephanie Wehner, Ronald de Wolf. 1424-1436 [doi]
- Preservation Under Extensions on Well-Behaved Finite StructuresAlbert Atserias, Anuj Dawar, Martin Grohe. 1437-1449 [doi]
- Unsafe Grammars and Panic AutomataTeodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz. 1450-1461 [doi]
- Signaling P Systems and Verification ProblemsCheng Li, Zhe Dang, Oscar H. Ibarra, Hsu-Chun Yen. 1462-1473 [doi]