yusuke1997/dblp-id-title huggingface dataset:
Analysing Survey Propagation Guided Decimationon Random Formulas
Simple EOL Forms under Uniform Interpretation Generating CF Languages
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
The Complexity of Computing in Continuous Time: Space Complexity Is Precision
An Improved Algorithm for Transitive Closure on Acyclic Digraphs
Algorithms for Noisy Broadcast with Erasures
On the Complexity of Hard-Core Set Constructions
Randomness in Distributed Protocols
Static and Dynamic Low-Congested Interval Routing Schemes
A Hierarchy of Local Decision
49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, Paris, France, July 4-8, 2022
New Algorithms for Regular Expression Matching
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth
All-Pairs 2-Reachability in O(n^w log n) Time
k-Distinct In- and Out-Branchings in Digraphs
A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders
Maintaining Biconnected Components of Dynamic Planar Graphs
Theory of 2-Structures
The Complexity of Cubical Graphs (Extended Abstract)
Faster Algorithms for Privately Releasing Marginals
Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, Glasgow, Scotland (Virtual Conference), July 12-16, 2021
An Algorithmic Approach to the Semantics of Programming Languages
Approximating Directed Steiner Problems via Tree Embedding
Complexite des Demi-Groupes de Matrices
Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder
On Differentially Private Counting on Trees
The Parameterized Complexity of Positional Games
Decidable Properties of Graphs of All-Optical Networks
A Kleene-Presburgerian Approach to Linear Production Systems
Parameterised Holant Problems
On the Interpretation of Infinite Computations in Logic Programming
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time
Decision Problems for Additive Regular Functions
Limitations of Algebraic Approaches to Graph Isomorphism Testing
Realization Theory of Linear Systems over a Commutative Ring
Reducing CMSO Model Checking to Highly Connected Graphs
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
Strongly Sublinear Algorithms for Testing Pattern Freeness
Lower Bounds for Row Minima Searching (Extended Abstract)
Finding Even Cycles Even Faster
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract)
Time and Space Bounds for Selection Problems
Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction
Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case
Generalized Compact Knapsacks Are Collision Resistant
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities
Decomposition Width of Matroids
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem
Nonfinite Axiomatizability of the Equational Theory of Shuffle
Uniform Budgets and the Envy-Free Pricing Problem
Weighted Logics for Nested Words and Algebraic Formal Power Series
Extending the Notion of Finite Index
Algorithmic Games for Full Ground References
Which Classes of Origin Graphs Are Generated by Transducers
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
NFAs With and Without epsilon -Transitions
Exact Algorithms via Multivariate Subroutines
Containment, Separation, Complete Sets, and Immunity of Complexity Classes
Deciding Global Partial-Order Properties
On the Fine-Grained Complexity of Parity Problems
Optimal Distance Labeling for Permutation Graphs
Approximating the Minimum Spanning Tree Weight in Sublinear Time
New Approaches for Virtual Private Network Design
Amplification with One NP Oracle Query
Variable Independence, Quantifier Elimination, and Constraint Representations
New Interpretation and Generalization of the Kameda-Weiner Method
Algorithms for Secretary Problems on Graphs and Hypergraphs
P-Generic Sets
On the Proper Treatment or Referencing, Dereferencing and Assignment
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract)
Constructing Competitive Tours From Local Information
Relations between Semantics and Complexity of Recursive Programs
On Complexity of Regular (1, +k)-Branching Programs
Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location
Randomized Interpolation and Approximation of Sparse Polynomials
Product Theorems Via Semidefinite Programming
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case
A Spectral Bound on Hypergraph Discrepancy
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp
The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
Finite Loops Recognize Exactly the Regular Open Languages
A Domain Theoretic Account of Picard's Theorem
Distributed Controller Synthesis for Local Specifications
Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity
Decidability of Conjugacy of Tree-Shifts of Finite Type
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions
Spanning Trees with Bounded Number of Branch Vertices
Structural and Behavioural Equivalences of Networks
Balanced Families of Perfect Hash Functions and Their Applications
Efficient Computation of Balanced Structures
Brief Announcement: Energy Constrained Depth First Search
Regular Temporal Cost Functions
Towards a Unified Theory of Operational and Axiomatic Semantics
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
Decidability in Syntactic Control of Interference
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction
Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract)
Ray Shooting in Polygons Using Geodesic Triangulations
Efficient Sample Extractors for Juntas with Applications
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width
Primitive Tranformations of Regular Sets and Recognizable Sets
Boundedness of Reset P/T Nets
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract)
Functional Monitoring without Monotonicity
Constructing Differential Categories and Deconstructing Categories of Games
A Quantum Lower Bound for the Query Complexity of Simon's Problem
Comparisons and Reset Machines (Preliminary Report)
A KLeene Theorem for Recognizable Languages over Concurrency Monoids
On Range Summary Queries
Unary Pushdown Automata and Straight-Line Programs
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
Regular Expressions with Backreferences and Lookaheads Capture NLOG
Elementary Equivalence Versus Isomorphism in Semiring Semantics
The Implication Problem for Data Dependencies
Decidable First-Order Transition Logics for PA-Processes
Explicit Non-adaptive Combinatorial Group Testing Schemes
Optimal Bounds for Distinct Quartics
The POwer of Reconfiguration
A Hardware Semantics Based on Temporal Intervals
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract)
Automata Theory Meets Circuit Complexity
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Optimal Branch-Decomposition of Planar Graphs in O ( n 3 ) Time
Range Majority in Constant Time and Linear Space
Uniform Computational Complexity of Taylor Series
Optimal Monotone Encodings
Representing Complexity Classes by Equality Sets (Preliminary Report)
Membership and Conjugacy in Inverse Semigroups
Sublinear Dynamic Interval Scheduling (On One or Multiple Machines)
Algorithms for Multi-product Pricing
Cancellation, Pumping and Permutation in Formal Languages
Some Matching Problems
Minimum-Time Reachability in Timed Games
An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs
Hard Sets Method and Semilinear Reservoir Method with Applications
Optimal Solutions for a Class of Point Retrieval Problems
Semantic Analysis of Communicating Sequential Processes (Shortened Version)
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model
Boundedness of Monadic Second-Order Formulae over Finite Words
Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension
Generalized Center Problems with Outliers
AC 0 [p] Lower Bounds Against MCSP via the Coin Problem
Constraint Satisfaction Problems over the Integers with Successor
Characterizing Fairness Implementability for Multiparty Interaction
Outer Narrowing for Equational Theories Based on Constructors
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
Monadic NIP in Monotone Classes of Relational Structures
Online Learning and Disambiguations of Partial Concept Classes
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?
Scheduling Under Non-Uniform Job and Machine Delays
Multicommodity Demand Flow in a Tree
On Decidability of Time-Bounded Reachability in CTMDPs
Local Computation Algorithms (Invited Talk)
Pumping and Counting on the Regular Post Embedding Problem
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching
On the Complexity of Resolution with Bounded Conjunctions
New Online Algorithms for Story Scheduling in Web Advertising
Lower Bounds for Dynamic Distributed Task Allocation
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem
Near-Optimal Schedules for Simultaneous Multicasts
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II
Distance Labeling Schemes for Trees
Production Prefix Parsing (Extended Abstract)
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group
Labeling Schemes for Bounded Degree Graphs
The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences
Comparison of Process Algebra Equivalences Using Formats
Independent Zero-Knowledge Sets
Efficiency-Revenue Trade-Offs in Auctions
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
Minimality and Computability of Languages of G-Shifts
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups
Lower Bounds for Matroid Optimization Problems with a Linear Constraint
Do Rational Equivalence Relations have Regular Cross-Sections?
Sequentiality of String-to-Context Transducers
Node Weighted Matching
Selling Complementary Goods: Dynamics, Efficiency and Revenue
A Decision Procedure for the Equivalence of Two DPDAs, One of Which is Linear (Extended Abstract)
A Saturation Method for Collapsible Pushdown Systems
Dynamic Matrix Rank
A Strong Restriction of the Inductive Completion Procedure
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary
Fast Asynchronous Systems in Dense Time
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold
Dynamic Meta-Theorems for Distance and Matching
Satisfiability Problems for Finite Groups
Random-Edge Is Slower Than Random-Facet on Abstract Cubes
Compute Choice
Multiply-Recursive Upper Bounds with Higman's Lemma
Proving Partial Order Liveness Properties
Realizing an Equational Specification
Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles
Polynomial Hash Functions Are Reliable (Extended Abstract)
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games
Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems
Alternating the Temporal Picture for Safety
Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk)
Unbounded-Error One-Way Classical and Quantum Communication Complexity
If a D0L Language is k-Power Free then it is Circular
Efficient Procedures for Using Matrix Algorithms
Simple Programs and Their Decision Problems
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
Model Checking and Testing Combined
Single-Key AIL-MACs from Any FIL-MAC
Linear Time Runs Over General Ordered Alphabets
What Entailment Can do for Type Theory
Approximating Variance in Non-product Form Decomposed Models
Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication
Algorithms, Networks, and Social Phenomena
Towards Tight Lower Bounds for Range Reporting on the RAM
Π 2 ∩ Σ 2 ≡ AFMC
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés
Online Packet Routing on Linear Arrays and Rings
Counting Answers to Existential Questions
Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems
Preserving Terminal Distances Using Minors
Approximation of Convex Polygons
Light Edge Fault Tolerant Graph Spanners
Complexity of Infinite Trees
An Efficient Compiler from Sigma -Protocol to 2-Move Deniable Zero-Knowledge
On the Complexity of Graph Critical Uncolorability
A PTAS for the Weighted Unit Disk Cover Problem
Lexical Semantics with Linear Types
A Fixed-Parameter Algorithm for the Kneser Problem
Function Spaces for Orbit-Finite Sets
Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus
Stochastic Matching with Commitment
Générateurs algébriques non-ambigus
A Proposed Categorial Semantics for Pure ML
A Framework for Dynamizing Succinct Data Structures
On the Dynamics of Sharing Graphs
Frameworks for Nonclairvoyant Network Design with Deadlines or Delay
On the Complexity of Trial and Error for Constraint Satisfaction Problems
Language Learning by a "Team" (Extended Abstract)
Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus
Quantum Counting
Partial Evaluation, Self-Application and Types
A Proof Theoretical Approach to Communication
Distributed Controller Synthesis for Deadlock Avoidance
Probabilistic and Causal Satisfiability: Constraining the Model
The Submodular Santa Claus Problem in the Restricted Assignment Case
Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric Inequalities
Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy
On Hardness of Jumbled Indexing
Shared-Memory Simulations on a Faulty-Memory DMM
Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE
Internal Mobility and Agent-Passing Calculi
Approximation Algorithms for Min-Distance Problems
Graph Reconstruction from Random Subgraphs
On Counting Homomorphisms to Directed Acyclic Graphs
Optimal Electrical Oblivious Routing on Expanders
Competitive Weighted Matching in Transversal Matroids
Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity
Independent Sets with Domination Constraints
Deterministic Complexity Analysis of Hermitian Eigenproblems
Mobile Processes with a Distributed Environment
Parallel Machine Scheduling Problems with Controllable Processing Times
Combinatorial Secretary Problems with Ordinal Information
Approximately Counting Locally-Optimal Structures
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Paths Problems in Symmetric Logarithmic Space
Tight Lower Bound for Linear Sketches of Moments
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics
A Scaling Algorithm for Weighted f-Factors in General Graphs
Lower Bounds for Pseudo-Deterministic Counting in a Stream
The SDP Value of Random 2CSPs
On the Relationship of CCS and CSP
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs
A New Approach for Analyzing Convergence Algorithms for Mobile Robots
A Very Sketchy Talk (Invited Talk)
A Note on Intersections of Free Submonoids of a Free Monoid
Max-Cut Parameterized above the Edwards-Erdős Bound
An Operational Characterization of Mutual Information in Algorithmic Information Theory
Langages algébriques sur le magma libre et sémantique des schémas de programme
On Round-Efficient Argument Systems
Path Measures of Turing Machine Computations (Preliminary Report)
Inherent Ambiguities in Families of Grammars (Extended Abstract)
Treewidth Parameterized by Feedback Vertex Number
Smoothed Analysis of Balancing Networks
A Note on Parallel Read Operations on Large Public Databases
Limits of Symmetric Computation (Invited Talk)
Tighter Fourier Transform Lower Bounds
A Generic Model for Diagram Syntax and Semantics
On the Structure of Solution Sets to Regular Word Equations
Strategy Synthesis for Global Window PCTL
On ≤ 1-tt p -Sparseness and Nondeterministic Complexity Classes (Extended Abstract)
Deterministic Polynomial Approach in the Plane
The Power of Shared Randomness in Uncertain Communication
Timed Games and Deterministic Separability
Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP
Learning Stochastic Decision Trees
First-Order Intuitionistic Linear Logic and Hypergraph Languages
New Techniques for Proving the Decidability of Equivalence Problems
Model Checking Lower Bounds for Simple Graphs
Lower Bounds by Kolmogorov-Complexity (Extended Abstract)
Online Two-Dimensional Load Balancing
Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic
Robot Positioning Using Torus Packing for Multisets
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness
New Fault Tolerant Subset Preservers
Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups
Boneh-Franklin Identity Based Encryption Revisited
Tree Polymatrix Games Are PPAD-Hard
Relational Algebra Operations and Sizes of Relations
From Verification to Causality-Based Explications (Invited Talk)
Arboreal Categories and Resources
Results on Resource-Bounded Measure
A Testing Scenario for Probabilistic Automata
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Least Solutions of Equations over N
Low Sample Complexity Participatory Budgeting
Distance Constrained Labelings of Graphs of Bounded Treewidth
Pebble Games with Algebraic Rules
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery
Which Graphs for Visual Modeling?
Testing Acyclicity of Directed Graphs in Sublinear Time
Proved Trees
A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object
Measuring the Probabilistic Powerdomain
Two Strikes Against Perfect Phylogeny
Restricted Two-Variable Sentences, Circuits and Communication Complexity
Lopsided Trees: Analyses, Algorithms, and Applications
Subquadratic Submodular Maximization with a General Matroid Constraint
Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version)
Equations Defining the Polynomial Closure of a Lattice of Regular Languages
Mixin Modules and Computational Effects
Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs
Unranked Tree Automata with Sibling Equalities and Disequalities
Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error
Adding Action Refinement to a Finite Process Algebra
Complexity Classes of Formal Languages (Extended Abstract)
Quantum Strategies Are Better Than Classical in Almost Any XOR Game
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
Programming with Infinitesimals: A While-Language for Hybrid System Modeling
Qualitative Concurrent Stochastic Games with Imperfect Information
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
DNA²DNA Computations: A Potential "Killer App"?
Liveness of Parameterized Timed Networks
A Matrix-based Method for Analysing Stochastic Process Algebras
Extensional Embedding of a Strongly Stable Model of PCF
An Optimal Algorithm for Online Multiple Knapsack
Interactive Oracle Proofs with Constant Rate and Query Complexity
Extended pi-Calculi
Ramsey Goes Visibly Pushdown
Some New (And Old) Results on Contention Resolution (Invited Talk)
The Complexity of Semilinear Sets
Past, Present, and Infinite Future
Hierarchical Group Signatures
Density of Rational Languages Under Shift Invariant Measures
Approximating List-Coloring on a Fixed Surface
Interval Graphs: Canonical Representation in Logspace
The Complexity and Decidability of Separation
CCS + Time = An Interleaving Model for Real Time Systems
On Randomized Versus Deterministic Computation
An Optimal 3-Fault-Tolerant Connectivity Oracle
Bayesian Calibrated Click-Through Auctions
Strategy Composition in Compositional Games
Could SFLASH be Repaired?
Checking Properties of Polynomials (Extended Abstract)
The Ehrenfeucht-Silberger Problem
Bicovering: Covering Edges With Two Small Subsets of Vertices
On Semantic Foundations for Applicative Multiprogramming
A Systematic Approach to Formal Language Theory Through Parallel Rewriting
P-Time Algorithms for Typical #EO Problems
Streaming Algorithms for Geometric Steiner Forest
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
Automates stochastiques et séries rationnelles non commutatives
The Minimum Color Sum of Bipartite Graphs
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
LL(k) Languages are Closed Under Union with Finite Languages
Limiting Negations in Formulas
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
On Finding the Jaccard Center
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace
Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k
Learnability: Admissible, Co-finite, and Hypersimple Languages
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices)
The Complexity of Infinitely Repeated Alternating Move Games
Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids
New Bounds for the Ideal Proof System in Positive Characteristic
Analytical Differential Calculus with Integration
Theories of HNN-Extensions and Amalgamated Products
Tree Compression with Top Trees
Time-Efficient Quantum Walks for 3-Distinctness
Computing Tutte Paths
Correlation Decay and Tractability of CSPs
A PTAS for Packing Hypercubes into a Knapsack
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams
Model Checking Game Properties of Multi-agent Systems (Abstract)
Fast, Robust, Quantizable Approximate Consensus
On the Competitive Ratio for Online Facility Location
Nearly Optimal Circuit Size for Sparse Quantum State Preparation
Approximating Sparse Covering Integer Programs Online
Faster Matroid Partition Algorithms
Equational Systems and Free Constructions (Extended Abstract)
The Wadge Hierarchy of Deterministic Tree Languages
Continuous Capacities on Continuous State Spaces
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds
Auction Design under Interdependent Values (Invited Talk)
Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs