yusuke1997/dblp-id-title huggingface dataset:
Toward a Structure Theory of Regular Infinitary Trace Languages
Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory
Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Multi-armed Bandits with Metric Switching Costs
ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
Session Types and Distributed Computing
Streaming Algorithms for Submodular Function Maximization
The Depth of Boolean Functions
Finding Minimal Forbidden Minors Using a Finite Congruence
Quantum Search on Bounded-Error Inputs
Approximate Nearest Neighbor for Polygonal Curves Under Fréchet Distance
Introduction: Workshop on Intersection Types and Related Systems (ITRS'00)
Bayesian Combinatorial Auctions
Dynamically-Typed Computations for Order-Sorted Equational Presentations
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable
Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
Certifying 3-Connectivity in Linear Time
Collapsing Degrees via Strong Computation (Extended Abstract)
Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples
Dynamic Interpolation Search Revisited
A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Equivariant Syntax and Semantics
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
Incentive Ratios of Fisher Markets
Hardness of String Similarity Search and Other Indexing Problems
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS
Analyzing Context-Free Grammars Using an Incremental SAT Solver
Computability in Categories
A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees
Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract)
The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization
Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems
Acceleration Meets Inverse Maintenance: Faster ℓ ∞ -Regression
Non-Preemptive Flow-Time Minimization via Rejections
Resource Augmentation for Online Bounded Space Bin Packing
Knowledge, Belief and Time
Limits and Applications of Group Algebras for Parameterized Problems
Average-Case Analysis of Pattern-Matching in Trees under the BST Probability Model
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version)
Data Types as Objects
Greedy Regular Expression Matching
Testing Labelled Markov Processes
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Parallel Algorithmic Techniques for Combinatorial Computation
On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth Graphs
Counterexample-Guided Control
Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol
Optimal Approximate Matrix Product in Terms of Stable Rank
Dynamic Enumeration of Similarity Joins
An Improved FPTAS for 0-1 Knapsack
Effective Lossy Queue Languages
Voronoi Choice Games
Measure and Conquer: Domination - A Case Study
An Automata-Theoretic Characterization of the OI-Hierarchy
The Time and Tape Complexity of Developmental Languages
Parameterized Bounded-Depth Frege Is Not Optimal
Deciding Bisimulation-Like Equivalences with Finite-State Processes
The Parametric Complexity of Lossy Counter Machines
Simulating Markovian Open Quantum Systems Using Higher-Order Series Expansion
Intersections of Some Families of Languages
Low Distortion Spanners
Tensor Rank is NP-Complete
Weakly Useful Sequences
Efficient Distributed Communication in Ad-Hoc Radio Networks
Thin MSO with a Probabilistic Path Quantifier
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits
Pebble Weighted Automata and Transitive Closure Logics
Limitations on Quantum Dimensionality Reduction
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables
The Dimension Spectrum Conjecture for Planar Lines
Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings
Containment for Guarded Monotone Strict NP
A Hyperbolic Extension of Kadison-Singer Type Results
Improved Results for Data Migration and Open Shop Scheduling
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series
Logic of Local Inference for Contextuality in Quantum Physics and Beyond
A Modal Logic for a Subclass of Event Structures
Randomness and Intractability in Kolmogorov Complexity
On the Smoothed Complexity of Combinatorial Local Search
An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk)
An Efficient Provable Distinguisher for HFE
Sharing in Nondeterminism
Approximating the Partition Function of the Ferromagnetic Potts Model
Towards an Analysis of Quadratic Probing
Synthesis and Equivalence of Concurrent Systems
Scattering and Sparse Partitions, and Their Applications
Optimal Cache-Oblivious Implicit Dictionaries
Serving in the Dark should be done Non-Uniformly
Computability of Finite Simplicial Complexes
Conditional Lower Bounds for All-Pairs Max-Flow
Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus
Automata-Based Stream Processing
Lower Bounds for Solving Undirected Graph Problems on VLSI
New Doubling Spanners: Better and Simpler
Bounds on the Voter Model in Dynamic Networks
Exact Weight Subgraphs and the k-Sum Conjecture
A System F with Call-by-Name Exceptions
Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
Reconciling Data Compression and Kolmogorov Complexity
Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths
The Nearest Neighbor Problem on Bounded Domains
Logics for Unranked Trees: An Overview
A Game-Theoretic Approach to Deciding Higher-Order Matching
On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions
Parallel 5-Colouring of Planar Graphs
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
Additive Spanners and Distance Oracles in Quadratic Time
Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance
Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts
Settling the Complexity of Local Max-Cut (Almost) Completely
Improved Results for Stackelberg Scheduling Strategies
Learning Low-Degree Quantum Objects
Büchi Objectives in Countable MDPs
Faster Algebraic Algorithms for Path and Packing Problems
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
On Sparsification of Stochastic Packing Problems
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost
New Decidability Results Concerning Two-way Counter Machines and Applications
On Nearest-Neighbor Graphs
A Structural Investigation of the Approximability of Polynomial-Time Problems
Parameterized Low-Rank Binary Matrix Approximation
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I
Superpolynomial Speedups Based on Almost Any Quantum Circuit
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs
Asynchronous Communication of Petri Nets and the Refinement of Transitions
Online Checkpointing with Improved Worst-Case Guarantees
Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II
How to Encrypt with the LPN Problem
A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems
Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal
Randomized Pursuit-Evasion in Graphs
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical
Network Design via Core Detouring for Problems without a Core
Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems
An Aximatic Treatment of Algol 68 Routines
Turing Degrees of Limit Sets of Cellular Automata
Approximation Algorithms for the Joint Replenishment Problem with Deadlines
Weak Pseudorandom Functions in Minicrypt
Minimizing Resources of Sweeping and Streaming String Transducers
Fast Approximation of Search Trees on Trees with Centroid Trees
Relative Discrepancy Does not Separate Information and Communication Complexity
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time
A Composition Theorem for the Fourier Entropy-Influence Conjecture
Strutural Parallel Algorithmics
Maintaining Near-Popular Matchings
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
A Sublinear Time Tester for Max-Cut on Clusterable Graphs
Readiness Semantics for Regular Processes with Silent Actions
Image Density is Complete for Non-Interactive-SZK (Extended Abstract)
Finer-Grained Reductions in Fine-Grained Hardness of Approximation
The IO and OI Hierarchies Revisited
Sorting by Transpositions Is Difficult
The Greedy Algorithm Is not Optimal for On-Line Edge Coloring
Faster Cut-Equivalent Trees in Simple Graphs
Simple Linear Work Suffix Array Construction
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
Semantics: Algebras, Fixed Points, Axioms
Planar Crossing Numbers of Genus g Graphs
Covering Vectors by Spaces: Regular Matroids
Finding the Median (Obliviously) with Bounded Space
Problems Easy for Tree-Decomposable Graphs (Extended Abstract)
An Õ( m 2 n ) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
A Fully Abstract Trace Semantics for General References
Minimum+1 Steiner Cut and Dual Edge Sensitivity Oracle: Bridging Gap between Global and (s, t)-cut
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs
On the Composition of Morphisms and Inverse Morphisms
Tight Bounds for Selfish and Greedy Load Balancing
Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader
Stable Models of Typed lambda-Calculi
Finite Group Topology and p-Adic Topology for Free Monoids
On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract)
On Reachability Problems for Low-Dimensional Matrix Semigroups
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk
Exact and Efficient Generation of Geometric Random Variates and Random Graphs
Minimizing GFG Transition-Based Automata
Subset Feedback Vertex Set Is Fixed-Parameter Tractable
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication
Complexity of Some Problems Concerning L Systems
Incremental Approximate Maximum Flow via Residual Graph Sparsification
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
Advice Coins for Classical and Quantum Computation
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
A Dolev-Yao-Based Definition of Abuse-Free Protocols
Quantum Algorithms for Matrix Scaling and Matrix Balancing
Inversion of Circulant Matrices over Z m
A Guided Tour in Random Intersection Graphs
Universal Realization, Persistent Interconnection and Implementation of Abstract Modules
On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store
A Generalization of a Theorem of Specker and Some Applications
Locally Periodic Infinite Words and a Chaotic Behaviour
Semantic Characterization of Flow Diagrams and Their Decomposability
On the Power of Algebraic Branching Programs of Width Two
Assertional Verification of a Timer Based Protocol
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata
On Defining Error Recovery in Context-Free Parsing
Random Polynomials and Polynomial Factorization
An Adaptively Secure Mix-Net Without Erasures
Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition
Standing on the Shoulders of a Giant - One Persons Experience of Turings Impact (Summary of the Alan M. Turing Lecture)
On Temporal Graph Exploration
Approximate Counting for Spin Systems in Sub-Quadratic Time
Generalized Program Schemas
A Domain Theoretic Model of Qubit Channels
Fast Uniform Analysis of Coupled-Context-Free Languages
NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials
Molecular Computing, Bounded Nondeterminism, and Efficient Recursion
Round-Optimal Lattice-Based Threshold Signatures, Revisited
Algebraic Properties of Valued Constraint Satisfaction Problem
Machine Inductive Inference and Language Identification
Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract)
Constant-Time Algorithms for Sparsity Matroids
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
Optimal Projective Algorithms for the List Update Problem
The Hairy Ball Problem is PPAD-Complete
Generating and Searching Sets Induced by Networks
The Meaning of Negative Premises in Transition System Specifications II
Asynchronous Games over Tree Architectures
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption
Faster All-Pairs Optimal Electric Car Routing
Resynchronizing Classes of Word Relations
How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version)
Hypergraph Isomorphism for Groups with Restricted Composition Factors
Labeling Schemes for Vertex Connectivity
Degree and Decomposability of Variable-Length Codes
A Domain-Theoretic Model for a Higher-Order Process Calculus
Optimal (Degree+1)-Coloring in Congested Clique
Extensional Theories and Rewriting
Satisfiability Thresholds for Regular Occupation Problems
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
Two Variable Logic with Ultimately Periodic Counting
Dynamic Interpolation Search in o(log log n) Time
The Complexity of Boolean Formula Minimization
Semantics for Logic Programs without Occur Check
Faster Deterministic Communication in Radio Networks
On the Succintness of Different Representations of Languages
Secure Games with Polynomial Expressions
The Tractability Frontier for NFA Minimization
One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
Efficiently Computing Succinct Trade-Off Curves
On the Role of Shared Randomness in Simultaneous Communication
Average Bit-Complexity of Euclidean Algorithms
Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
Distributed Detection of Cliques in Dynamic Networks
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture
Approximation Algorithms for Graph Augmentation
What is a Universal Higher-Order Programming Language?
Non-Uniform Automata Over Groups
Popular Matchings in the Stable Marriage Problem
A Type System for Interactive JSON Schema Inference (Extended Abstract)
Fine-Grained Hardness for Edit Distance to a Fixed Sequence
BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting
Relaxed Locally Correctable Codes with Improved Parameters
Upper Bound on Communication Complexity of Private Information Retrieval
A Parallel Algorithm for Two Processors Precedence Constraint Scheduling
LCA Queries in Directed Acyclic Graphs
Interfaces between Languages for Communicating Systems
Towards Blackbox Identity Testing of Log-Variate Circuits
Etude Syntaxique des Parties Reconnaissables de Mots Infinis
Liveness in Timed and Untimed Systems
Computing Shortest Transversals
46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, Patras, Greece, July 9-12, 2019
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs
On the Complexity of Quantified Integer Programming
Succinct Dynamic Dictionaries and Trees
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
Two-Way Finite State Transducers and Monadic Second-Order Logic
Break Finite Automata Public Key Cryptosystem
Robust Asynchronous Protocols Are Finite-State
Gap Amplification in PCPs Using Lazy Random Walks
Routing Through a Generalized Switchbox
Nashification and the Coordination Ratio for a Selfish Routing Game
Quasi-Majority Functional Voting on Expander Graphs
Measures of Presortedness and Optimal Sorting Algorithms (Extended Abstract)
Sur la densité asymptotique de langages formels
Approximation Schemes for Capacitated Geometric Network Design
Closest Pair Problems in Very High Dimensions
The Trace Coding Problem Is Undecidable
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract)
Deciding Finiteness of Petri Nets Up To Bisimulation
Repetition Aware Text Indexing for Matching Patterns with Wildcards
Higher-Order Process and Their Models
Faster Gossiping on Butterflies
Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications
Some Results on Matchgates and Holographic Algorithms
Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics
Star Partitions of Perfect Graphs
Positivity Problems for Reversible Linear Recurrence Sequences
Online Stochastic Reordering Buffer Scheduling
LTL Is Expressively Complete for Mazurkiewicz Traces
Syntactic Control of Inference, Part 2
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
Emptiness and Universality Problems in Timed Automata with Positive Frequency
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
Krivine Machines and Higher-Order Schemes
Sur des langages vérifiant des équations avec opérateur
Network-Aware Strategies in Financial Systems
The RPR 2 Rounding Technique for Semidefinite Programs
Fast Approximate Counting of Cycles
Robust Pseudorandom Generators
Deciding Robustness against Total Store Ordering
Lower Bounds on Dynamic Programming for Maximum Weight Independent Set
Finding Almost Tight Witness Trees
On Reachability for Hybrid Automata over Bounded Time
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method
NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors
A "proof-reading" of Some Issues in Cryptography
Some Decision Results for Recognizable Sets in Arbitrary Monoids
Solving the ANTS Problem with Asynchronous Finite State Machines
High Complexity Tilings with Sparse Errors
CacheShuffle: A Family of Oblivious Shuffles
Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms
Impact of Local Topological Information on Random Walks on Finite Graphs
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions
LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs
Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices
Assigning Sporadic Tasks to Unrelated Parallel Machines
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
A Subexponential Algorithm for ARRIVAL
On the Language Accepted by Finite Reversible Automata
Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems
Polynomial-Time Construction of Linear Network Coding
Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions
Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds
A Unique Termination Theorem for a Theory with Generalised Commutative Axioms
Routing Tree Problems on Random Graphs
Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT
Private Multiparty Sampling and Approximation of Vector Combinations
Unique Fixed Points v. Least Fixed Points
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Linear-Time List Decoding in Error-Free Settings: (Extended Abstract)
Nondeterminism in Abstract Data Types
Dynamic Price Sequence and Incentive Compatibility (Extended Abstract)
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Torsion Matrix Semigroups and Recognizable Transductions
An Introduction to Randomness Extractors
Universal Online Contention Resolution with Preselected Order
Efficient Completely Non-malleable Public Key Encryption
On Total Regulators Generated by Derivation Relations
Separating Quantum and Classical Learning
Reusable Garbled Deterministic Finite Automata from Learning With Errors
Antirandomizing the Wrong Game
Streaming and Communication Complexity of Clique Approximation
Ortho-Radial Drawing in Near-Linear Time
Additive Spanners in Nearly Quadratic Time
Secure Multiparty Computation of Approximations
Combinatorics of Three-Interval Exchanges
Towards Optimal Range Medians
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
Robust Reachability in Timed Automata: A Game-Based Approach
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
Twin-Width and Types
Fixpoint Approach to the Theory of Computation
On the Logical Characterisation of Performability Properties
OKFDDs versus OBDDs and OFDDs
Sul l'inversion des morphisms d'arbres
On the Bit Complexity of Sum-of-Squares Proofs
Rollercoasters and Caterpillars
On Black-Box Ring Extraction and Integer Factorization
A Model for Associative Memory, a Basis for Thinking and Consciousness
From Normal Functors to Logarithmic Space Queries
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
Real-Time Scheduling with a Budget
Completeness of Graphical Languages for Mixed States Quantum Mechanics
Applications of Effective Probability Theory to Martin-Löf Randomness
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
An Efficient Algorithm to Compute the Minimum Free Energy of Interacting Nucleic Acid Strands
Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps
Fault-Tolerant ST-Diameter Oracles
Fast Incremental Planarity Testing
Testing Dynamic Environments: Back to Basics
Separability Properties of Monadically Dependent Graph Classes
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles
The Essence of Principal Typings
Covering a Graph by Circuits
The Average Case Complexity of the Parallel Prefix Problem
From Trees to Graphs: Defining the Semantics of Diagram Languages with Graph Transformation
Dichotomy for Symmetric Boolean PCSPs
Une Famille Remarquable de Codes Indecomposables
On the Knuth-Bendix Completion for Concurrent Processes
Binary Pattern Tile Set Synthesis Is NP-hard
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
Strongly Adaptive Token Distribution
On Expressiveness and Complexity in Real-Time Model Checking
Towards Quantitative Verification of Probabilistic Transition Systems
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
Systolic Architectures, Systems and Computations
About Rational Sets of Factors of a Bi-Infinite Word