| 2018 | (Delta+1) Coloring in the Congested Clique Model. Merav Parter |
| 2018 | 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, July 9-13, 2018 Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald Sannella |
| 2018 | A Centralized Local Algorithm for the Sparse Spanning Graph Problem. Christoph Lenzen, Reut Levi |
| 2018 | A Complete Dichotomy for Complex-Valued Holant^c. Miriam Backens |
| 2018 | A Faster Construction of Greedy Consensus Trees. Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann |
| 2018 | A Faster FPTAS for #Knapsack. Pawel Gawrychowski, Liran Markin, Oren Weimann |
| 2018 | A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity. Tasuku Soma, Yuichi Yoshida |
| 2018 | A Note on Two-Colorability of Nonuniform Hypergraphs. Lech Duraj, Grzegorz Gutowski, Jakub Kozik |
| 2018 | A PTAS for a Class of Stochastic Dynamic Programs. Hao Fu, Jian Li, Pan Xu |
| 2018 | A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. Martin Koutecký, Asaf Levin, Shmuel Onn |
| 2018 | A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes. Koyo Hayashi |
| 2018 | A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. Heng Guo, Mark Jerrum |
| 2018 | A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan |
| 2018 | A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, Maximilian Wötzel |
| 2018 | A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton. Mikhail A. Raskin |
| 2018 | ARRIVAL: Next Stop in CLS. Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová |
| 2018 | Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. Zdenek Dvorák, Ken-ichi Kawarabayashi |
| 2018 | Algorithms for Noisy Broadcast with Erasures. Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty |
| 2018 | Almost Sure Productivity. Alejandro Aguirre, Gilles Barthe, Justin Hsu, Alexandra Silva |
| 2018 | An Exponential Separation Between MA and AM Proofs of Proximity. Tom Gur, Yang P. Liu, Ron D. Rothblum |
| 2018 | An Improved Isomorphism Test for Bounded-Tree-Width Graphs. Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking |
| 2018 | An Operational Characterization of Mutual Information in Algorithmic Information Theory. Andrei Romashchenko, Marius Zimand |
| 2018 | An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. Dirk Nowotka, Aleksi Saarela |
| 2018 | Aperiodic Points in Z Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier |
| 2018 | Approximate Convex Hull of Data Streams. Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, Lin F. Yang |
| 2018 | Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States. Chinmay Nirkhe, Umesh V. Vazirani, Henry Yuen |
| 2018 | Approximate Sparse Linear Regression. Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi |
| 2018 | Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time. Ran Duan, Hanlin Ren |
| 2018 | Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. Lorenzo Clemente, Slawomir Lasota |
| 2018 | Bisimulation Invariant Monadic-Second Order Logic in the Finite. Achim Blumensath, Felix Wolf |
| 2018 | Brief Announcement: Approximation Schemes for Geometric Coverage Problems. Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase |
| 2018 | Brief Announcement: Bayesian Auctions with Efficient Queries. Jing Chen, Bo Li, Yingkai Li, Pinyan Lu |
| 2018 | Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. Mingyu Xiao, Hiroshi Nagamochi |
| 2018 | Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. Amy Babay, Michael Dinitz, Zeyu Zhang |
| 2018 | Brief Announcement: Energy Constrained Depth First Search. Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski |
| 2018 | Brief Announcement: Erasure-Resilience Versus Tolerance to Errors. Sofya Raskhodnikova, Nithin Varma |
| 2018 | Brief Announcement: Give Me Some Slack: Efficient Network Measurements. Ran Ben-Basat, Gil Einziger, Roy Friedman |
| 2018 | Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. Daniel Graf, Karim Labib, Przemyslaw Uznanski |
| 2018 | Brief Announcement: MapReduce Algorithms for Massive Trees. MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni |
| 2018 | Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC. Navneet Agarwal, Sanat Anand, Manoj Prabhakaran |
| 2018 | Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou |
| 2018 | Brief Announcement: Towards an Abstract Model of User Retention Dynamics. Eli Ben-Sasson, Eden Saig |
| 2018 | Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | Brief Announcement: Zero-Knowledge Protocols for Search Problems. Ben Berger, Zvika Brakerski |
| 2018 | Byzantine Gathering in Polynomial Time. Sébastien Bouchard, Yoann Dieudonné, Anissa Lamani |
| 2018 | CacheShuffle: A Family of Oblivious Shuffles. Sarvar Patel, Giuseppe Persiano, Kevin Yeo |
| 2018 | Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT. Sixue Liu |
| 2018 | Computing Tutte Paths. Andreas Schmid, Jens M. Schmidt |
| 2018 | Congestion-Free Rerouting of Flows on DAGs. Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht |
| 2018 | Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper). Theophanis Hadjistasi, Alexander A. Schwarzmann |
| 2018 | Costs and Rewards in Priced Timed Automata. Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell |
| 2018 | Demand-Independent Optimal Tolls. Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini |
| 2018 | Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc |
| 2018 | Edit Distance between Unrooted Trees in Cubic Time. Bartlomiej Dudek, Pawel Gawrychowski |
| 2018 | Efficient Black-Box Reductions for Separable Cost Sharing. Tobias Harks, Martin Hoefer, Anja Huber, Manuel Surek |
| 2018 | Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry |
| 2018 | Eigenvector Computation and Community Detection in Asynchronous Gossip Models. Frederik Mallmann-Trenn, Cameron Musco, Christopher Musco |
| 2018 | Fast Reed-Solomon Interactive Oracle Proofs of Proximity. Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev |
| 2018 | Faster Algorithms for Integer Programs with Block Structure. Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein |
| 2018 | Finding Branch-Decompositions of Matroids, Hypergraphs, and More. Jisu Jeong, Eun Jung Kim, Sang-il Oum |
| 2018 | Finding Cliques in Social Networks: A New Distribution-Free Model. Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein |
| 2018 | Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity. Marco L. Carmosino, Russell Impagliazzo, Manuel Sabin |
| 2018 | Finer Tight Bounds for Coloring on Clique-Width. Michael Lampis |
| 2018 | First-Order Interpretations of Bounded Expansion Classes. Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2018 | Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. Moses Charikar, Shay Solomon |
| 2018 | Fully Dynamic MIS in Uniformly Sparse Graphs. Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein |
| 2018 | Fully-Dynamic Bin Packing with Little Repacking. Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, David Wajc |
| 2018 | Gaifman Normal Forms for Counting Extensions of First-Order Logic. Dietrich Kuske, Nicole Schweikardt |
| 2018 | Generalized Center Problems with Outliers. Deeparnab Chakrabarty, Maryam Negahbani |
| 2018 | Generalized Comparison Trees for Point-Location Problems. Daniel M. Kane, Shachar Lovett, Shay Moran |
| 2018 | Generic Single Edge Fault Tolerant Exact Distance Oracle. Manoj Gupta, Aditi Singh |
| 2018 | Geodesic Obstacle Representation of Graphs. Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira |
| 2018 | Gray Codes and Symmetric Chains. Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille |
| 2018 | Greedy Algorithms for Online Survivable Network Design. Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin |
| 2018 | High Probability Frequency Moment Sketches. Sumit Ganguly, David P. Woodruff |
| 2018 | How Hard Is It to Satisfy (Almost) All Roommates?. Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion |
| 2018 | How to Navigate Through Obstacles?. Eduard Eiben, Iyad A. Kanj |
| 2018 | Improved Algorithms for Adaptive Compressed Sensing. Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang |
| 2018 | Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. Julia Chuzhoy, David H. K. Kim, Rachit Nimavat |
| 2018 | Improved Bounds for Shortest Paths in Dense Distance Graphs. Pawel Gawrychowski, Adam Karczmarz |
| 2018 | Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs. Ran Duan, Yong Gu, Le Zhang |
| 2018 | Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. Deeparnab Chakrabarty, Chaitanya Swamy |
| 2018 | Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi |
| 2018 | Load Thresholds for Cuckoo Hashing with Overlapping Blocks. Stefan Walzer |
| 2018 | Lovász Meets Weisfeiler and Leman. Holger Dell, Martin Grohe, Gaurav Rattan |
| 2018 | Lower Bounds by Algorithm Design: A Progress Report (Invited Paper). Richard Ryan Williams |
| 2018 | Maximizing Profit with Convex Costs in the Random-order Model. Anupam Gupta, Ruta Mehta, Marco Molinaro |
| 2018 | NC Algorithms for Weighted Planar Perfect Matching and Related Problems. Piotr Sankowski |
| 2018 | NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors. Amey Bhangale |
| 2018 | New Approximation Algorithms for (1, 2)-TSP. Anna Adamaszek, Matthias Mnich, Katarzyna Paluch |
| 2018 | New algorithms for Steiner tree reoptimization. Davide Bilò |
| 2018 | Noise-Tolerant Testing of High Entanglement of Formation. Rotem Arnon Friedman, Henry Yuen |
| 2018 | Non-Preemptive Flow-Time Minimization via Rejections. Anupam Gupta, Amit Kumar, Jason Li |
| 2018 | O-Minimal Invariants for Linear Loops. Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell |
| 2018 | On Computing the Total Variation Distance of Hidden Markov Models. Stefan Kiefer |
| 2018 | On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul |
| 2018 | On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface. Albert Atserias, Stephan Kreutzer, Marc Noy |
| 2018 | On the Complexity of Infinite Advice Strings. Gaëtan Douéneau-Tabot |
| 2018 | On the Complexity of Sampling Vertices Uniformly from a Graph. Flavio Chierichetti, Shahrzad Haddadan |
| 2018 | On the Identity Problem for the Special Linear Group and the Heisenberg Group. Sang-Ki Ko, Reino Niskanen, Igor Potapov |
| 2018 | On the Probe Complexity of Local Computation Algorithms. Uriel Feige, Boaz Patt-Shamir, Shai Vardi |
| 2018 | One-Way Trail Orientations. Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg |
| 2018 | Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang |
| 2018 | Optimal Hashing in External Memory. Alexander Conway, Martin Farach-Colton, Philip Shilane |
| 2018 | Optimally Sorting Evolving Data. Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
| 2018 | Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis |
| 2018 | Parameterized Algorithms for Zero Extension and Metric Labelling Problems. Felix Reidl, Magnus Wahlström |
| 2018 | Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi |
| 2018 | Parameterized Low-Rank Binary Matrix Approximation. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |
| 2018 | Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. Heng Guo, Mark Jerrum |
| 2018 | Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. Dariusz R. Kowalski, Miguel A. Mosteiro |
| 2018 | Polynomial Vector Addition Systems With States. Jérôme Leroux |
| 2018 | Power of d Choices with Simple Tabulation. Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup |
| 2018 | Practical and Provably Secure Onion Routing. Megumi Ando, Anna Lysyanskaya, Eli Upfal |
| 2018 | Price of Anarchy for Mechanisms with Risk-Averse Agents. Thomas Kesselheim, Bojana Kodric |
| 2018 | Privacy Preserving Clustering with Constraints. Clemens Rösner, Melanie Schmidt |
| 2018 | Probability Theory from a Programming Perspective (Invited Paper). Sam Staton |
| 2018 | Proportional Approval Voting, Harmonic k-median, and Negative Association. Jaroslaw Byrka, Piotr Skowron, Krzysztof Sornat |
| 2018 | Quasi-PTAS for Scheduling with Precedences using LP Hierarchies. Shashwat Garg |
| 2018 | Randomized Sliding Window Algorithms for Regular Languages. Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2018 | Ranking with Fairness Constraints. L. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi |
| 2018 | Reachability Switching Games. John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani |
| 2018 | Reachability and Distances under Multiple Changes. Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume |
| 2018 | Reducing CMSO Model Checking to Highly Connected Graphs. Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2018 | Resolving SINR Queries in a Dynamic Setting. Boris Aronov, Gali Bar-On, Matthew J. Katz |
| 2018 | Restricted Max-Min Fair Allocation. Siu-Wing Cheng, Yuchen Mao |
| 2018 | Resynchronizing Classes of Word Relations. María Emilia Descotte, Diego Figueira, Gabriele Puppis |
| 2018 | Revisiting Frequency Moment Estimation in Random Order Streams. Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang |
| 2018 | Ring Packing and Amortized FHEW Bootstrapping. Daniele Micciancio, Jessica Sorrell |
| 2018 | Rollercoasters and Caterpillars. Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit |
| 2018 | Sample-Optimal Identity Testing with High Probability. Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price |
| 2018 | Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. Buddhima Gamlath, Sangxia Huang, Ola Svensson |
| 2018 | Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery. Anand Louis, Rakesh Venkat |
| 2018 | Semicomputable Geometry. Mathieu Hoyrup, Diego Nava Saucedo, Don M. Stull |
| 2018 | Separating Without Any Ambiguity. Thomas Place, Marc Zeitoun |
| 2018 | Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. Ran Duan, Kaifeng Lyu, Yuanhang Xie |
| 2018 | Small Bias Requires Large Formulas. Andrej Bogdanov |
| 2018 | Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. L. Sunil Chandran, Yun Kuen Cheung, Davis Issac |
| 2018 | Spanning Trees With Edge Conflicts and Wireless Connectivity. Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan |
| 2018 | Sparsity - an Algorithmic Perspective (Invited Paper). Jaroslav Nesetril |
| 2018 | Spectrally Robust Graph Isomorphism. Alexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop |
| 2018 | Stabilizing Weighted Graphs. Zhuan Khye Koh, Laura Sanità |
| 2018 | Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano |
| 2018 | Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. Rafail Ostrovsky, Yuval Rabani, Arman Yousefi |
| 2018 | Sublinear Algorithms for MAXCUT and Correlation Clustering. Aditya Bhaskara, Samira Daruki, Suresh Venkatasubramanian |
| 2018 | Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. Bernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik |
| 2018 | Synchronization Strings: List Decoding for Insertions and Deletions. Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan |
| 2018 | Temporal Vertex Cover with a Sliding Time Window. Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev |
| 2018 | The Beta-Bernoulli process and algebraic effects. Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy |
| 2018 | The Bottleneck Complexity of Secure Multiparty Computation. Elette Boyle, Abhishek Jain, Manoj Prabhakaran, Ching-Hua Yu |
| 2018 | The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. Géraud Sénizergues, Armin Weiß |
| 2018 | The Price of Stability of Weighted Congestion Games. George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis |
| 2018 | The Unfortunate-Flow Problem. Orna Kupferman, Gal Vardi |
| 2018 | Tight Bounds on Online Checkpointing Algorithms. Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir |
| 2018 | Tighter Connections Between Formula-SAT and Shaving Logs. Amir Abboud, Karl Bringmann |
| 2018 | To Infinity and Beyond. Ines Klimann |
| 2018 | Topological Sorting with Regular Constraints. Antoine Amarilli, Charles Paperman |
| 2018 | Towards Blackbox Identity Testing of Log-Variate Circuits. Michael A. Forbes, Sumanta Ghosh, Nitin Saxena |
| 2018 | Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. Shay Golan, Tsvi Kopelowitz, Ely Porat |
| 2018 | Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance. Pawel Gawrychowski, Przemyslaw Uznanski |
| 2018 | Unambiguous Languages Exhaust the Index Hierarchy. Michal Skrzypczak |
| 2018 | Unboundedness Problems for Languages of Vector Addition Systems. Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche |
| 2018 | Uniform Mixed Equilibria in Network Congestion Games with Link Failures. Vittorio Bilò, Luca Moscardelli, Cosimo Vinci |
| 2018 | Uniformization Problems for Synchronizations of Automatic Relations on Words. Sarah Winter |
| 2018 | Union of Hypercubes and 3D Minkowski Sums with Random Sizes. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir |
| 2018 | When is Containment Decidable for Probabilistic Automata?. Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell |