yusuke1997/dblp-id-title huggingface dataset:
Synchronisation Trees
On the Bipartite Unique Perfect Matching Problem
Dynamic Planar Range Maxima Queries
A Representation Theorem for Models of *-Free PDL
On LR ( k )-Parsers of Polynomial Size
Generating Hard Instances of the Short Basis Problem
Beating Fredman-Komlós for Perfect k-Hashing
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
Building a Collision-Resistant Compression Function from Non-compressing Primitives
CTL + Is Complete for Double Exponential Time
An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement
Dynamic Complexity of Reachability: How Many Changes Can We Handle?
On the Cutting Edge of Relativization: The Resource Bounded Injury Method
Faster Algorithms for Rooted Connectivity in Directed Graphs
Counting Matchings of Size k Is W[1]-Hard
Random Hyperbolic Graphs: Degree Sequence and Clustering - (Extended Abstract)
Supercounter Machines
An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs
Definability by Horn Formulas and Linear Time on Cellular Automata
Algorithmic Verification of Linear Temporal Logic Specifications
Owicki-Gries Reasoning for Weak Memory Models
On Regular Temporal Logics with Past,
Logic Programming with Recurrence Domains
Variable-Length Codes for Error Correction
Condensed Unpredictability
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs
Enumerative Sequences of Leaves in Rational Trees
The Regular Real-Time Languages
Max-min Online Allocations with a Reordering Buffer
General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract)
Verification of Linear Dynamical Systems via O-Minimality of the Real Numbers
Sporadic Solutions to Zero-One Exclusion Tasks
Sur la longeur moyenne des codes préfixes
The Communication Complexity of Approximate Set Packing and Covering
Transducteurs conservant l'imprimitivité du langage d'entrée
The Compuational Complexity of Program Schemata
The Decidable Properties of Subrecursive Functions
Approximate TSP in Graphs with Forbidden Minors
Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph
Parameterized Algorithms for Directed Maximum Leaf Problems
Linear Searching for a Squre in a Word (Abstract)
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines
Parameterized Complexity of Untangling Knots
A Complete Dichotomy for Complex-Valued Holant^c
A 4/3 Approximation for 2-Vertex-Connectivity
Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic
Asynchronous Multi-Party Computation with Quadratic Communication
On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games
Proportional Response Dynamics in the Fisher Market
One-Pass Additive-Error Subset Selection for ℓ p Subspace Approximation
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
Checking and Spot-Checking the Correctness of Priority Queues
The Complexity of N-body Simulation
Horn Programs and Semicomputable Relations on Abstract Structures
On the Power of Las Vegas II. Two-Way Finite Automata
Randomness Spaces
On DNF Approximators for Monotone Boolean Functions
On the Analysis of Tree-Matching Algorithms
A Characterization of LL(k) Languages
Programming, Transforming, and Providing with Function Abstractions and Memories
Sur un Cas Particulier de la Conjecture de Cerny
Interacting Quantum Observables
A Formal Framework for Evaluating Heuristic Programs
Unlearning Helps
Improved Shortest Paths on the Word RAM
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
Near-Linear Query Complexity for Graph Inference
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
LA, Permutations, and the Hajós Calculus
On Some Tighter Inapproximability Results (Extended Abstract)
String Inference from Longest-Common-Prefix Array
The Power of Verification for One-Parameter Agents
The Complexity of Mean-Payoff Automaton Expression
On \omega-Generators and Codes
Privately Estimating Graph Parameters in Sublinear Time
Online Semidefinite Programming
Logical Characterisation of Hybrid Conformance
Optimal Regular Expressions for Permutations
Comparison of Abstract Interpretations
Automata, Languages and Programming, Colloquium, Paris, France, July 3-7, 1972
Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems
An omega -Complete Equational Specification of Interleaving
Two New Results About Quantum Exact Learning
Quantifying Competitiveness in Paging with Locality of Reference
Deciding Piecewise Testable Separability for Regular Tree Languages
What Percentage of Programs Halt?
Finding Branch-Decompositions of Matroids, Hypergraphs, and More
To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous
Deterministic Radio Broadcasting
Unrestricted Aggregate Signatures
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
Temporal Logic and Categories of Petrie Nets
Exponential Time Complexity of the Permanent and the Tutte Polynomial
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations
A Linear Acceleration Theorem for 2D Cellular Automata on All Complete Neighborhoods
Space Characterizations of Complexity Measures and Size-Space Trade-Offs in Propositional Proof Systems
Algebraic Aspects of B-regular Series
The Influence of Key Length on the Area-Time Complexity of Sorting
The 2-Dimensional Constraint Loop Problem Is Decidable
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent
On Input Indistinguishable Proof Systems
A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman
Maintenance of Triconnected Components of Graphs (Extended Abstract)
Barbed Bisimulation
Boosting SNARKs and Rate-1 Barrier in Arguments of Knowledge
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
Multiple Random Walks on Graphs: Mixing Few to Cover Many
Fast Parallel Generation of Random Permutations
Revisiting the Equivalence Problem for Finite Multitape Automata
Concurrent Transmissions in Broadcast Networks
Separation of AC^0[oplus] Formulas and Circuits
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
Improved Bounds for Matching in Random-Order Streams
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
Fast Neighbor Joining
Minimum Stable Cut and Treewidth
A Worst-Case Analysis of Nearest Neighbor Searching by Projection
Counting Short Vector Pairs by Inner Product and Relations to the Permanent
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
A Unification Algorithms for Confluent Theories
Optimal Shooting: Characterizations and Applications
Dynamic Algorithms for Approximating Interdistances
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
Approximation Algorithms for the Max-coloring Problem
Deciding the Topological Complexity of Büchi Languages
Weak MSO+U with Path Quantifiers over Infinite Trees
Characterising Memory in Infinite Games
Energy Consumption of Group Search on a Line
Petri Algebras
Drainability and Fillability of Polyominoes in Diverse Models of Global Control
Unique End of Potential Line
Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing
A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
An Approach to Computing Downward Closures
Listing Triangles
The Unfortunate-Flow Problem
Independent Sets in Vertex-Arrival Streams
On the Parsing and Covering of Simple Chain Grammars
Heaps on Heaps
Mechanism Design for Fractional Scheduling on Unrelated Machines
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
Cryptocomplexity and NP-Completeness
Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems
Definitions and Bounds for Self-Healing Key Distribution Schemes
Büchi Automata Can Have Smaller Quotients
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's
The Expressibility of Languages and Relations by Word Equations
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
Holographic Algorithms Beyond Matchgates
A Complexity Trichotomy for Approximately Counting List H-Colourings
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
A Fast Sorting Algorithm for VLSI
Multicommodity Flows over Time: Efficient Algorithms and Complexity
Networks Become Navigable as Nodes Move and Forget
Faster Cut Sparsification of Weighted Graphs
Robust Algorithms: A Different Approach to Oracles
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs
Short Proofs Are Hard to Find
Discordant Voting Processes on Finite Graphs
Un langage non ambigu dont le carré est d'ambiguité non bornée
A Semantically Sound Actor Tranlsation
What Good Are Digital Clocks?
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities
A Combinatorial Technique for Separating Counting Complexity Classes
Automatic Construction of Verification Condition Generators From Hoare Logics
Improved Deterministic PRAM Simulation on the Mesh
Lower Bounds for the Approximate Degree of Block-Composed Functions
Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y 2 = x 2 k +1 + ax
Comparing Algebraic Structures up to Algorithmic Equivalence
Finding Tutte Paths in Linear Time
On Approximate Horn Formula Minimization
Temporal Vertex Cover with a Sliding Time Window
The Safety of a Coroutine System
Behavioural Abstraction in TCCS
Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution
Randomized Rumor Spreading Revisited
Decision Problems for Second-Order Holonomic Recurrences
Recursion Depth Analysis for Specail Tree Traversal Algorithms
Batched Point Location in SINR Diagrams via Algebraic Tools
Eigenvector Computation and Community Detection in Asynchronous Gossip Models
Navigating with a Browser
CONS Should Not Evaluate its Arguments
On Confluent Semi-Commutations - Decidability and Complexity Results
A tool for quantitative analysis of calculus processes
Buchberger's Algorithm: The Term Rewriter's Point of View (Extended Abstract)
Parameterised and Fine-Grained Subgraph Counting, Modulo 2
Properties of a Notation for Combining Functions
DI-Domains as Information Systems (Extended Abstract)
Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities
Public vs Private Coin in Bounded-Round Information
Model Checking the Quantitative μ -Calculus on Linear Hybrid Systems
Improved Algorithms for Adaptive Compressed Sensing
Evolving Graph-Structures and Their Implicit Computational Complexity
Sublinear Time Eigenvalue Approximation via Random Sampling
Systèmes algorithmiques, systèmes fonctionnels
Proceedings of theThird Workshop on Cryptography for Ad-hoc Networks, WCAN@ICALP 2007, Wroclaw, Poland, July 8, 2007
The Generalized Deadlock Resolution Problem
Non-dichotomies in Constraint Satisfaction Complexity
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
Covering and Packing in Linear Space
On Computing the Total Variation Distance of Hidden Markov Models
On the Quantum Time Complexity of Divide and Conquer
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
Exponential Lower Bound for Static Semi-algebraic Proofs
Serializability in Distributed Systems with Handshaking
Model Checking of Unrestricted Hierarchical State Machines
New Sublinear Algorithms and Lower Bounds for LIS Estimation
Inclusion is Undecidable for Pattern Languages
Complexity of Propositional Proofs Under a Promise
The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights
ARRIVAL: Recursive Framework &amp; ℓ 1 -Contraction
Optimal Spaced Seeds for Faster Approximate String Matching
A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps
Alternation Removal in Büchi Automata
The Strahler Number of a Parity Game
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces
Replication vs. Recursive Definitions in Channel Based Calculi
Context-Bounded Analysis of Concurrent Programs (Invited Talk)
Parameterized Approximability of the Disjoint Cycle Problem
Deterministic Sparse Fourier Transform with an ℓ ∞ Guarantee
The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus
Integrating Semantics for Object-Oriented System Models
Basic Observables for Processes
Languages, Rewriting Systems, and Verification of Infinite-State Systems
Wireless Communication Is in APX
Towards the Proximity Conjecture on Group-Labeled Matroids
One-Variable Word Equations in Linear Time
Many-Valued Logics and Holographic Proofs
Program Equivalence and Canonical Forms in Stable Discrete Interpretations
Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings
Efficient Merging, Construction, and Maintenance of Evolutionary Trees
The Expected Extremes in a Delaunay Triangulation
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs
The PushDown Method to Optimize Chain Logic Programs (Extended Abstract)
Proving Lower Bounds for Linar Decision Trees
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane
Efficient Methods for Selfish Network Design
Moving Discs Between Polygons
Two-Level Game Semantics, Intersection Types, and Recursion Schemes
Computing the Fréchet Distance Between Polygons with Holes
Termination Tests inside lambda-Calculus
Dynamic Bin Packing of Unit Fractions Items
On Nontermination of Knuth-Bendix Algorithm
Deciding Properties of Integral Relational Automata
Time-Space Trade-Offs in a Pebble Game
Expander Random Walks: The General Case and Limitations
Super-Fast Distributed Algorithms for Metric Facility Location
Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times
Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint
A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry
A Note on the Average Time to Compute Transitive Closures
Transducers with Origin Information
Fast Regression with an $ell_infty$ Guarantee
Communication Complexity of PRAMs (Preliminary Version)
Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs
Descriptive and Relative Completeness of Logics for Higher-Order Functions
Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms
Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method
A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles: (Extended Abstract)
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem
Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types
Approximation Results for the Optimum Cost Partition Problem
On Linear Decision Trees Computing Boolean Functions
Faster Diameter Computation in Graphs of Bounded Euler Genus
SDP Gaps for 2-to-1 and Other Label-Cover Variants
Grammars with Dynamic Control Sets
Axioms for Contextual Net Processes
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms
Decremental Matching in General Graphs
Strong Bounds for Evolution in Networks
On the Approximability of Multistage Min-Sum Set Cover
Algebraic Languages and Polyominoes Enumeration
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Retracting Graphs to Cycles
Preventing Unraveling in Social Networks: The Anchored k-Core Problem
Algorithms for epsilon-Approximations of Terrains
Axiomatizations for Probabilistic Bisimulation
Algorithmically Efficient Syntactic Characterization of Possibility Domains
Decision Problems in Information Theory
The Equivalence of DGSM Replications on Q-Rational Languages is Decidable
Approximation Algorithms for Diversified Search Ranking
Online Conflict-Free Colorings for Hypergraphs
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
Context-Free Grammar Forms
Breaking the PPSZ Barrier for Unique 3-SAT
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time
Parallel Construction of a Suffix Tree (Extended Abstract)
On the Power of Commutativity in Cryptography
Does the Computational Speed-up Concern Programming?
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures
Faster Fully Compressed Pattern Matching by Recompression
Lower Bounds for One-way Probabilistic Communication Complexity
Efficient Generation of Plane Triangulations without Repetitions
A Faster FPTAS for #Knapsack
Optimal Bounds for the Change-Making Problem
Sublinear Random Access Generators for Preferential Attachment Graphs
Improved Approximation Algorithms for Budgeted Allocations
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes
A Circuit-Based Approach to Efficient Enumeration
Interactive PCP
Analysing Decisive Stochastic Processes
Using a Geometric Lens to Find k Disjoint Shortest Paths
Monadic Second-Order Logics with Cardinalities
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries
The Sequence Equivalence Problem for D0L Systems is Decidable
An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk)
Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees
Preserving Distances in Very Faulty Graphs
On the Advice Complexity of the k-Server Problem
Towards a Study of Low-Complexity Graphs
Stopping Times, Metrics and Approximate Counting
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
Component Reconfiguration in the Presence of Conflicts
Tree Projections: Hypergraph Games and Minimality
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback
A Theory of Communicating Processes with Value-Passing
Proving Precedence Properties: The Temporal Way
Edit Distance of Finite State Transducers
Residual Languages and Probabilistic Automata
How Hard is Compiler Code Generation?
Testing the Complexity of a Valued CSP Language
A Survey of Stochastic Games with Limsup and Liminf Objectives
Almost Optimal Decentralized Routing in Long-Range Contact Networks
Maximizing Profit with Convex Costs in the Random-order Model
Cache Oblivious Distribution Sweeping
On Determining Optimal Strategies in Pursiut Games in the Plane
A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
Correspondence Principles for Effective Dimensions
On the Online Bin Packing Problem
Loader and Urzyczyn Are Logically Related
File Organization, An Application of Graph Theory
An O (log n )-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines
A Model of Intuitionistic Affine Logic From Stable Domain Theory
Amplifiers for the Moran Process
Deterministic Algorithms for k -SAT Based on Covering Codes and Local Search
An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations
Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method
Games with a Weak Adversary
Improving Spanning Trees by Upgrading Nodes
Worst-Case Efficiency Analysis of Queueing Disciplines
Strict Deterministic Languages and Controlled Rewriting Systems
Determinizing Asynchronous Automata
Symmetric Groups and Quotient Complexity of Boolean Operations
The Discrepancy of Shortest Paths
Counting Solutions to Random CNF Formulas
General Resolution of Tseitin Formulas is Hard
The Complexity of Nonlinear Separable Optimization
Let's Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk)
One-Probe Search
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
Parameterized Approximation Schemes Using Graph Widths
Provably Secure Virus Detection: Using The Observer Effect Against Malware
Locally Stable Marriage with Strict Preferences
Nested Annealing: A Provable Improvement to Simulated Annealing
Partially Ordered Regular Languages for Graph Queries
Approximating - Outperforming a Random Assignment with Almost a Linear Factor
Constructions and Bounds for Visual Cryptography
Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models
How Much Lookahead is Needed to Win Infinite Games?
Gaifman Normal Forms for Counting Extensions of First-Order Logic
Graphical Operational Semantics
Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars
Numerical Integration with Exact Real Arithmetic
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
Information-Theoretic and Algorithmic Thresholds for Group Testing
Querying a Matrix Through Matrix-Vector Products
On Explicit Substitution and Names (Extended Abstract)
Can Syntax Be Ignored during Translation?
Polynomial-Time Approximation of Zero-Free Partition Functions
Processes of Place/Transition-Nets
Distributed Processes and Location Failures (Extended Abstract)
Nearly Simultaneously Resettable Black-Box Zero Knowledge
Stable Matching: Choosing Which Proposals to Make
Efficient Sampling Methods for Discrete Distributions
Decidability of a Partial Order Based Temporal Logic
Tighter Hard Instances for PPSZ
The Star Problem in Trace Monoids: Reductions Beyond C4
Byzantine Agreement with a Rational Adversary
Analysis of Smooth Heaps and Slim Heaps
Treewidth and Pathwidth of Permutation Graphs
Incremental 2-Edge-Connectivity in Directed Graphs
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
Quasi-4-Connected Components
A PCP Characterization of AM
The Price of Stability of Weighted Congestion Games
Guessing Games and Distributed Computations in Synchronous Networks
Minimum Cut in O(m log² n) Time
Convergence of the Number of Period Sets in Strings
A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights
Geometric Algorithms for Robotic Manipulation
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop
Maximizing Polynomials Subject to Assignment Constraints
The Complexity of SPEs in Mean-Payoff Games
Limits of Sequential Local Algorithms on the Random k-XORSAT Problem
Secretary Problems with Convex Costs
Shortest Path Queries in Digraphs of Small Treewidth
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time
Reachability and Distances under Multiple Changes
A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing
Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages
A Framework for Decidable Metrical Logics
Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
A Trace Semantics for Petri Nets (Extended Abstract)
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem
Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings
Compositional Verification of Asynchronous Processes via Constraint Solving
A Rice's Theorem for Abstract Semantics
Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes
Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega
Constructing Call-by-Value Continuation Semantics
On the Power of Periodic Iteration of Morphisms
Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States
On-line Resource Management with Applications to Routing and Scheduling
Hollow Heaps
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously