yusuke1997/dblp-id-title huggingface dataset:
On the Minimality and Decomposability of Row-Convex Constraint Networks
On Strongest Algebraic Program Invariants
Robustness of Queuing Network Formulas
Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications and Divisions
The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
Logic Matrices and the Truth Function Problem
Consistency of Relations over Monoids
A Simplified Format for the Model Elimination Theorem-Proving Procedure
Intrinsic Robustness of the Price of Anarchy
Bit complexity of breaking and achieving symmetry in chains and rings
A uniform approach toward handling atomic and structured information in the nested relational database model
The Complexity of Non-Monotone Markets
Precision Modulators and Demodulators
A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
Morphological Classification in the National Bureau of Standards Mechanical Translation System
On the Computation of the Number of Solutions of Certain Trinomial Congruences
Numerical Treatment of a Fourth Order Parabolic Partial Differential Equation
On Computing the Fixed-Point Probability Vector of Ergodic Transition Matrices
Analysis and Synthesis of Stable Linear Sequential Circuits
Capacity Bounds for Multiresource Queues
Parallel Program Schemata and Maximal Parallelism II: Construction of Closures
Upper Bounds for Speedup in Parallel Parsing
Factorization and Circuit in the Connection Method
Burroughs Truth Function Evaluator
Computing With Faulty Shared Objects
Efficiency of Chebyshev Approximation on Finite Subsets
Outline for a Logical Theory of Adaptive Systems
Countable nondeterminism and random assignment
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem
How to Learn an Unknown Environment I: The Rectilinear Case
A Theorem in the Theory of Compromise Merge Methods
A Morphic Representation of Complements of Recursively Enumerable Sets
Optimal Order of One-Point and Multipoint Iteration
On-line analysis of the TCP acknowledgment delay problem
A Note on Star-Free Events
Optimum lopsided binary trees
Polynomial-Time Aggregation of Integer Programming Problems
Transfer Function Simulation by Means of Amplifiers and Potentiometers
Parallel RAMs with owned global memory and deterministic context-free language recognition
Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
Automatic information extraction from large websites
Private and Online Learnability Are Equivalent
Work-preserving emulations of fixed-connection networks
The Share 709 System: Programmed Input-Output Buffering
An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point
Derivatives of Regular Expressions
Deciding equivalences among conjunctive aggregate queries
Remarks on "The Digital Approximation of Contours"
Hamiltonian Complexity in the Thermodynamic Limit
On the complexity of unique solutions
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
Analysis of the Search Performance of Coalesced Hashing
Concurrent zero-knowledge
Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
A Comparison of Methods for Generating Normal Deviates on Digital Computers
Computational Complexity and the Existence of Complexity Gaps
An Efficient Algorithm for a Task Allocation Problem
Optimal Prefetching via Data Compression
Solution of Integer Linear Programming Problems by Direct Search
A General Card-Program for the Evaluation of the Inverse Laplace Transform
Maintenance and Acceptance Tests Used on the MIDAC
Algorithmic Analysis of a Multiprogramming-Multiprocessor Computer System
Estimating the Unseen: Improved Estimators for Entropy and Other Properties
On Computing the Exact Determinant of Matrices with Polynomial Entries
A Framework for Space Complexity in Algebraic Proof Systems
An Unrestricted Learning Procedure
A needed narrowing strategy
Nonclausal Deduction in First-Order Temporal Logic
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
Complexity of Counting CSP with Complex Weights
Stability Properties of Predictor-Corrector Methods for Ordinary Differential Equations
A vertex-allocation theorem for resources in queuing networks
Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method
Memory Matrix Using Ferroelectric Condensers as Bistable Elements
Efficient core computation in data exchange
An Implementation of the Model Elimination Proof Procedure
Degrees of Unsolvability in Formal Grammars
The Complexity of Some Simple Retrieval Problems
Ownership confinement ensures representation independence for object-oriented programs
An Optimality Proof of the LRU- K Page Replacement Algorithm
Stability of a Generalized Corrector Formula
A Path Entropy Function for Rooted Trees
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
Decision Tree Reduction
Optimal bounds for decision problems on the CRCW PRAM
A learning theory approach to noninteractive database privacy
On Modern Matrix Iteration Processes of Bernoulli and Graeffe Type
Generalized Multistep Predictor-Corrector Methods
Calculating availability and performability measures of repairable computer systems using randomization
The Maximum Concurrent Flow Problem
Coding and Code Compression
Fast computation of low-rank matrix approximations
Linear Programming Computational Procedures for Ordinal Regression
JACM 1973-1975
Oracle-efficient Online Learning and Auction Design
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes
Delaunay triangulations in O (sort( n )) time and more
Speed is as powerful as clairvoyance
PILOT - A New Multiple Computer System
Time Bounded Random Access Machines with Parallel Processing
Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium
A Multiprogramming Queue
Automorphisms of Polyadic Automata
Twin-width I: Tractable FO Model Checking
The Solution of a Toeplitz Set of Linear Equations
Monadic datalog and the expressive power of languages for Web information extraction
Sorting Using Networks of Queues and Stacks
Programmed Multiplication on the IBM 407
An Optimal Algorithm for Finding the Kernel of a Polygon
Pattern Matching in Trees
Complete Fairness in Secure Two-Party Computation
On a Periodic Property of Pseudo-Random Sequences
The Prospects for the Utilization of Informational-Logical Machines in Chemistry (USSR)
JACM's 50th anniversary
Tree Structures for Optimal Searching
Single-Class Bounds of Multi-Class Queuing Networks
Simple Computation-Universal Cellular Spaces
Minimal and Complete Word Unification
Determination of Three Percentiles of the omega n Distribution Function
The rational numbers as an abstract data type
Advances on the Hamiltonian Completion Problem
Co-lexicographically Ordering Automata and Regular Languages - Part I
The Solvability of the Halting Problem for 2-State Post Machines
Optimal Static Load Balancing in Distributed Computer Systems
Solution of Linear Systems by Richardson's Method
Analysis of Graphs by Ordering of Nodes
Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/\bar F
Coloring 3-Colorable Graphs with Less than n 1/5 Colors
A formal foundation for XrML
Incomplete Information in Relational Databases
The Three-Machine No-Wait Flow Shop is NP-Complete
Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction
Sets of Tapes Accepted by Different Types of Automata
Orthologic and quantum logic: models and computational elements
From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System
Term Weighting in Information Retrieval Using the Term Precision Model
How to Share Concurrent Wait-Free Variables
Mechanisms and Robots
Computational limitations on learning from examples
On the Desirability of Acyclic Database Schemes
Implicit Data Structures for the Dictionary Problem
Continuation-Based Program Transformation Strategies
A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
Independence in Infinite Probabilistic Databases
An Efficient General-Purpose Parallel Computer
Statistical Estimation of the Numerical Solution of a Fredholm Integral Equation of the First Kind
EASIAC, A Pseudo-Computer
Bandits and Experts in Metric Spaces
Unit Refutations and Horn Sets
Divide-and-conquer approximation algorithms via spreading metrics
Formal Justification of a Proof System for Communicating Sequential Processes
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
A New Approach to the Analysis of Linear Probing Schemes
Deadlock avoidance revisited
Boundary Contraction Solution of Laplace's Differential Equation
The physical mapping problem for parallel architectures
Concurrency and Availability as Dual Properties of Replicated Atomic Data
Patricia Tries Again Revisited
Church-Rosser Thue systems and formal languages
On the Role of the ACM Journal
Parsing of Graph-Representable Pictures
Z-Resolution: Theorem-Proving with Compiled Axioms
Ambiguity in context free languages
Conclusions After Using the PACT I Advanced Coding Technique
Improved implementations of binary universal operations
A trade-off between space and efficiency for routing tables
Efficiency of Synchronous Versus Asynchronous Distributed Systems
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
Theory of Neuromata
Erratum: "On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems"
Application of Parallel Processing to Numerical Weather Prediction
On the Decidability of Membership in Matrix-exponential Semigroups
Clique Is Hard on Average for Regular Resolution
A Stochastic Model for Message Assembly Buffering with a Comparison of Block Assignment Strategies
Renaming a Set of Clauses as a Horn Set
Log Space Recognition and Translation of Parenthesis Languages
A Note on Bracketed Grammars
The Number of Classes of Invertible Boolean Functions
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
A Logical Approach to Type Soundness
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
Feedback Queueing Models for Time-Shared Systems
An Asymptotically Random Tausworthe Sequence
Lattice computers for approximating Euclidean space
Characterizing and reasoning about probabilistic and non-probabilistic expectation
An Automatic Programming Routine for the Elliott 401
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
On the Analytical Modeling of Database Concurrency Control
An Improved Bidirectional Heuristic Search Algorithm
An Iteration Theorem for Simple Precedence Languages
JACM 1983-1986
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
Three Approaches to Heuristic Search in Networks
The Association for Computing Machinery
Using Semi-Joins to Solve Relational Queries
An Augmented Content-Addressed Memory Array for Implementation With Large-Scale Integration
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
Reversal-Bounded Multicounter Machines and Their Decision Problems
A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue
Instruction Sets for Evaluating Arithmetic Expressions
The High-Speed Electronic Calculating Machine of the Academy of Sciences of the U.S.S.R.
Some distributions that allow perfect packing
Generalized Cascade Decompositions of Automata
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Model Checking Higher-Order Programs
Computer-Feasible Method for Handling Incomplete Data in Regression Analysis
Approximating grammar probabilities: solution of a conjecture
IP = PSPACE: Simplified Proof
Some a Posteriori Error Bounds in Floating-Point Computations
Faster Algorithms for the Shortest Path Problem
On Time Versus Space
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets
Algorithmic Solution of the Change-Making Problem
Translation Networks and Function Composition
A Class of Integration Formulas
On the Reduction of Superfluous States in a Sequential Machine
Decentralized Simulation of Resource Managers
Generated Error in Rotational Tridiagonalization
Learning functions represented as multiplicity automata
A Method for Solving Large Matrix Equations Reduced From Fredholm Integral Equations of the Second Kind
Solvability of Machine Mappings of Regular Sets to Regular Sets
The Approximate Solution of Matrix Problems
A Note on the Self-Consistency of Definitions of Generalization and Inductive Inference
Equivalences Among Relational Expressions with the Union and Difference Operators
The Topology of Wireless Communication
Generalized Simulation of Post Office Systems
An Operator Which Locates Edges in Digitized Pictures
Basic digit sets for radix representation
An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
A theory of reliability in database systems
P-Complete Approximation Problems
Efficient and secure authenticated key exchange using weak passwords
Cost-Error Relationships in A* Tree-Searching
Speed scaling to manage energy and temperature
How to Delegate Computations: The Power of No-Signaling Proofs
The Logic of Automata - Part I
Adaptive Allocation of Central Processing Unit Quanta
Algorithms for computing the static single assignment form
Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations
Stability and Optimal Control of the Packet Switching Broadcast Channel
Using temporal hierarchies to efficiently maintain large temporal databases
Minimizing Drum Latency Time
Optimal Mesh Size in the Numerical Integration of an Ordinary Differential Equation
Time-shared Systems: a theoretical treatment
A Lower Bound to Finding Convex Hulls
A New Minimax Theorem for Randomized Algorithms
Mechanized Indexing Methods and Their Testing
A Proof of the CSP Dichotomy Conjecture
Addendum to "Initializing Generalized Feedback Shift Register Pseudorandom Number Generators"
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
An Abstract Machine for Symbolic Computation
Array Permutation by Index-Digit Permutation
A Practical Decision Procedure for Arithmetic with Function Symbols
Unnormalized Floating Point Arithmetic
Automatic Proofs of Theorems in Analysis Using Nonstandard Techniques
Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'
Topological Problems Arising When Solving Boundary Value Problems for Elliptic Partial Differential Equations by the Method of Finite Differences
A testing scenario for probabilistic processes
Hierarchical planarity testing algorithms
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Propagation of Truncation Errors in the Numerical Solution of Ordinary Differential Equations by Repeated Closures
Linear-time approximation schemes for clustering problems in any dimensions
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
Explicit OR-Dispersers with Polylogarithmic Degree
Some Completeness Results in the Mathematical Theory of Computation
A Method for the Solution of the N th Best Path Problem
A New Approach to Image Sharing with High-Security Threshold Structure
Sample-Efficient Strategies for Learning in the Presence of Noise
Independence-Reducible Database Schemes
An Algorithm for Structuring Flowgraphs
The approximability of MAX CSP with fixed-value constraints
Fast monte-carlo algorithms for finding low-rank approximations
Arithmetic Cryptography
Improved Smoothed Analysis of Multiobjective Optimization
On the Simplification and Equivalence Problems for Straight-Line Programs
A Grammatical Characterization of One-Way Nondeterministic Stack Languages
Some Recursively Unsolvable Problems in ALGOL-Like Languages
A High-Speed Computer Technique for the Transportation Problem
Significant Improvements to the Hwang-Lin Merging Algorithm
A subdivision-based algorithm for the sparse resultant
Lower bounds on the bounded coefficient complexity of bilinear maps
Segmentation problems
Three problems in computer science
An Initial-Value Theory for Fredholm Integral Equations With Semidegenerate Kernels
Probabilistic ω-automata
A unified approach to scheduling on unrelated parallel machines
Equality-based binary resolution
Big Buckets Are (Are Not) Better!
On the Efficiency of a Polynomial Irreducibility Test
Foundations of Multimedia Database Systems
Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables
A unified approach to approximation algorithms for bottleneck problems
Reduction of Runs in Multiparameter Computations
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
Indexing compressed text
Backtrack Programming
A Formal Construction of Term Classes
Almost Optimal Local Graph Clustering Using Evolving Sets
Optimal design and use of retry in fault-tolerant computer systems
Finite Automata and the Set of Squares
A Sufficient Bound for Codes Correcting Bursts with Weight Constraint
Polymorphic higher-order recursive path orderings
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
Standardized Programming Methods and Universal Coding
The random oracle methodology, revisited
Structural Conditions for Perturbation Analysis of Queuing Systems
Total Precedence Relations
A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees
Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process
Interactive Proofs and the Hardness of Approximating Cliques
Lossless abstraction of imperfect information games
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
A Laplace transform algorithm for the volume of a convex polytope
Presidential Address to the ACM
Fully Dynamic Planarity Testing with Applications
Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines
Simplify: a theorem prover for program checking
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
A Backtrack Procedure for Isomorphism of Directed Graphs
On Stability and Performance of Parallel Processing Systems
Balancing Straight-line Programs
Avoiding Cartesian products for multiple joins
Analysis and Applications of the Delay Cycle for the M/M/c Queueing System
Logarithmic hardness of the undirected edge-disjoint paths problem
Propositional proof complexity
Cyclic Queues with Bulk Arrivals
Faster Polynomial Multiplication over Finite Fields
Simple extractors for all min-entropies and a new pseudorandom generator
BE VISION, A Package of IBM 7090 FORTRAN Programs to Draw Orthographic Views of Combinations of Plane and Quadric Surfaces
Erratum: "Formulas for Computing Incomplete Elliptic Integrals of the First and Second Kind"
Uniform, Integral, and Feasible Proofs for the Determinant Identities
JACM editors-in-chief
An Algorithm for Subgraph Isomorphism
Matrices Associated With the Hitchcock Problem
JACM 1991-1997
Life Insurance Premium Billing and Combined Operations by Electronic Equipment
Unconditional security in quantum cryptography
On specification of Read/Write shared variables
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Intersection of convex objects in two and three dimensions
Sharing a Processor Among Many Job Classes
Inversion of Persymmetric Matrices Having Toeplitz Inverses
Balanced sequences and optimal routing
A property of quantum relative entropy with an application to privacy in quantum communication
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
Local Computation: Lower and Upper Bounds
A complete problem for statistical zero knowledge
Experiments With Some Programs That Search Game Trees
Search within a Page
On Live-Dead Analysis for Global Data Flow Problems
Priority Queues with Feedback
Deterministic On-Line Routing on Area-Universal Networks
Probabilistic Aspects of Boolean Switching Functions via a New Transform
A new approach to the maximum-flow problem
Fast Multiple-Precision Evaluation of Elementary Functions
How to construct random functions
Worst-case Optimal Join Algorithms
A differential approach to inference in Bayesian networks
Time-space trade-off lower bounds for randomized computation of decision problems
A Combinatorial Problem Related to Multimodule Memory Organizations
Micro-Programming
New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
Editorial: JACM redux
Acceleration by Stepsize Hedging: Multi-Step Descent and the Silver Stepsize Schedule
Two-Tape Simulation of Multitape Turing Machines
Concurrent Processes and Their Syntax
The Calculation of Multivariate Polynomial Resultants
Simulating Stable Stochastic Systems, VI: Quantile Estimation
Canonical Coin Changing and Greedy Solutions
The Tree-to-Tree Correction Problem
Fault-Tolerant Wait-Free Shared Objects
A Threshold of ln n for Approximating Set Cover
Higher-Order Horn Clauses
Automatic Computations with Power Series
A General System for Handling Alphameric Information on the IBM 701 Computer
Two Families of Languages Related to ALGOL
A New Look at the Numerical Integration of Ordinary Differential Equations
Transitive closure logic, nested tree walking automata, and XPath
Dynamic Placement of Records in Linear Storage
A Comparison of Multilevel break and next Statements
Analogue Study of Electron Trajectories
Constraint Satisfaction Problems Solvable by Local Consistency Methods
On Limit Properties in Digitization Schemes
Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II: minimum storage requirement
An Investigation of Some Computational Aspects of Integer Programming
Bounds on Schedules for Independent Tasks with Similar Execution Times
Average-Case Analysis of Algorithms for Matchings and Related Problems
Decidable Problems for Powerful Programs
Sparsification - a technique for speeding up dynamic graph algorithms
On the Efficiency of Subsumption Algorithms
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
Symbolic Designations for Electrical Connections
Approximation Algorithms for NP-Complete Problems on Planar Graphs
Program Improvement by Source-to-Source Transformation
Computable Error Bounds for Direct Solution of Linear Equations
Representation of Events in the von Neumann Cellular Model
A Method of Normalized Block Iteration
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Derivation of a Waiting-Time Factor for a Multiple-Bank Memory
Minimization of Tree Patterns
On the expressiveness and complexity of randomization in finite state monitors
Instance Complexity
On Optimal Scheduling Algorithms for Time-Shared Systems
On the Correctness of Semantic-Syntax-Directed Translations
Theories, solvers and static analysis by abstract interpretation
Test Routines Based on Symbolic Logical Statements
ALPHA - An Automatic Programming System of High Efficiency
A New Algorithm for Preemptive Scheduling of Trees
An Online Display for the Study of Approximating Functions
The Salesman's Improved Paths through Forests
Combining expert advice in reactive environments