yusuke1997/dblp-id-title huggingface dataset:
Stochastic catastrophe theory in computer performance modeling
A Purely Homomorphic Characterization of Recursively Enumerable Sets
An Overview of the Theory of Computational Complexity
Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding
The height of a random binary search tree
Diversity-Based Inference of Finite Automata
On Mappings for Modular Arithmetic, II
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
Correction: "Testing of Operational Amplifiers"
Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy
The Parameterized Complexity of the k -Biclique Problem
Vector Execution of Flow Graphs
On clusterings: Good, bad and spectral
Separators for sphere-packings and nearest neighbor graphs
Connected Component Labeling Using Quadtrees
Multiplicative complexity of polynomial multiplication over finite fields
Automatic Coding for the IBM 701
Operational and Semantic Equivalence Between Recursive Programs
Path ORAM: An Extremely Simple Oblivious RAM Protocol
Some Parallel Thinning Algorithms for Digital Pictures
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Generating Automatically Tuned Bitmaps from Outlines
Decentralized Asynchronous Crash-resilient Runtime Verification
A theory of intersection anomalies in relational database schemes
The IBM 701 Speedcoding System
Complexity of Makanin's Algorithm
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys
On the Compatibility of a Given Solution With the Data of a Linear System
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
A Bidirectional Simplex Algorithm
Settling the Sample Complexity of Online Reinforcement Learning
Design and analysis of dynamic Huffman codes
What Can Machines Know? On the Properties of Knowledge in Distributed Systems
Multistep Methods With Modified Predictors and Correctors
A Sorting Problem
On Ianov's Program Schemata
Algebraic Structures for Capturing the Provenance of SPARQL Queries
Reconciliation With Nonbinary Gene Trees Revisited
Toeplitz Matrix Inversion: The Algorithm of W. F. Trench
Tensor-Rank and Lower Bounds for Arithmetic Formulas
A New Linear-Time "On-Line" Algorithm for Finding the Smallest Initial Palindrome of a String
The Digital Approximation of Contours
Dynamic Programming and the Graphical Traveling Salesman Problem
Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
Computing Homology Groups of Simplicial Complexes in R 3
On the Truncation Error of Discrete Approximations to the Solutions of Dirichlet Problems in a Domain with Corners
Size and Treewidth Bounds for Conjunctive Queries
The serializability of concurrent database updates
On Database Logic
Structure and Use of ALGOL 60
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions
Passes, sweeps, and visits in attribute grammars
Inaugural Presidential Address
Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k -SUM and k -XOR
Partitioning a polygonal region into trapezoids
The Reachability Problem for Petri Nets Is Not Elementary
Synthesis of Binary Ring Counters of Given Periods
Encoding Data Structures in Trees
Truthful Mechanisms with Implicit Payment Computation
The Parallel Evaluation of General Arithmetic Expressions
Numerical Evaluation of Symmetric Polynomials
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
On the "Reverse Order Law" Related to the Generalized Inverse of Matrix Products
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Multiplicative Pseudo-Random Number Generators with Prime Modulus
Faster Scaling Algorithms for General Graph-Matching Problems
Automatic Question-Answering of English-Like Questions About Simple Diagrams
The greedy path-merging algorithm for contig scaffolding
A Dual Master File System for a Tape Processing Computer
Adding Range Restriction Capability to Dynamic Data Structures
Three Logics for Branching Bisimulation
#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
The Topological Mu-Calculus: Completeness and Decidability
Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers
Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness
Models of Computations and Systems - Evaluation of Vertex Probabilities in Graph Models of Computations
Some Computational Results on "Two-Line" Iterative Methods for the Biharmonic Difference Equation
A Queueing Model with Finite Waiting Room and Blocking
Decomposable negation normal form
On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions
Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation
Unification in Primal Algebras, Their Powers and Their Varieties
Arithmetical Analysis of Digital Computing Nets
A High-Scanning-Rate Storage Device for Computer Applications
Complexity Results for Permuting Data and Other Computations on Parallel Processors
Software Protection and Simulation on Oblivious RAMs
Associative Document Retrieval Techniques Using Bibliographic Information
On Approximate Computer System Models
Definable relations and first-order query languages over strings
Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata
The Solvability of the Derivability Problem for One-Normal Systems
A report from Headquarters
Dynamic ordered sets with exponential search trees
On Formalisms for Turing Machines
Nondeterministic Polynomial-Time Computations and Models of Arithmetic
Computations of Bilinear Forms over Finite Fields
Test of an Inventory Control System on FERUT
The Cycle Time Distribution of Exponential Cyclic Queues
Comments on a Paper by Gaver
Semantic Road Maps for Literature Searchers
The Membership Problem in Aperiodic Transformation Monoids
One View of Man-Machine Interaction
Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
Toward Abstract Numerical Analysis
The Analysis of Hashing Techniques That Exhibit k-ary Clustering
Polynomial-Time Implication Problems for Unary Inclusion Dependencies
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
Improved methods for storing and updating information in the out-of-kilter algorithm
On Economization of Rational Functions
Lower Bounds for Selection in X+Y and Other Multisets
Semi-Automated Mathematics
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
Serializability by Locking
Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
Equilibration of Symmetric Matrices in the Max-Norm
Flowgraphs and Flow Algebras
Morphology of "Information Flow"
Note on the Practical Computation of Proper Values
A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
A Fast Merging Algorithm
A Simple On-Line Bin-Packing Algorithm
Calculating Normalization Constants of Closed Queueing Networks by Numerically Inverting Their Generating Functions
Errata: "An axiomatic approach to code optimization for Expressions"
A Method of Determining Plate Bending by Use of a Punched-Card Machine
Finding the Lengths of All Shortest paths in N-Node Nonnegative-Distance Complete Networks Using ½N³ Additions and N³ Comparisons
Smoothed Analysis of the k-Means Method
Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures
Compactly encoding unstructured inputs with differential compression
R-Domination in Graphs
Formal verification of standards for distance vector routing protocols
Rasterizing curves of constant width
Deciding first-order properties of locally tree-decomposable structures
Three great challenges for half-century-old computer science
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
Generalization: Key to Successful Electronic Data Processing
Psychological Tests and Selection of Computer Programmers
On the design of some systolic algorithms
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Improved master theorems for divide-and-conquer recurrences
A Counting Approach to Lower Bounds for Selection Problems
Acceptance Trees
Notions of dependency satisfaction
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
A Note on Quadrilateral Interpolation
Memory Requirements in a Multiprocessing Environment
SINR Diagrams: Convexity and Its Applications in Wireless Networks
Renamings and Economy of Memory in Program Schemata
On the Parallel Evaluation of Certain Arithmetic Expressions
A weighted voting algorithm for replicated directories
Eigenvalues and Expansion of Regular Graphs
A Chebycheff Fitting Criterion
Geometric suffix tree: Indexing protein 3-D structures
Polynomial-time approximation schemes for geometric min-sum median clustering
Kronecker Matrices, Computer Implementation, and Generalized Spectra
Asymptotic Behavior of the Best Polynomial Approximation
On the Average Communication Complexity of Asynchronous Distributed Algorithms
ACM Publication Policies and Plans
Incremental modular decomposition
Common Solutions for n Matrix Equations With Applications
Autoepistemic Logic
How Much Data Is Sufficient to Learn High-Performing Algorithms?
The Sample Complexity of Up-to-ε Multi-dimensional Revenue Maximization
The Complexity of Some Problems on Subsequences and Supersequences
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Decision List Compression by Mild Random Restrictions
Pivot Strategies for Primal-Simplex Network Codes
A Trade-Off between Information and Communication in Broadcast Protocols
Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata
Self-Adjusting Binary Search Trees
Characterizing Transactional Memory Consistency Conditions Using Observational Refinement
Real-Time Definable Languages
Computability of Recursive Functions
A Generalized Queueing Discipline for Product Form Network Solutions
On the Generation of Errors in the Digital Evaluation of Continued Fractions
A Remark on Post Normal Systems
On Equivalence and Containment Problems for Formal Languages
Efficient Decomposition Methods for the Analysis of Multi-Facility Blocking Models
The Unit Proof and the Input Proof in Theorem Proving
Discrete Temporal Constraint Satisfaction Problems
A Mechanical Proof Procedure and its Realization in an Electronic Computer
Generation of Primes by a One-Dimensional Real-Time Iterative Array
Bounds for Some Functions Concerning Dynamic Storage Allocation
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents
Investigation of Computer Operating Time and System Capacity for Man-Machine Digital Systems
A Propositional Modal Logic of Time Intervals
The equivalence problem for some non-real-time deterministic pushdown automata
Multidimensional search trees that provide new types of memory reductions
Reasoning About Knowledge and Probability
An axiomatic approach to code optimization for expressions
Recognizing planar perfect graphs
Bounds on Storage for Consecutive Retrieval
Whole-grain Petri Nets and Processes
Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models
Noncounting Context-Free Languages
The Performance of Job Classes with Distinct Policy Functions
Lower Bounds and Fast Algorithms for Sequence Acceleration
A Note on Dijkstra's Shortest Path Algorithm
Evaluation of a Pseudorandom Normal Number Generator
Optimal simulations between mesh-connected arrays of processors
Minimizing function-free recursive inference rules
A characterization of regular expressions under bisimulation
Solving Linear Programs without Breaking Abstractions
A Unified Approach to Path Problems
Computable Error Bounds for Aggregated Markov Chains
Irreducible Topological Components of an Arbitrary Boolean Truth Function and Generation of Their Minimal Coverings
An optimal minimum spanning tree algorithm
On Reducibility to Complex or Sparse Sets
Efficient Descriptor-Vector Multiplications in Stochastic Automata Networks
On Relevance, Probabilistic Indexing and Information Retrieval
New Approximation Algorithms for Graph Coloring
The Complexity of the Finite Containment Problem for Petri Nets
Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
Application of Ternary Algebra to the Study of Static Hazards
A Convergent Algorithm for Solving Polynomial Algorithms
Automatic Recognition of Tractability in Inference Relations
Greatest common divisors of polynomials given by straight-line programs
The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
Elimination of intersection anomalies from database schemes
On the Fourier Spectrum of Monotone Functions
Lower bounds on communication complexity in distributed computer networks
Isomorphism Groups of Automata
Many-sorted unification
Unification in Commutative Theories, Hilbert's Basis Theorem, and Gröbner Bases
Lower Bounds for the Low Hierarchy
Flowshop scheduling with limited temporary storage
The VPN Conjecture Is True
Clustering under approximation stability
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions
Quantitative Coding and Complexity Theory of Continuous Data: Part I: Motivation, Definition, Consequences
A Supernormal-Form Theorem for Context-Free Grammars
Behavioral equivalence in the polymorphic pi-calculus
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
Denotational Semantics with Nominal Scott Domains
Bounded concurrent timestamp systems using vector clocks
Abstract Implementations and Their Correctness Proofs
Corrigendum: "Mean-Value Analysis of Closed Multichain Queuing Networks"
Embeddability in R 3 is NP-hard
Fixed-point definability and polynomial time on graphs with excluded minors
An Electronic Differential Analyzer as a Difference Analyzer
The Concept of Term Exclusiveness and Its Effect on the Theory of Boolean Functions
A Compositional Theory of Linearizability
Another Generalization of Resolution
Testing satisfaction of functional dependencies
On the union of fat tetrahedra in three dimensions
A Methodology for LISP Program Construction from Examples
The Method of Reduced Matrices for a General Transportation Problem
On Contention Resolution Protocols and Associated Probabilistic Phenomena
Analysis of a bounding box heuristic for object intersection
Some optimal inapproximability results
Mechanical Discovery of Classes of Problem-Solving Strategies
System Specifications for the DYSEAC
Program for Double-Dummy Bridge Problems--A New Strategy for Mechanical Game Playing
On Axiomatizing Multivalued Dependencies in Relational Databases
Effective Axiomatizations of Hoare Logics
Sublinear optimization for machine learning
An Integrated Computation System for the ERA-1103
Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time
Computational Complexity and Probability Constructions
Expected Deadlock Time in a Multiprocessing System
General Belief Revision
A Functional Canonical Form
An O ( n log n ) algorithm for maximum st -flow in a directed planar graph
Notes on a New Pseudo-Random Number Generator
Locking Protocols: From Exclusive to Shared Locks
Quotients of Context-Free Languages
"Strong" NP-Completeness Results: Motivation, Examples, and Implications
The Organization of Computations for Uniform Recurrence Equations
Set constraints with projections
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
Sieving Procedures on a Digital Computer
Formal Verification of Complex Coherence Protocols Using Symbolic State Models
A Formal Method for the Abstract Specification of Software
Chebyshev Solution of n+1 Linear Equations in n Unknowns
Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems
Shellability is NP-complete
Deciding Linear Inequalities by Computing Loop Residues
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time
The Concept of Weak Substitution in Theorem-Proving
Generation of Binary Trees from Ballot Sequences
A Comparison of Machine Organizations by Their Performance of the Iterative Solution of Linear Equations
A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
On becoming editor-in-chief of JACM
Efficient Ordering of Set Expressions for Symbolic Expansion
A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels
Invited Article Foreword
Lower Bounds for Orthogonal Range Searching II. The Arithmetic Model
Chebyshev Approximation of a Continuous Function by a Class of Functions
Provably Correct Theories of Action
The Distribution of Queuing Network States at Input and Output Instants
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
Two-Commodity Flow
The conjecture of Fliess on commutative context-free languages
The complexity of restricted spanning tree problems
Conditional Monte Carlo
Qualitative decision theory: from savage's axioms to nonmonotonic reasoning
Branching Time and Abstraction in Bisimulation Semantics
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
Recognizing circle graphs in polynomial time
Automatic Preparation of Flow Chart Listings
An End-to-End Approach to the Resequencing Problem
On Quasicyclic Jacobi Methods
The coloring and maximum independent set problems on planar perfect graphs
A Human Oriented Logic for Automatic Theorem-Proving
The Generation of Pseudo-Random Numbers on a Decimal Calculator
The mutual exclusion problem: part I - a theory of interprocess communication
Notes on the Adaptive Simpson Quadrature Routine
How Many Queries Are Needed to Learn?
The Design and Simulation of an Information Processing System
A Survey of Microcellular Research
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
On the SUP-INF Method for Proving Presburger Formulas
Deterministic Minimum Cut in Poly-logarithmic Maximum Flows
JACM 1976-1979
Settling the Query Complexity of Non-adaptive Junta Testing
Parallel Queues with Resequencing
Feedback Vertex Sets and Cyclically Reducible Graphs
An Approach to Program Behavior Modeling and Optimal Memory Control
Worst-case Analysis of Set Union Algorithms
Toward a Formal Theory of Modeling and Simulation: Structure Preserving Morphisms
Binomial-Weighted Orthogonal Polynomials
Analysis of a composite performance reliability measure for fault-tolerant systems
An approximation scheme for stochastic linear programming and its application to stochastic integer programs
Testing Deadlock-Freedom of Computer Systems
Source routing and scheduling in packet networks
Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems
Generation of Universal Series-Parallel Boolean Functions
A New Approach to the Minimum Cut Problem
Inversion of Matrices by Partitioning
Decidable Properties of Monadic Functional Schemas
A Programming Language for Simulating Digital Systems
A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
Conjunctive queries over trees
KEDMA - Linguistic Tools for Retrieval Systems
On Matrices with Connections
Cumulative Binomial Probabilities
Optimal directory placement on disk storage devices
On the shortest paths between two convex polyhedra
A New Method of Checking the Consistency of Precedence Matrices
An O(n²(m + n log n)log n) min-cost flow algorithm
Refining Nondeterminism in Relativizations of Complexity Classes
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
The Diclique Representation and Decomposition of Binary Relations
Serial Correlation in the Generation of Pseudo-Random Numbers
Newtonian program analysis
Concurrent dynamic logic
On the Optimal Solution of Large Linear Systems
Complete inverted files for efficient text retrieval and analysis
The Power of Dominance Relations in Branch-and-Bound Algorithms
Data Structures and Correctness of Programs
Task assignment with unknown duration
Sequencing Aspects of Multiprogramming
An Answer to Mr. J. A. Lively's Remarks on the Paper "Amphisbaenic Sorting"
Learning Equilibria in Matching Markets with Bandit Feedback
Sorting by Address Calculation
On the Complexity of Testing Implications of Functional and Join Dependencies
Consistency in Hierarchical Database Systems
The Computational Advantage of MIP* Vanishes in the Presence of Noise
The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier
The gene evolution model and computing its associated probabilities
Corrigenda: "Statistical Complexity of Algorithms for Boolean Function Minimization"
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems
Scene Grammars, Factor Graphs, and Belief Propagation
SWAC Computations for Some m×n Scheduling Problems
Mixed Congruential Random Number Generators for Decimal Machines
Code Generation for a One-Register Machine
Probabilistic inductive inference
On the complexity analysis of static analyses
Applications of Path Compression on Balanced Trees
Optimal Sample Cost Residues for Differential Database Batch Query Problems
Distribution-free, Risk-controlling Prediction Sets
The Time Required for Group Multiplication
Empirical Tests of an Additive Random Number Generator
Invited Articles Foreword
Rumor Spreading and Conductance
Improved Distributed Approximate Matching
Function Evaluation in Unnormalized Arithmetic
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Remarks on the Unitary Triangularization of a Nonsymmetric Matrix
On the Length of Programs for Computing Finite Binary Sequences
Sufficient Conditions for the Success of GPS
On the Structures of an Automaton and Its Input Semigroup
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
Boundary Contraction Solution of Laplace's Differential Equation II
Special Editor's Note
Integer Arithmetic Algorithms for Polynomial Real Zero Determination
The Tractability Frontier of Graph-Like First-Order Query Sets
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
Context-Limited Grammars
Lower Bounds for Orthogonal Range Searching: I. The Reporting Case
A universal interconnection pattern for parallel computers
New Results on Quantifier Elimination over Real Closed Fields and Applications to Constraint Databases
A Flow Analysis Algorithm
A Policy for JACM
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
Closure properties of constraints
Probabilistic Checking of Proofs: A New Characterization of NP
Properties of Programs and the First-Order Predicate Calculus
Simulation Techniques for the Test and Evaluation of Real-Time Computer Programs
An axiomatic treatment of three qualitative decision criteria
On the Approximate Solution of Free Boundary Problems Using Finite Differences
Undecidability of bisimilarity by defender's forcing
Tight bounds for k -set agreement
Belief Propagation Guided Decimation Fails on Random Formulas
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Computing with highly mixed states
Automatic Indexing: An Experimental Inquiry
Dynamic word problems
Mutual Search
Useless Actions Make a Difference: Strict Serializability of Database Updates
Analysis of Real Time Multiprogramming
On the online bin packing problem
Corrigendum: "Lower Bounds and Reductions Between Grammar Problems"
A Lower Bound for Integer Greatest Common Divisor Computations
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
A Polynomial Solution to the Undirected Two Paths Problem