yusuke1997/dblp-id-title huggingface dataset:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
Identifying Tractable Quantified Temporal Constraints Within Ord-Horn
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract)
Tree Automata and Attribute Grammars
Another Look at Abstraction in Process Algebra (Extended Abstract)
Spanners in Sparse Graphs
Atomic Congestion Games Among Coalitions
What Do Program Logics and Type Systems Have in Common?
Cryptographic Reverse Firewalls for Interactive Proof Systems
Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices
Smoothed Analysis of the Komlós Conjecture
Solos in Concert
Flat Parametric Counter Automata
Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes
Varietes de Semigroupes et Mots Infinis
Applications of an Infinite Squarefree CO-CFL
Uniform Kernelization Complexity of Hitting Forbidden Minors
Fast Algorithms for Constructing Maximum Entropy Summary Trees
Termination of Constraint Logic Programs
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
Markov Decision Processes and Regular Events (Extended Abstract)
Deterministic Extractors for Independent-Symbol Sources
Testing Preorders for Probabilistic Processes
Medians in Median Graphs and Their Cube Complexes in Linear Time
Lovász Meets Weisfeiler and Leman
On Reducing Linearizability to State Reachability
On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract)
Rational Subsets of Baumslag-Solitar Groups
2-Vertex Connectivity in Directed Graphs
Measure, Category and Learning Theory
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
Complexity of Two-Variable Logic on Finite Trees
Optimal Oblivious Subspace Embeddings with Near-Optimal Sparsity
Recursive Computational Depth
Solving Two-Variable Word Equations (Extended Abstract)
Behavioural Equivalence Relations Induced by Programming Logics
Weighted Automata and Weighted Logics
Append-Only Signatures
Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In
44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, July 10-14, 2017
Lower Bounds for Sorting of Sums
Deterministic Independent Sets in the Semi-Streaming Model
An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract)
A New Algorithm for Optimal Constraint Satisfaction and Its Implications
Approximation Algorithms for Euclidean Group TSP
Optimal Adjacency Labels for Subgraphs of Cartesian Products
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic
A Note on Sweeping Automata
Parameterized Modal Satisfiability
Typed GoI for Exponentials
Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem
Nominal Topology for Data Languages
Approximating Steiner k-Cuts
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes
Single-Use Automata and Transducers for Infinite Alphabets
Partial Algebras Flow From Algebraic Specifications
Forward Analysis for WSTS, Part II: Complete WSTS
Reasoning about The Past with Two-Way Automata
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier
L Systems of Finite Index (Extended Abstract)
The Mathematics of Record Handling
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
Natural Homology
First Order Logic on Pathwidth Revisited Again
Efficient Quantum Algorithms for Simulating Lindblad Evolution
Cononical Sets of Horn Clauses
Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
Weak Completeness Notions for Exponential Time
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
Stochastic Steiner Trees Without a Root
Fast Universalization of Investment Strategies with Provably Good Relative Returns
An O (log n )-Competitive Algorithm for Online Constrained Forest Problems
On Infinite Transition Graphs Having a Decidable Monadic Theory
Parameterized Algorithms to Preserve Connectivity
A Context Dependent Equivalence between Processes
An Abstract Data Type for Real Numbers
A Matrix Hyperbolic Cosine Algorithm and Applications
Faster Algorithms for Dual-Failure Replacement Paths
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity
Fully Dynamic Algorithms for Transitive Reduction
Preserving Secrecy Under Refinement
Small Bias Requires Large Formulas
Solution Sets for Equations over Free Groups are EDT0L Languages
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Algorithms, Games, and the Internet
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
On the Complexity of Grammar-Based Compression over Fixed Alphabets
AVL-Trees for Localized Search
Testing Graph Isomorphism in Parallel by Playing a Game
Modelling with Partial Orders - Why and Why Not?
Undirected 3-Fault Replacement Path in Nearly Cubic Time
Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures
Recursion and Parameter Mechanisms: An Axiomatic Approach
The Complexity of Promise Problems
Faster, Deterministic and Space Efficient Subtrajectory Clustering
Symbolic Trace Analysis of Cryptographic Protocols
History-Independent Cuckoo Hashing
Efficient Simulations of Multicounter Machines
Information Flow vs. Resource Access in the Asynchronous Pi-Calculus
On Equivalent Representations of Infinite Structures
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm
Varieties of Data Languages
Online Algorithm Design Beyond the Worst Case (Invited Talk)
The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation
On Size Bounds for Deterministic Parsers
A Unified Framework for Strong Price of Anarchy in Clustering Games
Counting with Rational Functions
Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract)
On the Complexity of Broadcast Setup
On the Complexity of Sampling Vertices Uniformly from a Graph
Diagrammatic Confluence and Completion
Spatial Mixing of Coloring Random Graphs
Homomorphic Encryption with CCA Security
On the Cover Time of Random Geometric Graphs
Equations in Free Monoids
Efficiently Testing Sparse GF(2) Polynomials
Approximation via Correlation Decay When Strong Spatial Mixing Fails
The Theory of Data Dependencies - An Overview
Higher-Order Model Checking Step by Step
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
Algebraic Proof Systems (Invited Talk)
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
Assignment-Programs
Decidability of the Guarded Fragment with the Transitive Closure
Simulation Preorder on Simple Process Algebras
A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
A Complete Axiom System for Algebra of Closed-Regular Expression
The Definability of Equational Graphs in Monadic Second-Order Logic
Results on the Propositional µ-Calculus
Rational relations of Binary Trees
Measures of Nondeterminism in Finite Automata
Online Stochastic Matching with Edge Arrivals
Finding Cliques in Social Networks: A New Distribution-Free Model
Linear-Time Construction of Two-Dimensional Suffix Trees
Differential Logical Relations, Part I: The Simply-Typed Case
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
On the Completeness of Arbitrary Selection Strategies for Paramodulation
On the Expressive Power of Cost Logics over Infinite Words
Nearly Tight Spectral Sparsification of Directed Hypergraphs
Fast Collaborative Graph Exploration
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering
Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network
Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report)
Languages reconnaissables et codage prefixe pur
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs
On Three-Element Codes
Adaptively Secure Non-interactive Threshold Cryptosystems
On Erasing Productions in Random Context Grammars
Provably Recursive Programs and Program Extraction
Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability
On Tree-Constrained Matchings and Generalizations
The Polytope-Collision Problem
Modular Algorithms for Heterogeneous Modal Logics
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay
Covering Metric Spaces by Few Trees
Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
Near Optimal Adjacency Labeling Schemes for Power-Law Graphs
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
Improved Parallel Approximation of a Class of Integer Programming Programming Problems
Symbolic Strategy Synthesis for Games on Pushdown Graphs
Relating Graph Thickness to Planar Layers and Bend Complexity
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
Ambiguity and Transcendence
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs
An Almost Linaer Time Algorithm for Computing a Dependency Basis in a Relational Data Base
Efficient Algorithms for Path Problems with Gernal Cost Citeria
Approximation Algorithms for Min-Distance Problems in DAGs
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract)
Optimal Trade-Offs for Succinct String Indexes
Existential Types: Logical Relations and Operational Equivalence
Ranking with Fairness Constraints
A Coalgebraic Foundation for Coinductive Union Types
Composition of Automata
Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency
A Timed Failures Model for Extended Communicating Processes
Searching among Intervals and Compact Routing Tables
Semi-Commutations and Rational Expressions
Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract)
On Steganographic Chosen Covertext Security
A Study of Integrated Document and Connection Caching
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
On List Update with Locality of Reference
Automata Learning and Galois Connections (Invited Talk)
4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}
Mobility Types for Mobile Ambients
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
A Transaction Model
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
Two-Source and Affine Non-Malleable Extractors for Small Entropy
Decomposition and Composition of Timed Automata
NP-Completeness: A Retrospective
An Automata-Theoretic Completeness Proof for Interval Temporal Logic
Communication Versus Computation
A Set-Theoretic Framework for Assume-Guarantee Reasoning
Minimal Automaton of a Rational Cover
On Computing the Entropy of Cellular Automata
Robust Multi-property Combiners for Hash Functions Revisited
A Theory of Computation with an Identity Discriminator
The Efficiency and Fairness of a Fixed Budget Resource Allocation Game
Matching on the Line Admits No o(√log n)-Competitive Algorithm
Sample-Optimal Identity Testing with High Probability
Adaptive Raising Strategies Optimizing Relative Efficiency
Finer Tight Bounds for Coloring on Clique-Width
Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains
Hard Problems on Random Graphs
Additive Approximation Schemes for Load Balancing Problems
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention
The Complexity of Downward Closure Comparisons
Choosing, Agreeing, and Eliminating in Communication Complexity
Dynamic Membership for Regular Languages
On the Power of Ordering in Linear Arithmetic Theories
Dynamic Programming on Graphs with Bounded Treewidth
Estimating Sum by Weighted Sampling
Une Extension de la Theorie des Types en lambda-Calcul
On the l -Ary GCD-Algorithm in Rings of Integers
Topological Sorting with Regular Constraints
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications
Mean-Payoff Games and Propositional Proofs
Towards Formal Development of Programs from Algebraic Specifications: Model-Theoretic Foundations
Information Complexity Is Computable
Decoding of Interleaved Reed Solomon Codes over Noisy Data
Approximate Bounded Indistinguishability
On Semantically-Deterministic Automata
A QPTAS for the General Scheduling Problem with Identical Release Dates
A Thirty Year Old Conjecture about Promise Problems
Lower Bounds in the Quantum Cell Probe Model
An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs
Solutions of Word Equations Over Partially Commutative Structures
Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract)
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances
Approximation Algorithms for Network Design in Non-Uniform Fault Models
Offline/Online Mixing
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity
Computing Mimicking Networks
Can Verifiable Delay Functions Be Based on Random Oracles?
Knapsack and Subset Sum with Small Items
Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
Tighter Relations between Sensitivity and Other Complexity Measures
Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings
Testing of Properties of Finite Algebras
Tilings and Quasiperiodicity
Multihead Finite State Automata and Concatenation
Word Equations in Nondeterministic Linear Space
Complexité des problèmes de décision relatifs aux algorithmes de tri
Reachability is in DynFO
Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System
A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes
Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
Approximate Span Programs
Graphbots: Mobility in Discrete Spaces
The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average
Nondeterminism Is Essential in Small 2FAs with Few Reversals
The Equivalence Problem for t-Turn DPDA Is Co-NP
regular Languages Defined with Generalized Quantifiers
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks
Fault-Tolerance and Complexity (Extended Abstract)
A Spatial Logic for Querying Graphs
Gray Codes and Symmetric Chains
Near-perfect Token Distribution
Weighted Bipartite Matching in Matrix Multiplication Time
Silent Transitions in Automata with Storage
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
One-Shot Learning for k-SAT
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
The Minimum Cost Query Problem on Matroids with Uncertainty Areas
B-Treaps: A Uniquely Represented Alternative to B-Trees
The NOF Multiparty Communication Complexity of Composed Functions
Path Contraction Faster Than 2 n
Hardness of Set Cover with Intersection 1
Practical and Provably Secure Onion Routing
Distributed Monitoring of Network Properties: The Power of Hybrid Networks
Searchability in Merging and Implicit Data Structures
Parallelism in Rewriting Systems
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Lifting for Constant-Depth Circuits and Applications to MCSP
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games
Incremental Construction of Unification Algorithms in Equational Theories
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings
Priority Queues, Pairing, and Adaptive Sorting
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
Dynamic Algorithms in D. E. Knuth's Model: A Probabilistic Analysis
Understanding the Complexity of Induced Subgraph Isomorphisms
Decomposition of Partial Commutations
An Intersection Inequality for Discrete Distributions and Related Generation Problems
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
Scarf's Algorithm on Arborescence Hypergraphs
Limits on the Computational Power of Random Strings
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
The Complexity of Ergodic Mean-payoff Games
DNA Computing: New Ideas and Paradigms
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
Bulk-Synchronous Parallel Multiplication of Boolean Matrices
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
On Observing Dynamic Prioritised Actions in SOC
Stability and Similarity of Link Analysis Ranking Algorithms
New and Improved Bounds for Markov Paging
Temporal Cliques Admit Sparse Spanners
Conservative Extensions in Guarded and Two-Variable Fragments
An Improved Program for Constructing Open Hash Tables
On the Most Recent Property of Algol-Like Programs
Union of Hypercubes and 3D Minkowski Sums with Random Sizes
Reachability in 3-VASS Is Elementary
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
Space Time Tradeoffs for Graph Properties
Invariants for Continuous Linear Dynamical Systems
Factoring Multivariate Integral Polynomials
The Bottleneck Complexity of Secure Multiparty Computation
On the Relation between Direct and Continuation Semantics
An Improved Quantum Max Cut Approximation via Maximum Matching
The Size of an Interwine
On Distributed Algorithms in a Broadcast Domain
Metric Semantics for True Concurrent Real Time
New Horizons in Quantum Information Processing
Efficient Verification Algorithms for One-Counter Processes
Simulated Annealing Beats Metropolis in Combinatorial Optimization
Nominal Completion for Rewrite Systems with Binders
Testing Hypergraph Coloring
Improved Pseudorandom Generators for Combinatorial Rectangles
Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation
Improved Hardness for Cut, Interdiction, and Firefighter Problems
Better Scalable Algorithms for Broadcast Scheduling
On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
Optimal Approximation of Uniform Distributions with a Biased Coin
A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width
Coloring Relatives of Interval Overlap Graphs via On-line Games
Mim-Width Is paraNP-Complete
The Landscape of Communication Complexity Classes
The Quest for Small Universal Cellular Automata
Clique Is Hard to Approximate within n 1- o (1)
Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract)
A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
Local Matching Dynamics in Social Networks
Price of Competition and Dueling Games
Self-shuffling Words
Parsimonious Types and Non-uniform Computation
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
Descriptive Complexity on Non-Polish Spaces II
Renaming and Erasing in Szilard Languages
A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error
Holographic Circuits
Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median
Clique Cover and Graph Separation: New Incompressibility Results
A Greibach Normal Form for Context-free Graph Grammars
Monadic Program Schemes Under Restricted Classes of Free Interpretations
Deterministic Graph Exploration with Advice
Computational Complexity of the α-Ham-Sandwich Problem
Optimal Inapproximability of Promise Equations over Finite Groups
The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2
Infinitary Logic for Computer Science
Holant* Dichotomy on Domain Size 3: A Geometric Perspective
A PTAS for a Class of Stochastic Dynamic Programs
Convergence Time of Power-Control Dynamics
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract)
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
Rumor Spreading in Social Networks
From Secrecy to Soundness: Efficient Verification via Secure Computation
Nonuniform Graph Partitioning with Unrelated Weights
Divergence and Fair Testing
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
Morphing Planar Graph Drawings Optimally
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
Streaming k-Edit Approximate Pattern Matching via String Decomposition
Streaming Edge Coloring with Subquadratic Palette Size
The Theory of Vaccines
The Online Metric Matching Problem for Doubling Metrics
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player
Selling Two Goods Optimally
Better Space-Time-Robustness Trade-Offs for Set Reconciliation
The Measurement Process in Domain Theory
Power Domains and Predicate Transformers: A Topological View
On Multiple Keyword Sponsored Search Auctions with Budgets
Cache-Aware and Cache-Oblivious Adaptive Sorting
QCSP on Semicomplete Digraphs
A Spectral Independence View on Hard Spheres via Block Dynamics
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
On Recognizable and Rational Formal Power Series in Partially Commuting Variables
Quantum Relational Hoare Logic with Expectations
Lower Bounds by Recursion Theoretic Arguments (Extended Abstract)
From Domains to Automata with Concurrency
On some Relations between Dynamical Systems and Transition Systems
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter
Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable
Edge-Orders
Lipschitz Continuous Allocations for Optimization Games
Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication
Quasi-Deterministic 0L Systems
Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
Efficient Array Partitioning
On Proofs of Programs for Synchronization
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry
Reachability for Branching Concurrent Stochastic Games
The Complexity of Computing the Size of an Interval
Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions
Breaking the Barrier of 2 for the Storage Allocation Problem
On the Power of Real-Time Machines Under Varying Specifications (Extended Abstract)
Effectivity Problems of Algorithmic Logic
Reliable and Efficient Computational Geometry Via Controlled Perturbation
Attribute Grammars and Categorical Semantics
The Set Union Problem with Backtracking
Philosophical Issues in Kolmogorov Complexity
On LALR(1) Testing
On the Wake-Up Problem in Radio Networks
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs