yusuke1997/dblp-id-title huggingface dataset:
Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model
Three-Dimensional Statistical Data Security Problems
Lower Bounds for Local Search by Quantum Arguments
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs
Erratum: Two Applications of Inductive Counting for Complementation Problems
Finding a Smallest Augmentation to Biconnect a Graph
Simple Construction for Multi-Terminal Network Flow Synthesis
Automatic Programming of Finite State Linear Programs
Computational Complexity of Iterative Processes
Approximate Local Search in Combinatorial Optimization
Fast Algorithms for Bipartite Network Flow
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
Squarish k - d Trees
Concurrency Control by Locking
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
Response Time of a Fixed-Head Disk to Transfers of Variable Length
Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices
Vertex Sparsification and Oblivious Reductions
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
Bounded Concurrent Time-Stamping
Analysis of Link Reversal Routing Algorithms
Accelerated Solution of Multivariate Polynomial Systems of Equations
Algorithmic Bayesian Persuasion
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates
Concurrent Nonmalleable Commitments
A Finite State Version of the Kraft--McMillan Theorem
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal
An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms
Solving a Problem in Eigenvalue Approximation with a Symbolic Algebra System
Maintaining Stream Statistics over Sliding Windows
Counterexamples for Directed and Node Capacitated Cut-Trees
Generalized Kraft's Inequality and Discrete k -Modal Search
Polynomial-Time Approximation Schemes for Facility Location on Planar Graphs
On Simple Gödel Numberings and Translations
Adiabatic Quantum State Generation
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
Computationally Related Problems
The Greedy Spanner Is Existentially Optimal
On the Computability of Continuous Maximum Entropy Distributions with Applications
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality
Analysis of Scanning Policies for Reducing Disk Seek Times
Robust Estimators in High-Dimensions Without the Computational Intractability
On the Space and Time Complexity of Functions Computable by Simple Programs
A Randomized Algorithm for Closest-Point Queries
Spanners for Directed Transmission Graphs
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
An Associative Block Design ABD(8, 5)
Satisfiability in MultiValued Circuits
Time-decaying Sketches for Robust Aggregation of Sensor Data
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold
Spectral Gap Amplification
A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
Alphabetic Minimax Trees
On Threshold Circuits and Polynomial Computation
Solving CSPs Using Weak Local Consistency
The Communication Complexity of Atomic Commitment and of Gossiping
Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape
A New Characterization of Type-2 Feasibility
Non-Malleable Codes from Additive Combinatorics
Two-Prover Protocols - Low Error at Affordable Rates
Dynamic Programming by Exchangeability
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits
On the Complexity of Composition and Generalized Composition of Power Series
Topology and Adjunction in Promise Constraint Satisfaction
The Cost of Derandomization: Computability or Competitiveness
On One-Way Cellular Arrays
Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization
A Chernoff Bound for Random Walks on Expander Graphs
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
The Profile Minimization Problem in Trees
Exponential Separation of Quantum and Classical One-Way Communication Complexity
Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs
A Best Possible Bound for the Weighted Path Length of Binary Search Trees
Toward a Topological Characterization of Asynchronous Complexity
On a Combinatorial Generation Problem of Knuth
Combinatorial Construction of Locally Testable Codes
On the Robustness of Functional Equations
The Least Weight Subsequence Problem
The Euclidean Algorithm and the Degree of the Gauss Map
Fast and Efficient Parallel Solution of Sparse Linear Systems
Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
On the Worst-Case Behavior of String-Searching Algorithms
Improved Bounds for the Online Scheduling Problem
On the Multiplicative Complexity of Modules Over Associative Algebras
Complexity Classification Transfer for CSPs via Algebraic Products
Near-Linear Time Construction of Sparse Neighborhood Covers
Variable Sized Bin Packing
A General Approach for Incremental Approximation and Hierarchical Clustering
Recursive Programs as Definitions in First Order Logic
On the Average-Case Complexity of Selecting the kth Best
Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique
A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs
Scheduling Independent Tasks on Uniform Processors
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
How to Schedule a Cascade in an Arbitrary Graph
Superlinear Advantage for Exact Quantum Algorithms
A Simple Algorithm for Global Data Flow Analysis Problems
A New Insight into the Coffman-Graham Algorithm
Some Polynomial and Integer Divisibility problems are NP-Hard
Dynamic Programming is Optimal for Nonserial Optimization Problems
On the Complexity of Nonconvex Covering
How to Compress Interactive Communication
Space Lower Bounds for Maze Threadability on Restricted Machines
Space Complexity in Propositional Calculus
Matroid Matching: The Power of Local Search
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems
On Bounded Database Schemes and Bounded Horn-Clause Programs
Selfish Traffic Allocation for Server Farms
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
The Risch Differential Equation Problem
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
Dominating Sets in Chordal Graphs
Partial Match Queries in Random Quadtrees
Maintenance of 2- and 3-Edge-Connected Components of Graphs II
A Graph Theoretic Approach to Statistical Data Security
Approximating Minimum Representations of Key Horn Functions
Equitable Cost Allocations via Primal--Dual-Type Algorithms
One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete
Private Approximation of Search Problems
An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone
The Complexity of Malign Measures
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Approximate Levels in Line Arrangements
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
Algebraic Properties for Selector Functions
Deadlock Prediction: Easy and Difficult Cases
Probe Order Backtracking
Relativized Polynomial Time Hierarchies Having Exactly K Levels
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
Scheduling Tasks with AND/OR Precedence Constraints
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
Toward Characterization of Perfect Elimination Digraphs
Optimizing Conjunctive Queries that Contain Untyped Variables
Broadcasting and Gossiping in de Bruijn Networks
A bound on the capacity of backoff and acknowledgment-based protocols
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
Sorting Short Keys in Circuits of Size ${o(n \log n)}$
Fast Matching Algorithms for Points on a Polygon
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
Equations Between Regular Terms and an Application to Process Logic
Testing Isomorphism of Lattices over CM-Orders
On Languages Accepted in Polynomial Time
Tighter Lower Bounds on the Exact Complexity of String Matching
Efficient Generation of Minimal Length Addition Chains
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
Observing Branching Structure through Probabilistic Contexts
The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability
Linear-Time Algorithms for Linear Programming in R 3 and Related Problems
Tight Pounds on Oblivious Chaining
Improved Parallel Polynomial Division
On Rearrangeability of Multirate Clos Networks
Optimal Allocation of Area for Single-Chip Computations
Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set
Communication Lower Bounds via Critical Block Sensitivity
The Computational Complexity of Immanants
Optimal On-Line Simulations of Tree Machines by Random Access Machines
Expressibility and Parallel Complexity
A Pumping Condition for Regular Sets
A Powerful LL( k ) Covering Transformation
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays
Generating Binary Trees Lexicographically
Planar Formulae and Their Uses
Factoring Rational Polynomials Over the Complex Numbers
Optimal Resizable Arrays
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier
Parallel Algorithms in Graph Theory: Planarity Testing
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification
Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling
Minimum Cost Paths in Periodic Graphs
Tight Lower Bounds for the Online Labeling Problem
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More
On Proximity-Oblivious Testing
Data Types as Lattices
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes
Minimal Representation of Directed Hypergraphs
Collections of Functions for Perfect Hashing
On the Generation of Random Binary Search Trees
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
Local Monotonicity Reconstruction
A Downward Collapse within the Polynomial Hierarchy
A Local Lemma for Focused Stochastic Algorithms
A Note on Locating a Set of Points in a Planar Subdivision
The Online Set Cover Problem
New Lower Bounds for the Rank of Matrix Multiplication
Algorithms for the Solution of Systems of Linear Diophantine Equations
Disk Performance in a Transaction-Oriented System
An Efficient Test for Circular-Arc Graphs
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
Stochastic Machine Scheduling with Precedence Constraints
Randomized Õ(M(|V|)) Algorithms for Problems in Matching Theory
Worst-Case Mechanism Design via Bayesian Analysis
On the Complexity of Matrix Product
A Note on Randomized Polynomial Time
Sublinear Algorithms for Local Graph-Centrality Estimation
A Uniform Circuit Lower Bound for the Permanent
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
The Power of Extended Top-Down Tree Transducers
The Parallel Complexity of Abelian Permutation Group Problems
Computational Complexity of Holant Problems
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem
An Extension of Strassen's Degree Bound
Markov Chain Algorithms for Planar Lattice Structures
On the Number of Comparisons to Find the Intersection of Two Relations
Size-Depth Tradeoffs for Threshold Circuits
Finding Minimal Pass Sequences for Attribute Grammars
Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture
On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
On the Performance of Greedy Algorithms in Packet Buffering
Relative to a Random Oracle A, P A != NP A != co-NP A with Probability 1
What Can be Computed Locally?
N by N Checkers is Exptime Complete
Iterated Rounding Algorithms for the Smallest k -Edge Connected Spanning Subgraph
Subquadratic Simulations of Balanced Formulae by Branching Programs
An Optimal Parallel Algorithm for Formula Evaluation
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
A Unified Framework of Light Spanners I: Fast (Yet Optimal) Constructions
Time Bounds on the Parallel Evaluation of Arithmetic Expressions
Computational Complexity of Multiple Recursive Schemata
Multicut Is FPT
Sparse Approximate Solutions to Linear Systems
The Complexity of the Equivalence Problem for Simple Loop-Free Programs
Depth Reduction for Composites
Balanced Allocations: The Heavily Loaded Case
The Structure of Polynomial Ideals and Gröbner Bases
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Parallel Transitive Closure and Point Location in Planar Structures
Ranking and Listing Algorithms for k-ary Trees
Scheduling Graphs on Two Processors
Limitations on Separating Nondeterministic Complexity Classes
Proximity in Arrangements of Algebraic Sets
Minimal Threshold Separators and Memory Requirements for Synchronization
Membership Problem for the Modular Group
Holographic Proofs and Derandmization
Planar Graphs of Bounded Degree Have Bounded Queue Number
Probably Approximate Learning of Sets and Functions
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
Complexity of Self-Assembled Shapes
Two-Way Chaining with Reassignment
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
Computing a Nonnegative Matrix Factorization - Provably
Characterizing Truthful Multi-armed Bandit Mechanisms
Convergence in Distribution for Best-Fit Decreasing
Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited
On the Value of Coordination in Distributed Decision Making
Worst Case Analysis of Two Scheduling Algorithms
Finding a Maximum Cut of a Planar Graph in Polynomial Time
A Fast Discrete Approximation Algorithm for the Radon Transform
Approximate Max-Flow on Small Depth Networks
Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes
Layout of Graphs with Bounded Tree-Width
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
Robust Characterizations of Polynomials with Applications to Program Testing
Data Structures' Maxima
Approximate Reduction and Lambda Calculus Models
The PSPACE-Completeness of Black-White Pebbling
On Embedding a Graph in the Grid with the Minimum Number of Bends
Intersection and Closest-Pair Problems for a Set of Planar Discs
Parallel Solution of Certain Toeplitz Linear Systems
The Complexity of Finding Paths in Graphs with Bounded Independence Number
On the Consecutive-Retrieval Problem
Scheduling Interval-Ordered Tasks
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
High-Probability Parallel Transitive-Closure Algorithms
Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
Computational Complexity of Inner Products of Vectors (And That of Other Bilinear Forms) over a Noncommutative Ring (Auxiliary Functions Allowed)
Planar Integer Linear Programming is NC Equivalent to Euclidean GCD
Anisotropic Delaunay Mesh Generation
Private Matchings and Allocations
Maintaining the 3-Edge-Connected Components of a Graph On-Line
Network Flow and Testing Graph Connectivity
Contractions, Removals, and Certifying 3-Connectivity in Linear Time
On Floor-Plan of Plane Graphs
Orthogonal Packings in Two Dimensions
Approximation Algorithms for Single-Source Unsplittable Flow
Three Partition Refinement Algorithms
Private Computations over the Integers
Finite Automata Computing Real Functions
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
An "Interchange Lemma" for Context-Free Languages
Priority Queues and Permutations
Approximating the Cut-Norm via Grothendieck's Inequality
Parallelism in Comparison Problems
Inferring Evolutionary History from DNA Sequences
Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space
Regular Graphs and the Spectra of Two-Variable Logic with Counting
Formal Semantics and Abstract Properties of String Pattern Operations and Extended Formal Language Description Mechanisms
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
Stochastic Contention Resolution With Short Delays
Proving Theorems with the Modification Method
A Parametrized Algorithm for Matroid Branch-Width
Cryptography in the Bounded-Quantum-Storage Model
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs
Complexity and Unsolvability Properties of Nilpotency
An Efficient Formula for Linear Recurrences
Uniform Random Generation of Strings in a Context-Free Language
Succinct Certificates for Almost All Subset Sum Problems
Unbounded Speed Variability in Distributed Communications Systems
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
Space-Time Trade-Offs for Orthogonal Range Queries
A Round-Off Error Model with Applications to Arithmetic Expressions
Scheduling with AND/OR Precedence Constraints
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
Pseudorandom Generators for Combinatorial Shapes
Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
Randomized Consensus in Expected O(n log² n) Operations Per Processor
How to Construct Pseudorandom Permutations from Pseudorandom Functions
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem
Submodular Functions: Learnability, Structure, and Optimization
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver Hierarchy
On Hamiltonian Walks in Graphs
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
Typical Properties of Winners and Losers in Discrete Optimization
Gossiping in Minimal Time
An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines
Automatic Methods for Hiding Latency in Parallel and Distributed Computation
D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String
Hamming Codes, Hypercube Embeddings, and Fault Tolerance
Fully Dynamic Orthogonal Range Reporting on RAM
Constant Time Generation of Rooted Trees
On the Exact Complexity of String Matching: Lower Bounds
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020)
Asymptotic Expansions for a Closed Multiple Access System
Interval Completion Is Fixed Parameter Tractable
Permuting in Place
The Expected Number of 3D Visibility Events Is Linear
Profiles of Tries
The Knowledge Complexity of Interactive Proof Systems
Completeness, Approximation and Density
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version)
Complexity Results for Multiprocessor Scheduling under Resource Constraints
Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
Optimal Expected-Case Planar Point Location
An Asymptotically Optimal Algorithm for the Dutch National Flag Problem
Expressibility and Nonuniform Complexity Classes
A Practical Shortest Path Algorithm with Linear Expected Time
Precision-Sensitive Euclidean Shortest Path in 3-Space
Survivable Network Design with Degree or Order Constraints
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
Constant-Time Randomized Parallel String Matching
A 2½-Approximation Algorithm for Shortest Superstring
Better Bin Packing Approximations via Discrepancy Theory
Decompositions of Triangle-Dense Graphs
Quantum Hardness of Learning Shallow Classical Circuits
Quantum 3-SAT Is QMA 1 -Complete
Sketching in Adversarial Environments
Computations of Uniform Recurrence Equations Using Minimal Memory Size
Fast Algorithms for Finding Nearest Common Ancestors
The Computational Hardness of Estimating Edit Distance
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search
Combinatorial Gray codes
Bounds on the Step and Namespace Complexity of Renaming
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
Algorithmic Aspects of Vertex Elimination on Graphs
A Parallel Repetition Theorem
Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007)
Parallel Algorithms for Channel Routing in the Knock-Knee Model
A Topological View of Unsupervised Learning from Noisy Data
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
On a Primality Test of Solovay and Strassen
A General Framework for Graph Sparsification
Fast Integer Multiplication Using Modular Arithmetic
Weighted Multidimensional Search and Its Application to Convex Optimization
Learning Kernel-Based Halfspaces with the 0-1 Loss
Fast Parallel Arithmetic via Modular Representation
A Weighted Linear Matroid Parity Algorithm
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
Approximation Algorithms for Biclustering Problems
The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses
Near-Testable Sets
Prediction of the productivity of steam flooding production wells using Gray Relation Analysis and Support Vector Machine
A new approach for steganography in Bengali text
Section A: Mathematics and Engineering Section B: Computer Science
Measurement and characteristics of high-quality development level of innovation and entrepreneurship based on EM-AHP-TOPSIS
First-principle study on polarizability and hyperpolarizability of a transition metal cluster, [Mo 2 S 3 (C 6 H 11 ) 3 (CO) 6 ]·N(
Gustav Mie's longitudinal electrical field lines and superluminal signals and longitudinal waves
CFD-based UAV automatic take-off ground roll control method
Power characteristic analysis and measurement at the transmitter end of a bilateral LCC compensated wireless charging system
Development of look-ahead NURBS interpolation based on the exponential function
Organizational quality specific immune evaluation model based on optimal combination weighting
RETRACTED: Research on intelligent evaluation model of vocational education curriculum based on diffusion reinforcement learning and multi-scale residual network
Virtual interaction algorithm of cultural heritage based on multi feature fusion