yusuke1997/dblp-id-title huggingface dataset:
Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract)
Algorithms for the Generalized Poset Sorting Problem
Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I
How to Protect Yourself without Perfect Shredding
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
On Higher-Order Cryptography
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
Theoretical Aspects of Evolutionary Algorithms
Lower Bounds for Computations with the Floor Operation
Example-Guided Abstraction Simplification
Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers
Two-coloring Random Hypergraphs
Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC
The Bose-Hubbard Model is QMA-complete
Languages Defined by Higher Type Program Schemes
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
The Compositional Structure of Multipartite Quantum Entanglement
Characterization Problems in the Theory of Inductive Inference
Information Cascades on Arbitrary Topologies
Languages of Profinite Words and the Limitedness Problem
Reachability in Stochastic Timed Games
Immunity (Extended Abstract)
Two Party Distribution Testing: Communication and Security
Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi
Testing Linear-Invariant Function Isomorphism
The Complexity of Decision Problems for Finite-Turn Multicounter Machines
Variable-Length Maximal Codes
Minimal Classical Logic and Control Operators
On the Complexity of Higher Order Abstract Voronoi Diagrams
Broadcast from Minicast Secure Against General Adversaries
Different Types of Arrow Between Logical Frameworks
Incremental Approximate Single-Source Shortest Paths with Predictions
Uniform Complexity and Digital Signatures
Quantifying Information Leakage in Process Calculi
Labelled Reductions, Runtime Errors and Operational Subsumption
Computing Tree Decompositions with Small Independence Number
Design Is as Easy as Optimization
Panic Mode without Panic
On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs
A Visual Modeling Technique for Controlling Graph Transformation
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss
The Computational Complexity of the Role Assignment Problem
On the Probe Complexity of Local Computation Algorithms
An Algebraic Characterization of Testable Boolean CSPs
Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
Gossiping with Bounded Size Messages in ad hoc Radio Networks
An Optimal-Time RLBWT Construction in BWT-Runs Bounded Space
Term Matching on Parallel Computers
Faster Algorithms for All Pairs Non-Decreasing Paths Problem
Repeated Synchronous Snapshots and Their Implementation in CSP (Extended Abstract)
In-Range Farthest Point Queries and Related Problem in High Dimensions
Implicit Definability and Infinitary Logic in Finite Model Theory
On-Line Graph Algorithms with SPQR-Trees
On the Power of Tree-Walking Automata
Communication Gap for Finite Memory Devices
Explicit Substitutions for Constructive Necessity
A New Holant Dichotomy Inspired by Quantum Computation
On Variants of File Caching
Supercritical Space-Width Trade-Offs for Resolution
Perpetuality for Full and Safe Composition (in a Constructive Setting)
Haystack Hunting Hints and Locker Room Communication
Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic
Embedding Bounded Bandwidth Graphs into l 1
Dynamic Programming for Graphs on Surfaces
The Theory of Concatenation over Finite Models
The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
The Communication Complexity of Set Intersection Under Product Distributions
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities
On the Cut-Query Complexity of Approximating Max-Cut
Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds
Stable Hypergraph Matching in Unimodular Hypergraphs
The Algebraic Equivalent of AFL Theory
Mediated Population Protocols
Decision Problems of Tree Transducers with Origin
Sur les mots sans carré définis par un morphisme
Bisimulation Proof Methods for Mobile Ambients
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II
Characterizations of the LL(k) Property
Two P-Complete Problems in the Theory of the Reals
Introduction: Approximation and Randomized Algorithms in Communication Networks
Coalgebraic Announcement Logics
On the Equivalence Problem for Binary DOL Systems
An Algebra-Based Method to Associate Rewards with EMPA Terms
Self-Modifying Nets, a Natural Extension of Petri Nets
Computational Complexity of an Optical Disk Interface (Extended Abstract)
Polylogarithmic Approximations for Robust s-t Path
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
Noisy Turing Machines
Tradeoffs for Language Recognition on Parallel Computing Models
Shortest Two Disjoint Paths in Polynomial Time
Rate-Based Transition Systems for Stochastic Process Calculi
A propos du relation rationelles fonctionnelles
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling
Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians
Algebraic Characterization of the Finite Power Property
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
Maximum Edge-Disjoint Paths in k-Sums of Graphs
A Characterization of the Existence of Energies for Neural Networks
Undecidable Verification Problems for Programs with Unreliable Channels
Sublinear-Time Approximation for Clustering Via Random Sampling
Maintaining Perfect Matchings at Low Cost
The Skolem Landscape (Invited Talk)
Domains for Denotational Semantics
An Estimation of the Set of States of the Minimal LR(0)-Acceptor
Visibly Pushdown Transducers
Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting
Introduction: International Workshop on Process Algebra and Performance Modelling
Algebraic Specification of Exception Handling and Error Recovery by Means of Declarations and Equations
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)
Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
Precedence-Constrained Scheduling of Malleable Jobs with Preemption
Approximating Minimum Cuts under Insertions
Branching Bisimilarity Checking for PRS
Testable Bounded Degree Graph Properties Are Random Order Streamable
Dynamic Interpolation Search
On Problems Equivalent to (min, +)-Convolution
Some Effective Results About Linear Recursive Sequences
Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties
Efficient Testing of Hypergraphs
An Eilenberg Theorem for Infinity-Languages
An FPTAS for Agreeably Weighted Variance on a Single Machine
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
3.415-Approximation for Coflow Scheduling via Iterated Rounding
Parameterized Inapproximability for Steiner Orientation by Gap Amplification
Space-Constrained Interval Selection
Nearly Optimal Visibility Representations of Plane Graphs
Effect Algebras, Presheaves, Non-locality and Contextuality
Connected k-Center and k-Diameter Clustering
A Kleene Theorem for Nominal Automata
Introduction: Graph Transformation and Visual Modeling Techniques
The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems
Understanding the Moments of Tabulation Hashing via Chaoses
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
A Parametric Approach to Localities
Quantum Query Complexity with Matrix-Vector Products
Functions as Processes
High-Probability List-Recovery, and Applications to Heavy Hitters
Remarques sur la structure des schémas de programmes
Scalable Secure Storage when Half the System Is Faulty
Restricted Max-Min Allocation: Approximation and Integrality Gap
Polynomial Closure of Group Languages and Open Sets of the Hall Topology
Bipartite Perfect Matching in Pseudo-Deterministic NC
Plane Spanners of Maximum Degree Six
Parameterized Complexity of Bandwidth on Trees
The Power of Recourse for Online MST and TSP
Discrete Random Variables over Domains
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs
The I/O Complexity of Sorting and Related Problems (Extended Abstract)
A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties
Fréchet Distance for Uncertain Curves
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Saarbrücken, Germany (Virtual Conference), July 8-11, 2020
Improved Black-Box Constructions of Composable Secure Computation
Network Investment Games with Wardrop Followers
First-Order Interpretations of Bounded Expansion Classes
On the Transformation Capability of Feasible Mechanisms for Programmable Matter
Oracle-Augmented Prophet Inequalities
On the Inapproximability of Vertex Cover on k -Partite k -Uniform Hypergraphs
Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
Set Cover Revisited: Hypergraph Cover with Hard Capacities
Superhighness and Strong Jump Traceability
Rational Transformations of Formal Power Series
Invertibility of Linear Finite Automata Over a Ring
Determining Majority in Networks with Local Interactions and Very Small Local Memory
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks
The Optimal Alphabetic Tree Problem Revisited
Domination When the Stars Are Out
Approximate Guarding of Monotone and Rectilinear Polygons
Hierarchical Planary Testing Algorithms
A Complexity Approach to Tree Algebras: the Bounded Case
A Sparse Table Implementation of Priority Queues
Splitting-Off in Hypergraphs
Composition of Stochastic Transition Systems Based on Spans and Couplings
Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
On the Complexity of Verifying Regular Properties on Flat Counter Systems,
Fault Tolerant Max-Cut
On Polynomial Recursive Sequences
On the Bivariate Function Minimization Problem And Its Applications to Motion Planning
On the Generation of Cryptographically Strong Pseudo-Random Sequences
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
Efficient Splitting of Necklaces
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, July 11-15, 2016
Solution Discovery via Reconfiguration for Problems in P
Multiparty Proximity Testing with Dishonest Majority from Equality Testing
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
A Calculus of Coroutines
Linear-Time List Recovery of High-Rate Expander Codes
Online Graph Exploration: New Results on Old and New Algorithms
Counting Subgraphs via Homomorphisms
Approximating the Diameter of Planar Graphs in Near Linear Time
A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph
Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata
Balanced Allocations: A Simple Proof for the Heavily Loaded Case
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
Parallel Self-Testing of EPR Pairs Under Computational Assumptions
Near-Optimal Closeness Testing of Discrete Histogram Distributions
Improved Approximation for Longest Common Subsequence over Small Alphabets
Reachability-Time Games on Timed Automata
Proportionally Fair Clustering Revisited
Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization
On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n)
Distance Oracles for Time-Dependent Networks
Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29 - August 2, 1974, Proceedings
Space-Efficient Error Reduction for Unitary Quantum Computations
Multiterminal Network Flow and Connectivity in Unsymmetrical Networks
The Complexity of Rational Synthesis
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets
The Cooperative Game Theory Foundations of Network Bargaining Games
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
Introduction: Workshop on Boolean Functions and Applications
On Intersection Problems for Polynomially Generated Sets
Non-Clairvoyant Precedence Constrained Scheduling
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time
Semilinear Program Feasibility
Truthful Unification Framework for Packing Integer Programs with Choices
Computational Characterization of Surface Entropies for ℤ² Subshifts of Finite Type
Influential Nodes in a Diffusion Model for Social Networks
Equilibrium Computation, Deep Learning, and Multi-Agent Reinforcement Learning (Invited Talk)
Competitive Auctions for Markets with Positive Externalities
Formal Methods and Component Interaction 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12, 2002
Semi-Groups Acting on Context-Free Graphs
Deciding Twin-Width at Most 4 Is NP-Complete
A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
Improved Scheduling Algorithms for Minsum Criteria
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs
The Black-Box Complexity of Nearest Neighbor Search
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
Separating Without Any Ambiguity
Third Workshop on Natural Language and Computer Science, NLCS@ICALP/LICS 2015, Kyoto, Japan, 2015
Fast Gossiping by Short Messages
Complexity Classes Without Machines: On Complete Languages for UP
Integrating Two Towers and GreatSPN
The Definition of a Temporal Clock Operator
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time
Almost Sure Productivity
Game Semantics: Achievements and Prospects
Maintaining Spanning Trees of Small Diameter
On Parallelizing Graph-Partitioning Heuristics
Orthogonal Extensions in Structural Operational Semantics
The Manifold Joys of Sampling (Invited Talk)
Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!
A Competitive Algorithm for the General 2-Server Problem
Sur les Series Rationnelles en Variables Non Commutatives
The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs
Identifying Approximate Minimizers Under Stochastic Uncertainity
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus
The Structure of Minimum Vertex Cuts
The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters
Quantum Speedup for Sampling Random Spanning Trees
On the Fine-Grained Complexity of One-Dimensional Dynamic Programming
Improved Fault Tolerance and Secure Computation on Sparse Networks
Arbres et Hierarchies de Concatenation
Min-wise Independent Permutations: Theory and Practice
Algorithms for Planar Geometric Models
Affine Systems of Equations and Counting Infinitary Logic
Exponential Lower Bounds via Exponential Sums
Spectrally Robust Graph Isomorphism
Deterministic k-Median Clustering in Near-Optimal Time
Datalog-Expressibility for Monadic and Guarded Second-Order Logic
Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract)
Spanning Trees With Edge Conflicts and Wireless Connectivity
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins
Modelchecking of CTL Formulae under Liveness Assumptions
On The Computational Power of Probabilistic and Faulty Neural Networks
Posets, Boolean Representations and Quick Path Searching
Decay of Correlation for Edge Colorings When q > 3Δ
A Sublogarithmic Approximation for Highway and Tollbooth Pricing
Content Search through Comparisons
On the Observational Semantics of Fair Parallelism
45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, July 9-13, 2018
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
The Support of Open Versus Closed Random Walks
On Quadratic Programming with a Ratio Objective
On Homomorphism Indistinguishability and Hypertree Depth
States Can Sometimes Do More Than Stack Symbols in PDA's
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
Complexity of the Cover Polynomial
Constructive Linear Time Algorithms for Branchwidth
Quantum Complexity of Testing Group Commutativity
Algorithmic Aspects of Bandwidth Trading
A Concrete Approach to Abstract Recursion Definitions
On the Extension Complexity of Combinatorial Polytopes
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
Automates et bascules
Exact Asymptotics of Divide-and-Conquer Recurrences
Reasoning about Idealized ALGOL Using Regular Languages
Reducing Stochastic Games to Semidefinite Programming
Lower Bounds for Oblivious Subspace Embeddings
Une famille de congruences de Thue pour lesquelles le problème de l'équivalence est décidable. Application á l'équivalence des grammaires séparées
From Chaotic Iteration to Constraint Propagation
Randomized Incremental Construction of Delaunay and Voronoi Diagrams
Even Faster Algorithm for the Chamfer Distance
Eliminating Blind Alleys from Backtrack Programs
Imposed-Functional Dependencies Inducing Horizontal Decompositions
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,
Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary
Counting Permutation Patterns with Multidimensional Trees
Computational Geometry for the Gourmet: Old Fare and New Dishes
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds
Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity
Testing Equivalence of Polynomials under Shifts
Resolving SINR Queries in a Dynamic Setting
Saving Critical Nodes with Firefighters is FPT
Streaming Edge Coloring with Asymptotically Optimal Colors
The Converse of the Real Orthogonal Holant Theorem
Testing Spreading Behavior in Networks with Arbitrary Topologies
The Norms of Graph Spanners
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence
Proprietes syntactiques du produit non ambigu
Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic
Langages sans Etiquettes et Transformations de Programmes
Approximation Results for Kinetic Variants of TSP
Testability and Local Certification of Monotone Properties in Minor-Closed Classes
Edge Disjoint Paths in Moderately Connected Graphs
Searching a Fixed Graph
Subduing Self-Application
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Linear-Time Kernelization for Feedback Vertex Set
Revisiting Priority k-Center: Fairness and Outliers
Cycle Detection and Correction
On Planar Boolean CSP
Efficient Pebbling for List Traversal Synopses
The LEDA Platform of Combinatorial and Geometric Computing
Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract)
Projecting Games on Hypercoherences
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms
Improvements in Quantum SDP-Solving with Applications
Sur l'application du theoreme de Suschkewitsch a l'etude des codes rationnets complets
Handling Infinitely Branching WSTS
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games
Distributed Probabilistic Polling and Applications to Proportionate Agreement
On the Computational Power of Discrete Hopfield Nets
New Upper Bounds for MaxSat
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages
Recursive Concurrent Stochastic Games
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth
Asynchronous Majority Dynamics in Preferential Attachment Trees
House Markets with Matroid and Knapsack Constraints
Further Schemes for Combining Matrix Algorithms
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
On Deciding if Deterministic Rabin Language Is in Büchi Class
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization
Maximum Matchings and Popularity
Probabilistic Bidding Gives Optimal Distributed Resource Allocation
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders
The SPQR-Tree Data Structure in Graph Drawing
Scheduling Lower Bounds via AND Subset Sum
Normalization Phenomena in Asynchronous Networks
Placement Inference for a Client-Server Calculus
The Contextsensitivity Bounds of Contextsensitive Grammars and Languages
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
Improved Approximation for the Directed Spanner Problem
On Test Sets and the Ehrenfeucht Conjecture
On Simple Goedel Numberings and Translations
Saturation-Based Theorem Proving (Abstract)
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
Short PCPs with Projection Queries
Reasoning with Time and Chance (Extended Abstract)
Dispersing Hash Functions
The Generative Power of Two-Level Grammars
Brief Announcement: Erasure-Resilience Versus Tolerance to Errors
On Complexity of Grammars Related to the Safety Problem
Parameterized Safety Verification of Round-Based Shared-Memory Systems
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
Closed Freyd- and kappa-categories
Facility Location in Sublinear Time
The Relevance of Proof-Irrelevance
Reasoning about Programs by Exploiting the Environment
Multiparty Communication Complexity of Collision-Finding and Cutting Planes Proofs of Concise Pigeonhole Principles
The Complexity of Promise SAT on Non-Boolean Domains
Verification of Parameterized Systems, VEPAS 2001, Satellite Workshop of ICALP 2001, Crete, Greece, July 13, 2001
Semantics of Interference Control
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
New algorithms for Steiner tree reoptimization
An Algebraic Geometric Approach to Nivat's Conjecture
Network Games with Atomic Players
An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs
Constructing Exponential-Size Deterministic Zielonka Automata
Guessing Efficiently for Constrained Subspace Approximation
An Explicit Formula for the Free Exponential Modality of Linear Logic
Mehrdeutigkeiten Kontextfreier Grammatiken
Breaking the All Subsets Barrier for Min k-Cut
All-Pairs Shortest Paths Computation in the BSP Model
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws