yusuke1997/dblp-id-title huggingface dataset:
Efficient Simulation of Finite Automata by Neural Nets
A Graphical Search for Stiffly Stable Methods for Ordinary Differential Equations
Deterministic versus nondeterministic time and lower bound problems
Application of the Diffusion Approximation to Queueing Networks II: Nonequilibrium Distributions and Applications to Computer Modeling
An Algorithm for the K Best Solutions of the Resource Allocation Problem
Lower Bounds for Distributed Maximum-Finding Algorithms
Semiring-based constraint satisfaction and optimization
The IBM Type 702, An Electronic Data Processing Machine for Business
Flow-augmentation I: Directed graphs
Polynomial Bounds for the Grid-Minor Theorem
A Model-Theoretic Analysis of Knowledge
Busy periods for subnetworks in stochastic networks: mean value analysis
Robust wait-free hierarchies
Finding Zeros of Arbitrary Functions
A Feedback Queueing System With Batch Arrivals, Bulk Service, and Queue-Dependent Service Time
A Machine Method for Solving Polynomial Equations
An Accessing Model
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
Journal of the ACM - the beginnings
Single Function Shifting Counters
SWAC Experiments on the Use of Orthogonal Polynomials for Data Fitting
The Halting Problem for Probabilistic Context-Free Generators
Game Semantics for Interface Middleweight Java
Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces
Compositional Shape Analysis by Means of Bi-Abduction
Universally Composable Security
Best Least Squares Solutions to Finite Difference Equations Using the Generalized Inverse and Tensor Product Methods
The VLSI Complexity of Selected Graph Problems
Some Distribution-Free Aspects of Paging Algorithm Performance
Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data
Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
Discrete Orthonormal Sequences
Set Covering by an All Integer Algorithm: Computational Experience
Scheduling Independent Tasks with Due Times on a Uniform Processor System
Fast Interactive Coding against Adversarial Noise
More on "Amphisbaenic Sorting"
An optimal routing algorithm for mesh-connected Parallel computers
Two-Dimensional Voronoi Diagrams in the L p -Metric
Approximation via cost sharing: Simpler and better approximation algorithms for network design
PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric
Deterministic Pushdown Store Machines and Real-Time Computation
Abstraction in Query Processing
On counting homomorphisms to directed acyclic graphs
Complexity of parallel QR factorization
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Finding Optimal Demand Paging Algorithms
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
Parallel Algorithms for Data Compression
Accelerating List Processing in Discrete Programming
A Formalism for Program Translation
On Bateman's Method for Solving Linear Integral Equations
Group-Type Automata
On the Danilewski Method
Analysis of Factorial Experiments Using Generalized Matrix Operations
Busy Period Analysis of a Time-Sharing System: transform inversion
Waiting Lines and Times in a System with Polling
Equivalence between priority queues and sorting
Automated Proofs of Object Code for a Widely Used Microprocessor
Addressable Data Graphs
Asymptotically tight bounds on time-space trade-offs in a pebble game
Inversion of Modified Symmetric Matrices
Prevention of Propagation of Machine Errors in Long Problems
Cosmological lower bound on the circuit complexity of a small problem in logic
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
Asymptotic Expansions for Large Closed Queuing Networks
A General Translation Program for Phrase Structure Languages
Adaptive simulated annealing: A near-optimal connection between sampling and counting
On Asymptotic Estimates in Switching and Automata Theory
The complexity of XPath query evaluation and XML typing
Optimality of the Fast Fourier transform
The Complexity of LALR(k) Testing
Methods of Search for Solving Polynomial Equations
A Note on Feedback Queues with Bulk Service
Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks
An Investigation of Real-Time Solution of the Transportation Problem
Correct and Complete Type Checking and Certified Erasure for Coq, in Coq
Some Aspects of Hierarchical Memory Systems
Semi-Automatic Allocation of Data Storage for PACT I
Planar Graphs Have Bounded Queue-Number
A Unifying View of Some Linear Herbrand Procedures
Indexed Grammars - An Extension of Context-Free Grammars
Erratum: "Two heads are better that two tapes"
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation
Organization of Large Scale Fourier Processors
Space-Time Trade-Offs for Banded Matrix Problems
Algorithms for Parallel-Search Memories
The parallel complexity of exponentiating polynomials over finite fields
Making abstract interpretations complete
Efficiency of a Good But Not Linear Set Union Algorithm
A Minimum Variance Sampling Technique for Simulation Models
Forbidden information
Optimal Design of Linear Storage Hierarchies
A Theory of Program Size Formally Identical to Information Theory
A Predictor-Corrector Algorithm with an Increased Range of Absolute Stability
Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution
A Complete Mechanization of Second-Order Type Theory
AdWords and generalized online matching
Conference on Matrix Computations (Abstracts)
Simplification of the Covering Problem with Application to Boolean Expressions
An Automatic Sequencing Procedure with Application to Parallel Programming
Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Analysis of Database Performance with Dynamic Locking
The mutual exclusion problem: partII - statement and solutions
Dense Hierarchies of Grammatical Families
Smallest-Last Ordering and clustering and Graph Coloring Algorithms
An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
Program and Addressing Structure in a Time-Sharing Environment
On the Zeros of Exponential Polynomials
On deciding well-definedness for query languages on trees
The Share 709 System: Machine Implementation of Symbolic Programming
Uniform Hashing Is Optimal
On Monotone Decomposable Operators
Parallel Prefix Computation
Shifting Graphs and Their Applications
Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation
GO Is Polynomial-Space Hard
Some Analytical Procedures for Computers and Their Applications to a Class of Multidimensional Integrals
Problems in Acceptance Testing of Digital Computers
Tight failure detection bounds on atomic object implementations
Ultimate-Definite and Symmetric-Definite Events and Automata
On Single vs. Triple Address Computing Machines
Z-Module Reasoning: An Equality-Oriented Proving Method with Built-in Ring Axioms
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem
Separating Nondeterministic Time Complexity Classes
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
Are Wait-Free Algorithms Fast?
A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance
Invited article foreword
Extremal Scheduling of Parallel Processing with and without Real-Time Constraints
Persistence-Based Clustering in Riemannian Manifolds
Some A-Stable and L-Stable Methods for the Numerical Integration of Stiff Ordinary Differential Equations
Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
A generalized algorithm for centrality problems on trees
A Numerical Method of Solving a Heat Flow Problem with Moving Boundary
On the Syntax of Algorithmic Languages
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages
Algorithms adapting to point contention
The Well-Founded Semantics for General Logic Programs
Market equilibrium via a primal-dual algorithm for a convex program
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System
Linear-Time Approximation for Maximum Weight Matching
Fixpoint logics, relational machines, and computational complexity
Scheduling for Minimum Total Loss Using Service Time Distributions
A Note on the Efficiency of Hashing Functions
On Some Error Bounds of Givens
A Note on a Method of Computing the Gamma Function
Transitions 1959-1964
On the Decidability of Grammar Problems
Some Properties of Predicate Transformers
Note Concerning the Algebraic Theory of Automata
The Compilation of Regular Expressions into Integrated Circuits
Complex Properties of Grammars
New combinatorial topology bounds for renaming: The upper bound
Efficient Computation of Fourier Inversion for Finite Groups
Monitoring Metric First-Order Temporal Properties
A Fixed Optimum Cell-Size for Records of Various Lengths
The Automorphism Group of the Direct Product of Strongly Related Automata
Some Topics in Code Optimization
Tshebysheff Approximations for Power Series
Foundations of Context-aware Preference Propagation
A Mechanical Proof of the Unsolvability of the Halting Problem
Amphisbaenic Sorting
Preemptive Scheduling with Release Times, Deadlines, and Due Times
Control System Model for Critically Timed Sources
The Area-Time Complexity of Binary Multiplication
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Further Results on the Problem of Finding Minimal Length Programs for Decision Tables
Data Flow Analysis for Procedural Languages
Some Experiments in Ideal Factorization on the MIDAC
Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization
Bounds on delays and queue lengths in input-queued cell switches
On Almost Everywhere Complex Recursive Functions
On Context-Free Languages
Convergence of Multipoint Iterative Methods
On the completeness of object-creating database transformation languages
Depth-First Search and Kuratowski Subgraphs
On Pointers versus Addresses
Approximation in stochastic scheduling: the power of LP-based priority policies
On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
Contention resolution with constant expected delay
Resolution Strategies as Decision Procedures
On sufficient conditions for unsatisfiability of random formulas
On the Tape Complexity of Deterministic Context-Free Languages
On a Continuous Method of Approximating Solutions of the Heat Equation
The Effect of a Capacity Constraint on the Minimal Cost of a Partition
On the Numerical Solution of Characteristic Equations in Flutter Analysis
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Some New Bounds on the Condition Numbers of Optimally Scaled Matrices
Erratum: "An axiomatic approach to code optimization for expressions"
Preemptive Scheduling of Uniform Processor Systems
Subresultants and Reduced Polynomial Remainder Sequences
A Fast Algorithm for Optimal Length-Limited Huffman Codes
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus
Priority sampling for estimation of arbitrary subset sums
Knowledge Compilation and Theory Approximation
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
Upper Bounds for the Total Path Length of Binary Trees
Solution of Ordinary Differential Equations Using Two "Off-Step" Points
Computatbility theory of generalized functions
A Simple Planarity Criterion
Simple Representations of Certain Classes of Languages
New Methods in Automatic Extracting
Nonconstructive tools for proving polynomial-time decidability
Minimal degrees for polynomial reducibilities
On computing all abductive explanations from a propositional Horn theory
Memory-Constrained Task Scheduling on a Network of Dual Processors
Communication Steps for Parallel Query Processing
Multivariate Polynomial Factorization
Producing Computer Instructions for the PACT I Compiler
Adding nesting structure to words
The complexity of obstruction-free implementations
Tight Lower Bounds on Graph Embedding Problems
The Logic of Automata - Part II
A new class of heuristic algorithms for weighted perfect matching
Highway Dimension and Provably Efficient Shortest Path Algorithms
A Formal System for Differentiation
Some Results on Multicategory Pattern Recognition
Two-Dimensional Parity Checking
Generalized Inverse Computations Using the Gradient Projection Method
Flow Switching Approach to the Maximum Flow Problem: I
Edge-disjoint routing in plane switch graphs in linear time
Removing and Adding Edges for the Traveling Salesman Problem
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields
Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Length
Predictor-Corrector Methods of High Order With Improved Stability Characteristics
A Mathematical Method for the Automatic Scaling of a Function
The Log-Approximate-Rank Conjecture Is False
Numerical Solution of Systems of Nonlinear Equations
Hard-Core Theorems for Complexity Classes
A Code for the Transportation Problem of Linear Programming
A transaction-based approach to relational database specification
Upward Max-Min Fairness
General Strong Polarization
High Order Search Methods for Finding Roots
A Combinatorial, Primal-Dual Approach to Semidefinite Programs
The Sequence Equivalence Problem is Decidable for 0S Systems
On Databases with Incomplete Information
An Optimal On-Line Algorithm for Metrical Task System
A Note Concerning Nondeterministic Tape Complexities
A Uniform Random Number Generator Based on the Combination of Two Congruential Generators
Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes
Self-stabilizing clock synchronization in the presence of Byzantine faults
Vertex Connectivity in Poly-logarithmic Max-Flows
Frege Systems for Quantified Boolean Logic
A Method for Transposing a Matrix
Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem
A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations
Application of the Method of Lines to Parabolic Partial Differential Equations With Error Estimates
Transforming LR(k) Grammars to LR(1), SLR(1), and (1, 1) Bounded Right-Context Grammars
A Numerical Method for Solving Control Differential Equations on Digital Computers
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
Computers Then and Now
Properly Learning Decision Trees in almost Polynomial Time
A Kutta Third-Order Procedure for Solving Differential Equations Requiring Minimum Storage
Three Levels of Linguistic Analysis in Machine Translation
Preservation of unambiguity and inherent ambiguity in context-free languages
Stochastic Games with Synchronization Objectives
Errata and Comments on a Paper by J. R. Cash
Simulation of Digital Filters on an Electronic Analog Computer
A Sufficient Condition for Backtrack-Bounded Search
All-pairs shortest paths in O ( n 2 ) time with high probability
Error Analysis of Direct Methods of Matrix Inversion
Calculations with Pseudo-Random Numbers
How to share memory in a distributed system
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity
Topological Characterization of Consensus in Distributed Systems
All Algebraic Functions Can Be Computed Fast
Realization of Input-Output Relations by Sequential Machines
Exponential bounds with applications to call admission
Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices
Priority Disciplines in a Loop System
The Parallel Complexity of Simple Logic Programs
Recompression: A Simple and Powerful Technique for Word Equations
Canonical Precedence Schemes
Oscillating Sort - A New Sort Merging Technique
A Unified Translation of Linear Temporal Logic to ω-Automata
The Power of Localization for Efficiently Learning Linear Separators with Noise
Connectivity and Reversibility in Automata
Approximation Resistance from Pairwise-Independent Subgroups
Analysis of Graphs by Connectivity Considerations
Fast algorithms for N-dimensional restrictions of hard problems
Designing Programs that Check Their Work
Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations
Using expander graphs to find vertex connectivity
On the power and limitations of strictness analysis
The Complexity of Mean-Payoff Pushdown Games
New Techniques for Noninteractive Zero-Knowledge
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time
Pseudo-Runge-Kutta Methods of the Fifth Order
A Machine Representation of Finite T 0 Topologies
The polynomial-time hierarchy and sparse oracles
On the Complexity of Universal Leader Election
Convergence Estimates for the Distribution of Trailing Digits
Distributed Random Walks
Asynchronous gossip
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications
Tables for the Step-by-Step Integration of Ordinary Differential Equations of the First Order
The Complexity of Probabilistic Verification
A Multistep Generalization of Runge-Kutta Methods With Four or Five Stages
PACT Loop Expansion
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization
Average case selection
Space-Bounded Probabilistic Game Automata
Theorem Proving Using Equational Matings and Rigid E-Unification
Randomized parallel communications on an extension of the omega network
A logarithmic time sort for linear size networks
The Complexity and Expressive Power of Limit Datalog
Database Location in Computer Networks
Pact IA
The security of all RSA and discrete log bits
A Note on Microprogramming
Market equilibrium under separable, piecewise-linear, concave utilities
Recursive Formulas for the Evaluation of the Convolutions Integral
The Art Gallery Problem is ∃ℝ-complete
The harmonic k -server algorithm is competitive
Sampling from large matrices: An approach through geometric functional analysis
Algorithms for Scheduling Tasks on Unrelated Processors
Higher Order Differences in the Analogue Solution of Partial Differential Equations
A Note on Multiple Error Detection in ASCII Numeric Data Communication
Report on Experiments in Approximating the Solution of a Differential Equation
Footnote to a Recent Paper
Regenerative Simulation with Internal Controls
Recursive Computation of Certain Integrals
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Distributed bisimulations
The geometric maximum traveling salesman problem
"Direct Search" Solution of Numerical and Statistical Problems
Determining approximate shortest paths on weighted polyhedral surfaces
On the Vibration of a Square Clamped Plate
Sketching Approximability of All Finite CSPs
A Modified Multistep Method for the Numerical Integration of Ordinary Differential Equations
Update: Time to publication statistics
Digital Computer System for Dynamic Analysis of Speech and Sound Feedback Mechanisms
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
Digital One-Third Octave Spectral Analysis
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets
Extended Horn Sets In Propositional Logic
On Mappings for Modular Arithmetic, I
Size complexity in context-free grammars forms
Finite State Verifiers II: Zero Knowledge
Optimality Properties of Multiple-Key Hashing Functions
Number-theoretic constructions of efficient pseudo-random functions
Nonoblivious Hashing
An Algorithm for Reconstructing Protein and RNA Sequences
Solving Linear Programs in the Current Matrix Multiplication Time
Analysis of Effectiveness of Retrieval in Clustered Files
Polynomial Multiplication over Finite Fields in Time \( O (n \log n) \)
The Format Model: A Theory of database Organization
On driving many long wires in a VLSI layout
Erratum: "A Local Visual Operator Which Recognizes Edges and Lines"
A Generalization of a Theorem of Carr on Error Bounds for Rung-Kutta Procedures
A model for concurrency in nested transactions systems
Linear-time disk-based implicit graph search
Integer Programming Formulation of Traveling Salesman Problems
Bidirectional Heuristic Search Again
Some Exact Complexity Results for Straight-Line Computations over Semirings
On Linear Potential Functions for Approximating Bayesian Computations
External Hashing Schemes for Collections of Data Structures
Amplifying lower bounds by means of self-reducibility
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
Linear L 1 Approximation for a Discrete Point Set and L 1 Solutions of Overdetermined Linear Equations
Aggregate operators in probabilistic databases
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
Linear work suffix array construction
Dynamic Indexability and the Optimality of B-Trees
Erratum: "Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System"
On the Convergence of Matrix Iterations
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
Corrigendum: "Some Topics in Code Optimization"
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
Optimization of Static Loading and Sizing of Multilevel Memory Systems
Data compression via textual substitution
Boundary and Object Detection in Real World Images
Parameterized Intractability of Even Set and Shortest Vector Problem
Global Data Flow Analysis and Iterative Algorithms
Operations Which Preserve Definability in Languages
A Time-Sharing Queue with a Finite Number of Customers
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
Querying Regular Graph Patterns
Computational Aids for Determining the Minimal Form of a Truth Function
Eliminating go to's while preserving program structure
Implicit vs. Explicit Recurrence Formulas for the Linear Diffusion Equation
Tuple sequences and lexicographic indexes
Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
Bounding Fan-out in Logical Networks
An Example of Information and Computation Resource Trade-Off
Sparse Dynamic Programming I: Linear Cost Functions
Contributions to the Theory of Logic Programming
Correctness properties in a shared-memory parallel language
Permutation Graphs and Transitive Graphs
An On-Line Edge-Deletion Problem
Software reliability via run-time result-checking
Approximating extent measures of points
Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
Attribute-Based Encryption for Circuits
The Ford-Johnson Sorting Algorithm Is Not Optimal
Some Programming Techniques for the ERMETH
A Transformation System for Developing Recursive Programs
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
On an Application of Dynamic Programming to the Synthesis of Logical Systems
Resolution With Merging
Zeros of Nonlinear Functions
On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
Corrigendum: "Allocating Storage for Extendible Arrays"
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space
Unreliable Failure Detectors for Reliable Distributed Systems
A note on the height of binary search trees
On the Optimality of Some Set Algorithms
Stability and Stabilizability of Discrete Event Dynamic Systems
Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation
Relations Between Time and Tape Complexities