Abstract is missing.
- Shared-Variable Concurrency: A ProposalGérard Boudol. 1-3 [doi]
- Hennessy-Plotkin-Brookes RevisitedGordon D. Plotkin. 4 [doi]
- Approximation Algorithms for 2-Stage Stochastic Optimization ProblemsChaitanya Swamy, David B. Shmoys. 5-19 [doi]
- The Number of Crossing Free Configurations on Finite Point Sets in the PlaneEmo Welzl. 20 [doi]
- Normal and Feature Approximations from Noisy Point CloudsTamal K. Dey, Jian Sun. 21-32 [doi]
- Coresets for Discrete Integration and ClusteringSariel Har-Peled. 33-44 [doi]
- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal TimeFlorent Becker, Ivan Rapaport, Eric Rémila. 45-56 [doi]
- One-Input-Face MPCVP Is Hard for L, But in LogDCFLTanmoy Chakraborty, Samir Datta. 57-68 [doi]
- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner GraphsK. Murali Krishnan, L. Sunil Chandran. 69-80 [doi]
- Multi-stack Boundary Labeling ProblemsMichael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis. 81-92 [doi]
- Computing a Center-Transversal LinePankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir. 93-104 [doi]
- On Obtaining Pseudorandomness from Error-Correcting CodesShankar Kalyanaraman, Christopher Umans. 105-116 [doi]
- Fast Edge Colorings with Fixed Number of Colors to Minimize ImbalanceGruia Calinescu, Michael J. Pelsmajer. 117-128 [doi]
- Zero Error List-Decoding Capacity of the ::::q::::/(::::q::::-1) ChannelSourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte. 129-138 [doi]
- Fast Exponential Algorithms for Maximum ::::r::::-Regular Induced Subgraph ProblemsSushmita Gupta, Venkatesh Raman, Saket Saurabh. 139-151 [doi]
- Solving Connected Dominating Set Faster Than 2:::::::n:::::::Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. 152-163 [doi]
- Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different SpeciesSun-Yuan Hsieh. 164-175 [doi]
- Computationally Sound Symbolic Secrecy in the Presence of Hash FunctionsVéronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi. 176-187 [doi]
- Some Results on Average-Case Hardness Within the Polynomial HierarchyAduri Pavan, Rahul Santhanam, N. V. Vinodchandran. 188-199 [doi]
- Unbiased Rounding of Rational MatricesBenjamin Doerr, Christian Klein. 200-211 [doi]
- Rational Behaviour and Strategy Construction in Infinite Multiplayer GamesMichael Ummels. 212-223 [doi]
- The Anatomy of Innocence RevisitedRussell Harmer, Olivier Laurent. 224-235 [doi]
- Testing Probabilistic Equivalence Through Reinforcement LearningJosee Desharnais, François Laviolette, Sami Zhioua. 236-247 [doi]
- On Decidability of LTL Model Checking for Process Rewrite SystemsLaura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek. 248-259 [doi]
- Monitoring of Real-Time PropertiesAndreas Bauer 0002, Martin Leucker, Christian Schallhart. 260-272 [doi]
- A Proof System for the Linear Time µ-CalculusChristian Dax, Martin Hofmann, Martin Lange. 273-284 [doi]
- Tree Automata Make Ordinal Theory EasyThierry Cachat. 285-296 [doi]
- Context-Sensitive Dependency PairsBeatriz Alarcón, Raúl Gutiérrez, Salvador Lucas. 297-308 [doi]
- On Reduction Criteria for Probabilistic Reward ModelsMarcus Größer, Gethin J. Norman, Christel Baier, Frank Ciesinski, Marta Z. Kwiatkowska, David Parker. 309-320 [doi]
- Distributed Synthesis for Well-Connected ArchitecturesPaul Gastin, Nathalie Sznajder, Marc Zeitoun. 321-332 [doi]
- The Meaning of Ordered SOSMohammad Reza Mousavi, Iain C. C. Phillips, Michel A. Reniers, Irek Ulidowski. 333-344 [doi]
- Almost Optimal Strategies in One Clock Priced Timed GamesPatricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen. 345-356 [doi]
- Expressivity Properties of BooleanDidier Galmiche, Dominique Larchey-Wendling. 357-368 [doi]
- On Continuous Timed Automata with Input-Determined GuardsFabrice Chevalier, Deepak D Souza, Pavithra Prabhakar. 369-380 [doi]
- Safely Freezing LTLRanko Lazic. 381-392 [doi]
- Branching Pushdown Tree AutomataRajeev Alur, Swarat Chaudhuri. 393-404 [doi]
- Validity Checking for Finite Automata over Linear Arithmetic ConstraintsGary Wassermann, Zhendong Su. 405-416 [doi]
- Game Semantics for Higher-Order ConcurrencyJames Laird. 417-428 [doi]