yusuke1997/dblp-id-title huggingface dataset:
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
Computational Modeling for Genetic Splicing Systems
An O ( n log n ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
Exact Algorithms for Treewidth and Minimum Fill-In
Recursive Star-Tree Parallel Data Structure
Optimization Problems on Graphs with Independent Random Edge Weights
An Efficient Parallel Biconnectivity Algorithm
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard
Correlation Testing for Affine Invariant Properties on 픽 p n in the High Error Regime
Special Section on the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009)
Homeomorphism of 2-Complexes is Graph Isomorphism Complete
Learning Binary Relations and Total Orders
The Hardest Context-Free Language
Information Transfer under Different Sets of Protocols
Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs
On a Linear Program for Minimum-Weight Triangulation
An NC Algorithm for Minimum Cuts
The Complexity of Very Simple Boolean Formulas with Applications
Optimal Bin Covering with Items of Random Size
Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits
The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
Bottlenecks and Edge Connectivity in Unsymmetrical Networks
Circuit Lower Bounds for Merlin--Arthur Classes
Self-Testing without the Generator Bottleneck
The Swapping Problem on a Line
Optimal Dynamic Embedding of Trees into Arrays
Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
Analysis of Backoff Protocols for Multiple Access Channels
Short Proofs for the Determinant Identities
The NP-Completeness of Some Edge-Partition Problems
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
Some Results on Elusive Graph Properties
Introduction to Special Section on Probabilistic Proof Systems
On the Complexity of Partial Order Productions
A Natural Structure Theorem for Complex Fields
Lower Bounds for Randomized Consensus under a Weak Adversary
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
Smooth Heaps and a Dual View of Self-Adjusting Data Structures
How to Generate Factored Random Numbers
Tree Search on an Atomic Model for Message Passing
Shape Fitting with Outliers
On Comparability and Permutation Graphs
Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
Bounds for List Schedules on Uniform Processors
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
Matrix Searching with the Shortest-Path Metric
The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance
On the Boundedness of Constant-Time-Maintainable Database Schemes
On the Exact Location of Steiner Points in General Dimension
Searching for a Mobile Intruder in a Polygonal Region
The Power of Oblivious Wireless Power
Algebraic Attacks against Random Local Functions and Their Countermeasures
A Constant Factor Approximation for the Single Sink Edge Installation Problem
Testing Graph Isomorphism
Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
Contention Resolution in Hashing Based Shared Memory Simulations
Quantum Computability
Circumference of Graphs with Bounded Degree
Interpolating Arithmetic Read-Once Formulas in Parallel
Toward Derandomizing Markov Chain Monte Carlo
An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon
Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative?
Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity
Fast Access to Distributed Atomic Memory
Fixed-Parameter Tractability, Definability, and Model-Checking
Entangled Games Are Hard to Approximate
Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines
The Spatial Complexity of Oblivious k-Probe Hash Functions
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
Time-Optimal Top-k Document Retrieval
On Maximizing Welfare When Utility Functions Are Subadditive
Early Detection of Message Forwarding Faults
Geometric Packing under Nonuniform Constraints
Local Randomness in Polynomial Random Number and Random Function Generators
Bounds for the Computational Power and Learning Complexity of Analog Neural Nets
Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
Incremental String Comparison
Natural Self-Reducible Sets
A Spectral Approach to Lower Bounds with Applications to Geometric Searching
Quantum Multiprover Interactive Proofs with Communicating Provers
Approximate Shortest Paths in Anisotropic Regions
Single Machine Job Sequencing with Precedence Constraints
New Direct-Product Testers and 2-Query PCPs
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
Evaluation of Arithmetic Expressions with Algebraic Identities
Gowers Uniformity, Influence of Variables, and PCPs
On the Correlation of Parity and Small-Depth Circuits
On the Selection of Test Data for Vector-Valued Recursive Subroutines
Optimal Search in Trees
Low-End Uniform Hardness versus Randomness Tradeoffs for AM
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
Online Conflict-Free Coloring for Intervals
Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius
A Family of Algorithms for Powering Sparse Polynomials
Coin-Flipping Games Immune Against Linear-Sized Coalitions
On the Complexity of Local Search for the Traveling Salesman Problem
On the Computational Complexity of Upward and Rectilinear Planarity Testing
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
Induced Subgraphs of Bounded Treewidth and the Container Method
Bounds on the Number of Examples Needed for Learning Functions
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors
Regular Languages are Testable with a Constant Number of Queries
Simple and Tight Device-Independent Security Proofs
Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees
Generating Trees and Other Combinatorial Objects Lexicographically
Random-Self-Reducibility of Complete Sets
Decomposing a Polygon into Simpler Components
Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane
Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
The Implication Problem for Functional and Inclusion Dependencies is Undecidable
Between O(nm) and O(n alpha )
Algebraic Algorithms for Fractional Linear Matroid Parity via Noncommutative Rank
An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough
Computing Sequences with Addition Chains
An Approximation Scheme for Finding Steiner Trees with Obstacles
A Space Lower Bound for Dynamic Approximate Membership Data Structures
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
How to Make Arbitrary Grammars Look Like Context-Free Grammars
Revisiting "Computation of Matrix Chain Products"
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
The Impact of Timing Knowledge on the Session Problem
Reaching and Distinguishing States of Distributed Systems
Stochastic Scheduling with Variable Profile and Precedence Constraints
Distribution-Free Property-Testing
Algorithms for Weighted Matching Generalizations II: f -factors and the Special Case of Shortest Paths
Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones
Combinatorial Walrasian Equilibrium
An O(N log N) Algorithm for a Class of Matching Problems
Minimum Bisection Is Fixed-Parameter Tractable
Expected Performance of m-Solution Backtracking
A Min-Max Theorem on Tournaments
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
Program Schemes with Pushdown Stores
Pareto Optimal Solutions for Smoothed Analysts
Flipping Persuasively in Constant Time
Deterministic Communication in Radio Networks
Simple Programs Realize Exactly Presberger Formulas
Power of Natural Semijoins
Observations on the Complexity of Generating Quasi-Gray Codes
On the Complexity of Bilinear Forms over Associative Algebras
Errata: On Optimal Processor Scheduling for Multiprogramming
A Shortest-Path Algorithm with Expected Time O(n 2 log n log* n)
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
Two Applications of Inductive Counting for Complementation Problems
A Semiring on Convex Polygons and Zero-Sum Cycle Problems
A Hidden-Line Algorithm for Hyperspace
The Polygon Exploration Problem
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
Constant Inapproximability for PPA
Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs
CNF Satisfiability Test by Counting and Polynomial Average Time
Clique Covering of Graphs IV. Algorithms
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\)
On the Bit-Complexity of Lempel-Ziv Compression
Embedding Trees in a Hypercube is NP-Complete
Total Ordering Problem
On-Line Planarity Testing
Fast Gossiping for the Hypercube
New Decidability Results Concerning Two-Way Counter Machines
Forrelation: A Problem That Optimally Separates Quantum from Classical Computing
Bounds for Multiprocessor Scheduling with Resource Constraints
Dividing a Graph into Triconnected Components
On Relativized Polynomial and Exponential Computations
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs
On Quiescent Reliable Communication
Deciding Parity Games in Quasi-polynomial Time
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
The Complexity of Boolean Holant Problems with Nonnegative Weights
Provably Difficult Combinatorial Games
Diffusive Influence Systems
Code Motion
A Design Theory for Solving the Anomalies Problem
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Applications of a Planar Separator Theorem
Tools for Template Dependencies
IP = PSPACE Using Error-Correcting Codes
Star Unfolding of a Polytope with Applications
NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
Optimal Placement for River Routing
Existence of Graphs with Three Spanning Trees and Given Degree Sequence
An O(log 2k) -Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem
Decision Problems for Multivalued Dependencies in Relational Databases
Sampling and Meshing a Surface with Guaranteed Topology and Geometry
On Frictional Mechanical Systems and Their Computational Power
Task Scheduling on a Multiprocessor System with Independent Memories
Optimizing Chain Queries in a Distributed Database System
Average-Case Performance of the Apriori Algorithm
Rounds vs. Communication Tradeoffs for Maximal Independent Sets
Approximating TSP on Metrics with Bounded Global Growth
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
A Minimum Distance Error-Correcting Parser for Context-Free Languages
Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
Models for Random Constraint Satisfaction Problems
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
Additive Guarantees for Degree-Bounded Directed Network Design
A Fast Parametric Maximum Flow Algorithm and Applications
Packing Cycles in Planar and Bounded-Genus Graphs
A Correct Preprocessing Algorithm for Boyer-Moore String-Searching
Monotone Bipartite Graph Properties are Evasive
Approximating Steiner Networks with Node-Weights
Short PCPs with Polylog Query Complexity
Voronoi Diagrams in L 1 (L infty ) Metrics with 2-Dimensional Storage Applications
An Analysis of Random d-Dimensional Quad Trees
Optimal Two-Stage Algorithms for Group Testing Problems
Querying Approximate Shortest Paths in Anisotropic Regions
Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter-Freudenthal-Kuhn Triangulations
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
Some Undecidability Results for Parallel Program Schemata
Optimal Merging of 3 Elements with n Elements
Polynomial Time Enumeration Reducibility
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
On the Existence of Extractable One-Way Functions
Covering Graphs by Simple Circuits
On Agnostic Learning of Parities, Monomials, and Halfspaces
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
Analysis of Henriksen's Algorithm for the Simulation Event Set
Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
n-Rational Algebras II. Varieties and Logic of Inequalities
Acceleration of Euclidean Algorithm and Rational Number Reconstruction
A Better Algorithm for Random k-SAT
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem
From Contention Resolution to Matroid Secretary and Back
\(\boldsymbol{\Pi_2^P}\) vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
Rectilinear Graphs and their Embeddings
An Optimal Simulation of Counter Machines
The Partial Fraction Expansion Problem and Its Inverse
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
Unbounded Searching Slgorithms
Equivalences Among Relational Expressions
A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
Minimum-Weight Spanning Tree Construction in O (log log n ) Communication Rounds
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
The Information-Theoretic Bound is Good for Merging
On the Selection of Test Data for Recursive Mathematical Subroutines
On Counting Lattice Points in Polyhedra
Improved Bounds on Nonblocking 3-Stage Clos Networks
On Learning Functions from Noise-Free and Noisy Samples via Occam's Razor
Matrix Rounding under the L p -Discrepancy Measure and Its Application to Digital Halftoning
Distributed Broadcast in Unknown Radio Networks
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
Scheduling File Transfers
A Complete Characterization of the Algebras of Minimal Bilinear Complexity
Nerves of Good Covers Are Algorithmically Unrecognizable
The Hough Transform has O(N) Complexity on N x N Mesh Connected Computers
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums
Prospects and Limitations of Automatic Assertion Generation for Loop Programs
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
Genericity, Randomness, and Polynomial-Time Approximations
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
Dynamic Maintenance of Maxima of 2-d Point Sets
On the Complexity of Verifying Consistency of XML Specifications
On the k Shortest Simple Paths Problem in Weighted Directed Graphs
Approximate Gomory-Hu Tree is Faster than \(\boldsymbol{n}\,\boldsymbol{-\, 1}\) Maximum Flows
An Optimal-Time Algorithm for Slope Selection
On Transforming Control Structures
Computational Algorithms for the Enumeration of Group Invariant Partitions
Function Matching
Finding the Vertex Connectivity of Graphs
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
Finding Dominators in Directed Graphs
Robot Navigation with Distance Queries
Popular Matchings
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations
A Note on the Complexity of a Simple Transportation Problem
Finite Moniods: From Word to Circuit Evaluation
Competitive On-Line Algorithms for Distributed Data Management
Translatability and Decidability Questions for Restricted Classes of Program Schemas
The Spectra of First-Order Sentences and Computational Complexity
How Hard Is It to Approximate the Best Nash Equilibrium?
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions
Online Edge Coloring via Tree Recurrences and Correlation Decay
Special Issue on Randomness and Complexity
Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
A Nontrivial Lower Bound for an NP Problem on Automata
Approximate Boyer-Moore String Matching
On the Power of Finite Automata with Both Nondeterministic and Probabilistic States
An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
Genetic Design of Drugs Without Side-Effects
On the Power of Real Turing Machines Over Binary Inputs
Jump PDA's and Hierarchies of Deterministic Context-Free Languages
The Complexity of Monadic Second-Order Unification
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
Trevisan's Extractor in the Presence of Quantum Side Information
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects
Superconcentrators
A Harmonic Algorithm for the 3D Strip Packing Problem
The Height and Size of Random Hash Trees and Random Pebbled Hash Trees
Faster Suffix Tree Construction with Missing Suffix Links
Approximating k-Median via Pseudo-Approximation
The Complexity of the Residual Node Connectedness Reliability Problem
Embedding of Grids into Optimal Hypercubes
A Stochastic Model of Fragmentation in Dynamic Storage Allocation
From Affine to Two-Source Extractors via Approximate Duality
Ranking and Unranking of AVL-Trees
One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size
The Load, Capacity, and Availability of Quorum Systems
Parallel Complexity of Numerically Accurate Linear System Solvers
Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network"
The Recognition of Series Parallel Digraphs
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
Ranking Algorithms: The Symmetries and Colorations of the n-Cube
Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
A Time-Randomness Trade-Off for Oblivious Routing
Common-Face Embeddings of Planar Graphs
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
The Reconstruction of Doubled Genomes
A Linear Time Algorithm for a 2 × n Transportation Problem
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
Minimum Spanning Trees in k-Dimensional Space
Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
Corrigendum: Metric Embedding via Shortest Path Decompositions
The Tape Complexity of Some Classes of Szilard Languages
An Efficient Algorithm for Partial Order Production
The Algorithmic Aspects of Uncrowded Hypergraphs
The Complexity of the A B C Problem
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
The Rational Index: A Complexity Measure for Languages
Internal Fragmentation in a Class of Buddy Systems
Termination Properties of Generalized Petri Nets
Tight Comparison Bounds on the Complexity of Parallel Sorting
On the Complexity of Covering Vertices by Faces in a Planar Graph
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
An Algebraic Model for Combinatorial Problems
Fast Sorting of Weyl Sequences Using Comparisons
Conditions for Optimality of the Huffman Algorithm
A New Lower Bound for the Set-Partitioning Problem
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
Scheduling Jobs with Temporal Distance Constraints
Efficient Ordering of Hash Tables
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k
Computationally Sound Proofs
Church-Rosser Thue Systems that Present Free Monoids
Some Preservation Properties of Normal Form Grammars
Decomposing Finite-Valued Transducers and Deciding Their Equivalence
A Deterministic Algorithm for Finding All Minimum k-Way Cuts
Analysis of Delays Caused by Local Synchronization
Some Remarks on p-Way Merging
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
Average-Case Lower Bounds for Searching
The Transitive Reduction of a Directed Graph
Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m
Fast Metric Embedding into the Hamming Cube
Corrigendum: Algorithmic Enumeration of Ideal Classes for Quaternion Orders
A Tight Space Bound for Consensus
Parallel Algorithms for Algebraic Problems
The Complexity of Decision Versus Search
A Layered Analysis of Consensus
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
Location of a Point in a Planar Subdivision and Its Applications
Fast Augmenting Paths by Random Sampling from Residual Graphs
The Two-Processor Scheduling Problem is in Random NC
Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover
Analysis of a Hybrid Algorithm for Packing Unequal Bins
Voronoi Diagram in the Laguerre Geometry and its Applications
Design of On-Line Algorithms Using Hitting Times
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
A Strip-Packing Algorithm with Absolute Performance Bound 2
Dynamic Subgraph Connectivity with Geometric Applications
On Proving Uniform Termination and Restricted Termination of Rewriting Systems
List-Decoding with Double Samplers
Node-Deletion Problems on Bipartite Graphs
Virtual Path Layouts in ATM Networks
The Round Complexity of Two-Party Random Selection
A Spectral Technique for Coloring Random 3-Colorable Graphs
Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
Complexity of Sub-Bus Mesh Computations
Pseudorandom Generators for Polynomial Threshold Functions
Tractability and Learnability Arising from Algebras with Few Subpowers
A Linear Algorithm for Topological Bandwidth in Degree-Three Trees
Algebraic Algorithms for Matching and Matroid Problems
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
Randomness and Recursive Enumerability