yusuke1997/dblp-id-title huggingface dataset:
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
Sparse Polynomial Interpolation in Nonstandard Bases
Parallel Depth-First Search in General Directed Graphs
Low-Degree Spanning Trees of Small Weight
Approximate Graph Coloring and the Crystal with a Hollow Shadow
When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
Asynchronous Fault-Tolerant Total Ordering Algorithms
With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets
A New Approach to Formal Language Theory by Kolmogorov Complexity
Ranking and Unranking of 2-3 Trees
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
Santa Claus Schedules Jobs on Unrelated Machines
On Tally Relativizations of BP-Complexity Classes
Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments
Rumor Spreading with No Dependence on Conductance
Combination Can Be Hard: Approximability of the Unique Coverage Problem
Nondeterminism Within P
Metric Embedding via Shortest Path Decompositions
Minimizing Co-location Potential of Moving Entities
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
An Analysis of Several Heuristics for the Traveling Salesman Problem
Improved Approximation Algorithms for Broadcast Scheduling
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
New and Improved Constructions of Nonmalleable Cryptographic Protocols
Bounds for Multifit Scheduling on Uniform Processors
New Approximation Techniques for Some Linear Ordering Problems
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
Zero-Knowledge Proofs from Secure Multiparty Computation
Ratio Estimators are Maximum-Likelihood Estimators for Non-Context-Free Grammars
An Approximate L1-Difference Algorithm for Massive Data Streams
Fast Pattern Matching in Strings
The Complete Convergence of First Fit Decreasing
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
Average-Case Lower Bounds for Noisy Boolean Decision Trees
Distributed Approximate Matching
Small-Bias Probability Spaces: Efficient Constructions and Applications
Zero-Knowledge against Quantum Attacks
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
Binary Space Partitions for Fat Rectangles
The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
On Sets Truth-Table Reducible to Sparse Sets
Testing versus Estimation of Graph Properties
Partitioning Planar Graphs
Two Spectra of Self-Organizing Sequential Search Algorithms
Linear Probing with Constant Independence
The Forgetron: A Kernel-Based Perceptron on a Budget
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
Nearly Work-Efficient Parallel Algorithm for Digraph Reachability
Physical Limits of Heat-Bath Algorithmic Cooling
Hardness of Approximation for Vertex-Connectivity Network Design Problems
An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
Robust Plane Sweep for Intersecting Segments
Safe Weak Minimization Revisited
On the Semantics of "Data Type"
On Approximations and Incidence in Cylindrical Algebraic Decompositions
A Simple Algorithm for Mal'tsev Constraints
On the Expected Value of a Random Assignment Problem
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications
Approximating the Permanent
Efficient Calculation of Expected Miss Ratios in the Independent Reference Model
Smoothing the Gap Between NP and ER
Optimal External Memory Interval Management
Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
Ranking the Best Binary Trees
Expectations of Functions of Sequences over Finite Alphabets with Given Transition Probabilities by Methods Independent of Sequence Length
OPT Versus LOAD in Dynamic Storage Allocation
Distributed Algorithms for Unidirectional Networks
Lower Bounds on the Complexity of Some Optimal Data Structures
An Algebraic Theory of Complexity for Discrete Optimization
Self-Improving Algorithms
Strong Direct Product Theorems for Quantum Communication and Query Complexity
Approximating Shortest Paths on a Nonconvex Polyhedron
Design and Analysis of a Data Structure for Representing Sorted Lists
A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
Testing Linear-Invariant Properties
Stabilization of Quantum Computations by Symmetrization
(2+ε)-Sat Is NP-hard
Algorithms for Boolean Function Query Properties
A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases
Submodularity of Influence in Social Networks: From Local to Global
A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold
Minimum Variance Huffman Codes
Wait-Free Consensus Using Asynchronous Hardware
The Searchlight Scheduling Problem
Minimum s-t Cut of a Planar Undirected Network in O(n log 2 (n)) Time
Traversing Combinatorial 0/1-Polytopes via Optimization
A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
Simple Gödel Numberings, Isomorphisms, and Programming Properties
Erratum: Genetic Algorithms and the Optimal Allocation of Trials
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph
Equilibria in Online Games
Geometric Problems with Application to Hashing
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
An Optimal Simulation of Counter Machines: The ACM Case
On Proving Limiting Completeness
Simulating Threshold Circuits by Majority Circuits
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
A Graph-Theoretic Game and Its Application to the k-Server Problem
Size-Depth Tradeoffs for Algebraic Formulas
Special Section on the Forty-Sixth Annual ACM Symposium on Theory of Computing (STOC 2014)
Linear-Time Test for Small Face Covers in Any Fixed Surface
Shift-Register Synthesis (Modulo m)
Localized Client-Server Load Balancing without Global Information
Better Algorithms for Unfair Metrical Task Systems and Applications
Utilitarian Mechanism Design for Multiobjective Optimization
Computing k-Atomicity in Polynomial Time
Edge-Disjoint Paths in Planar Graphs with Constant Congestion
The Complexity of Finding Cycles in Periodic Functions
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives
Perfect-Information Leader Election with Optimal Resilience
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
On Min Sum Vertex Cover and Generalized Min Sum Set Cover
Fault-Tolerant Scheduling
Privacy Amplification and Nonmalleable Extractors Via Character Sums
Constant Depth Formula and Partial Function Versions of MCSP Are Hard
The Fast m-Transform: A Fast Computation of Cross-Correlations with Binary m-Sequences
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
On the Evaluation of Powers and Monomials
Key Comparison Optimal 2-3 Trees with Maximum Utilization
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
A 1.6 Approximation Algorithm for Routing Multiterminal Nets
Plottable Real Number Functions and the Computable Graph Theorem
Any AND-OR Formula of Size N Can Be Evaluated in Time N 1/2+o(1) on a Quantum Computer
Parallel Algorithms for Depth-First Searches I. Planar Graphs
Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013)
Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem
On the Efficient Generation of Language Instances
On the Computational Power of Demand Queries
Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
Multiple-Source Shortest Paths in Embedded Graphs
Scheduling the Open Shop to Minimize Mean Flow Time
The complexity of Languages Generated by Attribute Grammars
Stable Sorting and Merging with Optimal Space and Time Bounds
Hidden Symmetry Subgroup Problems
Parallelism Always Helps
Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
Generators of $H_1(\Gamma_{h}, \mathbbZ)$ for Triangulated Surfaces: Construction and Classification
The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
Proximity Search for Maximal Subgraph Enumeration
On Binary Searching with Nonuniform Costs
The Ranks of m * n * (mn-2) Tensors
Vector Iteration in Pointed Iterative Theories
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces
Set Merging Algorithms
Selecting Heavily Covered Points
Generating Linear Extensions Fast
Good and Bad Radii of Convex Polygons
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems
Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4-Flow
Spirality and Optimal Orthogonal Drawings
On a Greedy Heuristic for Complete Matching
Dynamic 2-Connectivity with Backtracking
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
On Algorithms for Enumerating All Circuits of a Graph
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing
Impossibility Results and Lower Bounds for Consensus under Link Failures
Preserving Functional Dependencies
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
Parallel Processor Scheduling with Limited Number of Preemptions
Very Fast Parallel Polynomial Arithmetic
Resource Bounds for Self-Stabilizing Message-Driven Protocols
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
On the Complexity of Canonical Labeling of Strongly Regular Graphs
Probabilistic Analysis of Disjoint Set Union Algorithms
A Graph-Theoretic Characterization of the PV_chunk Class of Synchronizing Primitives
Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
Optimal 2, 3-Trees
Optimum Algorithms for a Model of Direct Chaining
A Note on Sparse Complete Sets
Temporal Reasoning about Two Concurrent Sequences of Events
A New Method for Computing Page-Fault Rates
On the Average Size of the Intersection of Binary Trees
Spectral Methods from Tensor Networks
Generalized String Matching
The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
Topological Lower Bounds on Algebraic Random Access Machines
Time and Space Lower Bounds for Nonblocking Implementations
Optimal Covering Tours with Turn Costs
Are Bitvectors Optimal?
Gaussian Cooling and O *(n 3) Algorithms for Volume and Gaussian Volume
Worst-Case and Probabilistic Analysis of a Geometric Location Problem
Recursive Graphs, Recursive Labelings and Shortest Paths
Shooting Permanent Rays among Disjoint Polygons in the Plane
Whole Genome Duplications and Contracted Breakpoint Graphs
A Polynomial Time Algorithm for Computing an Arrow-Debreu Market Equilibrium for Linear Utilities
A Complete Classification of the Complexity of Propositional Abduction
Branching-Time Model Checking of One-Counter Processes and Timed Automata
Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
Linear Languages and the Intersection Closures of Classes of Languages
On ET0L Systems with Finite Tree-Rank
Tighter Bounds for LPT Scheduling on Uniform Processors
Perceptron, Winnow, and PAC Learning
Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
Unifying the Landscape of Cell-Probe Lower Bounds
Nondeterministic Space is Closed Under Complementation
Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
A Structure Theorem for Exponential and Primitive Functions
Arithmetic Circuits: A Chasm at Depth 3
Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
Positive Relativizations of Complexity Classes
An Amortized Analysis of Insertions into AVL-Trees
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing
Computing the Degree of Determinants Via Combinatorial Relaxation
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
Narrow Proofs May Be Spacious: Separating Space and Width in Resolution
Protecting Circuits from Computationally Bounded and Noisy Leakage
Fast Management of Permutation Groups I
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications
Algorithms for Splicing Systems
Continuous Data Types
On Some Distance Problems in Fixed Orientations
Logarithmic Lower Bounds in the Cell-Probe Model
An Algorithm for Finding K Minimum Spanning Trees
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms
On Clustering to Minimize the Sum of Radii
Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints
Evaluating Polynomials at Fixed Sets of Points
Fast Generalized DFTs for All Finite Groups
Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2 n )
Reducibility and Completeness in Private Computations
Symbolic Program Analysis in Almost-Linear Time
Conditional Hardness for Approximate Coloring
Linear Time and Memory-Efficient Computation
An Omega( D log ( N/D )) Lower Bound for Broadcast in Radio Networks
Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
On Restricting the Size of Oracles Compared with Restricting Access to Oracles
Relativizations of Unambiguous and Random Polynomial Time Classes
Toward Better Depth Lower Bounds: A KRW-like Theorem For Strong Composition
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
Communication-Efficient Parallel Sorting
Enumeration of the Elementary Circuits of a Directed Graph
Efficient Point Location in a Convex Spatial Cell-Complex
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
Partitioning Space for Range Queries
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation
Generalized p-adic Constructions
Complexity of Network Reliability and Optimal Resource Placement Problems
Finding the Cyclic Index of an Irreducible, Nonnegative Matrix
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
A Scheme for Fast Parallel Communication
Bounds on Universal Sequences
Analysis of a Feedback Scheduler
A Note on the Complexity of General D0L Membership
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
Semialgebraic Range Reporting and Emptiness Searching with Applications
On the Complexity of Finding a Minimum Cycle Cover of a Graph
On Relaxed Squashed Embedding of Graphs into a Hypercube
Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs
On the Optimality of Linear Merge
An Algebraic Approach to Nonmalleability
The Monotone Complexity of k-Clique on Random Graphs
On Monotonicity Testing and Boolean Isoperimetric-type Theorems
Online Scheduling of Precedence Constrained Tasks
A Note on Poset Geometries
On the Complexity of Searching a Set of Vectors
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
Noise Tolerance of Expanders and Sublinear Expansion Reconstruction
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean \(\boldsymbol{k}\)- means
Approximation Algorithms for the Set Covering and Vertex Cover Problems
Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space
Hidden Translation and Translating Coset in Quantum Computing
n-Rational Algebras I. Basic Properties and Free Algebras
Symmetries in Data Graphs
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
Tree Traversal Related Algorithms for Generating Integer Partitions
One-Way Functions and (Im)perfect Obfuscation
Why Extension-Based Proofs Fail
Unique Games with Entangled Provers Are Easy
Lower Bounds for External Memory Integer Sorting via Network Coding
Deterministic Simulations of PRAMs on Bounded Degree Networks
The Power of Sherali-Adams Relaxations for General-Valued CSPs
Buffer Overflow Management in QoS Switches
The Discrete Logarithm Hides O(log n) Bits
Algorithms for RH Mapping: New Ideas and Improved Analysis
The Minimum All-Ones Problem for Trees
VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
On Structure Preserving Reductions
Faster Scaling Algorithms for Network Problems
Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit
Parallel Tree Contraction, Part 2: Further Applications
Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices
A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions
Multiple Communication in Multihop Radio Networks
Searching Unindexed and Nonuniformly Generated Files in log log N Time
Learning in the Presence of Malicious Errors
(t, k)-Diagnosability of Multiprocessor Systems with Applications to Grids and Tori
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
Asymptotic Conditional Probabilities: The Unary Case
Graph Distances in the Data-Stream Model
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
An Analysis of Backtracking with Search Rearrangement
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
On the Distortion of Locality Sensitive Hashing
Fault-Tolerant Computation in the Full Information Model
Characterizations of 1-Way Quantum Finite Automata
Optimal Parallel 5-Colouring of Planar Graphs
Randomly Supported Independence and Resistance
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
Efficient Database Updates with Independent Schemes
Fault Tolerance in Networks of Bounded Degree
Isomorph Rejection and a Theorem of De Bruijn
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
How to Meet Asynchronously at Polynomial Cost
Data Structures for Retrieval on Square Grids
Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads
Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
On the Structure of Logspace Probabilistic Complexity Classes
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
Decomposition Theorems for Various Kinds of Languages Parallel in Nature
Optimal Retrieval Algorithms for Small Region Queries
SeparatingAC 0 from Depth-2 Majority Circuits
An Optimal Self-Stabilizing Firing Squad
Parallel Matrix and Graph Algorithms
Special Section on the Fifty-Sixth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015)
Testing Shared Memories
A Technique for Speeding up LR(k) Parsers
Homology Flows, Cohomology Cuts
On the Expected Performance of Path Compression Algorithms
On Scheduling Chains of Jobs on One Processor with Limited Preemption
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
The Power of Linear Programming for General-Valued CSPs
The Approximability of Three-valued MAX CSP
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
Planar Earthmover Is Not in L 1
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
On the Optimum Checkpoint Selection Problem
On Primality Tests
Amortized Analysis of Algorithms for Set Union with Backtracking
On Search Times for Early-Insertion Coalesced Hashing
Some Observations about the Randomness of Hard Problems
Fast Exponentiation Using Data Compression
Lazy Local Search Meets Machine Scheduling
On the Polyhedral Decision Problem
Nonblocking Multirate Networks
Bit-Probe Lower Bounds for Succinct Data Structures
Approximating the Minimum Equivalent Digraph
Oracles for Deterministic versus Alternating Classes
Special Section on the Fortieth Annual ACM Symposium On Theory Of Computing (STOC 2008)
Optimal Polyphase Sorting
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
Improved Approximation Algorithms for Minimum Weight Vertex Separators
Reversal Complexity Classes for Alternating Turing Machines
Alphabet-Independent Two-Dimensional Witness Computation
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
Computing the Additive Complexity of Algebraic Circuits with Root Extracting
Interactive Computation of Homology of Finite Partially Ordered Sets
Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
A New Algorithm for Minimum Cost Binary Trees
Erratum: Weighted Leaf AVL-Trees
Genetic Algorithms and the Optimal Allocation of Trials
On the Boundary Complexity of the Union of Fat Triangles
Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
On the Structure of NP_C
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
A Full Characterization of Quantum Advice
The Relation Between Computational and Denotational Properties for Scott's D infty -Models of the Lambda-Calculus
Generalization of Voronoi Diagrams in the Plane
An O(n log² h) Time Algorithm for the Three-Dimensional Convex Hull Problem
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
Binary Space Partitions of Orthogonal Subdivisions
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier
Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization
An Elementary Solution of the Queuing System G/G/1
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
Fast Universalization of Investment Strategies
Multiembedding of Metric Spaces
Minimizing Garbage Collection as a Function of Region Size
An O(logn loglogn) Space Algorithm for Undirected st-Connectivity
Watermarking Cryptographic Capabilities
An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
On V-Optimal Trees
Algorithms for Packing Squares: A Probabilistic Analysis
Finding Minimum Spanning Trees
Some Results on the Representative Instance in Relational Databases