yusuke1997/dblp-id-title huggingface dataset:
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable
Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
The Complexity of Maintaining an Array and Computing Its Partial Sums
Towards an Algebraic Theory of Recursion
The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication
Nondeterministic Algorithms
Computational Work and Time on Finite Machines
A Local Visual Operator Which Recognizes Edges and Lines
A discriminative model for semi-supervised learning
A model for distributed systems based on graph rewriting
On the Existence of Equilibria in Noncooperative Optimal Flow Control
Formally Reasoning About Quality
Corrigendum: "On the Boolean Matrix Equation M..."
Automatic Controlled Precision Calculations
Nonlinear Interpolation of Multivariable Functions by the Monte Carlo Method
Correction to "An equivalence between relational database dependencies and a fragment of propositional logic"
Methods for Fitting Rational Approximations, Part I: Telescoping Procedures for Continued Fractions
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Sequential Functions
Synthesis of a Class of Deadlock-Free Petri Nets
A Search Procedure for Hamilton Paths and Circuits
Realization of Events by Logical Nets
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
Allocating Storage for Extendible Arrays
The Time for a Round Trip in a Cycle of Exponential Queues
Polyhedral Clinching Auctions and the AdWords Polytope
Lattice problems in NP cap coNP
Proving Properties of Complex Data Structures
An Analysis of ML Typability
A Note on "A Note on Multiple Error Detection in ASCII Numeric Data Communication"
On Network Linguistics and the Conversational Design of Queueing Networks
Path Detection in Multidimensional Iterative Arrays
An Elimination Method for Computing the Generalized Inverse of an Arbitrary Complex Matrix
The Influence of Data Base Characteristics and Usage on Direct Access File Organization
Resolution by Iteration of Some Nonlinear Systems
Finitely Specifiable Implicational Dependency Families
Calculating Open Loop Transfer Functions from Closed Loop Measurements
Efficiency of Computation of Cayley Tables of 2-Groups
A Dynamic Time-Sharing Priority Queue
Two Complete Axiom Systems for the Algebra of Regular Events
Errata: "Testing for the Church-Rosser Property"
Matrix Inversion Using Parallel Processing
Small Sample Algorithms for the Identification of Polynomials
Programmed Grammars and Classes of Formal Languages
Approximation Algorithms for Some Postman Problems
Approximate Mean Value Analysis Algorithms for Queuing Networks: Existence, Uniqueness, and Convergence Results
On Small-depth Frege Proofs for Tseitin for Grids
Note on Hopcroft and Tarjan's Planarity Algorithm
Representation of Power Series in Terms of Polynomials, Rational Approximations and Continued Fractions
The equivalence problem for real-time DPDAs
A Linear Time Algorithm for Deciding Subject Security
A Four Russians Algorithm for Regular Expression Pattern Matching
The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3
Minimal Sets of Distinct Literals for a Logically Passive Function
An Algorithm for Translating Boolean Expressions
On the Structure of Armstrong Relations for Functional Dependencies
Multiobjective A*
Use of Decomposition Theory in the Solution of the State Assignment Problem of Sequential Machines
Remote attribute grammars
Locating the Largest Word in a File Using a Modified Memory
A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means
On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference Equations
Some Binary Derivation Systems
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree
Alternating Direction Methods for Parabolic Systems in m Space Variables
Pure-Circuit: Tight Inapproximability for PPAD
Graph Problems on a Mesh-Connected Processor Array
QCSP Monsters and the Demise of the Chen Conjecture
Probabilistic Programming with Exact Conditions
Nonlinear Regression With Linear Constraints: An Extension of the Magnified Diagonal Method
Evaluating uniform expressions within two steps of minimum parallel time
Completeness of Rewrite Rules and Rewrite Strategies for FP
On the Church-Rosser property for the direct sum of term rewriting systems
The Unsolvability of the Recognition of Linear Context-Free Languages
Performance of Movable-Head Disk Storage Devices
Confluent and Other Types of Thue Systems
Comparing the combinational complexities of arithmetic functions
Bounding Errors Introduced by Clustering of Customers in Closed Product-Form Queueing Networks
Formalization of Properties of Functional Programs
A Correctness and Incorrectness Program Logic
On the Optimal Solutions to AND/OR Series-Parallel Graphs
Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
Estimating the Mean of a Correlated Binary Sequence with an Application to Discrete Event Simulation
A Descriptive Language for Symbol Manipulation
Stack Machines and Classes of Nonnested Macro Languages
Linear probing with a nonuniform address distribution
Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime
A Method for Finding All the Zeros of f(x)
Linear Programming in Linear Time When the Dimension Is Fixed
Solving Two-Commodity Transportation Problems with Coupling Constraints
Queueing Models for Computer Systems Connected by a Communication Line
The Cost of Conservative Synchronization in Parallel Discrete Event Simulations
On the Power of Bounded Concurrency II: Pushdown Automata
Fourier Analysis of Uniform Random Number Generators
Fast Hamiltonicity Checking Via Bases of Perfect Matchings
Fishspear: A Priority Queue Algorithm
Semantics Out of Context: Nominal Absolute Denotations for First-Order Logic and Computation
An Estimate of the Store Size Necessary for Dynamic Storage Allocation
Building tractable disjunctive constraints
A Translator-Oriented Symbolic Programming Language
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Asynchronous Iterative Methods for Multiprocessors
A Programming Language With Automatic Goal Generation and Selection
Connective Properties Preserved in Minimal State Machines
Gradual System F
Partial match retrieval of multidimensional data
Degrees of Acyclicity for Hypergraphs and Relational Database Schemes
Inferring sequences produced by pseudo-random number generators
Numerical Analysis of a Nonlinear Diffusion Problem
A Space-Economical Suffix Tree Construction Algorithm
The Complexity of Finite-Valued CSPs
Open Shop Scheduling to Minimize Finish Time
Asymptotic expansions for closed Markovian networks with state-dependent service rates
Analysis of Shift Register Counters
Determination of the conditional response for quantum allocation algorithms
On Certain Output-Buffer Management Techniques--A Stochastic Model
A-Stable Composite Multistep Methods
Lower bounds for processing data with few random accesses to external memory
Two-way balloon automata and AFL
Most Tensor Problems Are NP-Hard
Enumeration of Structured Flowcharts
Legality and Other Properties of Graph Models of Computations
A Linear-Time On-Line Recognition Algorithm for "Palstar"
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Parallel hashing: an efficient implementation of shared memory
New lower bounds for parallel computation
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Query-Based Data Pricing
Polynomial-time data reduction for dominating set
On the power of one-way communication
The expressibility of functions on the boolean domain, with applications to counting CSPs
Probability Models for Buffer Storage Allocation Problems
Modified Multistep Methods Based on a Nonpolynomial Interpolant
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Dynamic functional dependencies and database aging
Some Results Concerning the Reduction of Binary Matrices
Answering queries on embedded-complete database schemes
Truncation Error in the Graeffe Root-Squaring Method
Search Algorithms Under Different Kinds of Heuristics-A Comparative Study
Subrecursive Programming Languages, Part I: efficiency and program structure
Erratum: "Mechanical Theorem-Proving by Model Elimination"
Counting Subgraphs in Degenerate Graphs
Two Results on Ordering for Resolution with Merging and Linear Format
Taking Random Walks to Grow Trees in Hypercubes
Hardness of approximating the shortest vector problem in lattices
On XML integrity constraints in the presence of DTDs
An Approach for Finding C-Linear Complete Inference Systems
The performance of difference coding for sets and relational tables
The Closure Statement: A Programming Language Construct Allowing Ultraconcurrent Execution
A Temporal Logic Approach to Binding-Time Analysis
A Correction of the Termination Conditions of the Henschen-Naqvi Technique
Erratum: "Some Experiments in Ideal Factorization on the MIDAC"
Decidable and Undecidable Questions About Automata
A Golden Age for JACM
A Modified List Technique Allowing Binary Search
On the Optimality of the Probability Ranking Scheme in Storage Applications
Performance Measures for Ordered Lists in Random-Access Files
On Canonical Forms and Simplification
Variations on the Common Subexpression Problem
Finite Difference Scheme for a Third Boundary Value Problem
Some Hamilton Paths and a Minimal Change Algorithm
Dense quantum coding and quantum finite automata
Weak and Mixed Strategy Precedence Parsing
An Analysis of Some Graph Theoretical Cluster Techniques
A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars
Simulating Stable Stochastic Systems, II: Markov Chains
Fast Algorithms for Solving Path Problems
Computational Complexity of One-Tape Turing Machine Computations
Matching algorithmic bounds for finding a Brouwer fixed point
The effectiveness of lloyd-type methods for the k-means problem
Errata: "On the Periodic Representations and the Reducibility of Periodic Automata"
A Multiple Purpose Orthonormalizing Code and its Uses
On the sorting-complexity of suffix tree construction
Compositional refinement of interactive systems
Complexity of Network Synchronization
Relational queries over interpreted structures
Adversarial queuing theory
The Impossibility of Implementing Reliable Communication in the Face of Crashes
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
Fifth-Order Methods for the Numerical Solution of Ordinary Differential Equations
Time-space lower bounds for satisfiability
Exact Aggregation in Exponential Queueing Networks
A Test for Instability in the Numerical Solution of Ordinary Differential Equations
The Matching Polytope has Exponential Extension Complexity
Satisfiability of word equations with constants is in PSPACE
The Jacobi Method for Real Symmetric Matrices
A Mean Square Estimate of the Generated Roundoff Error in Constant Matrix Iterative Processes
Organization of a "Fixed-Plus-Variable" Structure Computer for Computation of Eigenvalues and Eigenvectors of Real Symmetric Matrices
Integrals with a Kernel in the Solution of Nonlinear Equations in N Dimensions
Processing Times for Segmented Jobs with I/O Compute Overlap
A Completeness Theorem for Straight-Line Programs with Structured Variables
An Observation on Relative Parsing Time
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code
Universal-stability results and performance bounds for greedy contention-resolution protocols
Separations in Query Complexity Based on Pointer Functions
Simulating Stable Stochastic Systems, I: General Multiserver Queues
Use of Multiwrite for General Programmability of Search Memories
Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping
Input Data Source Limitations for Real-Time Operation of Digital Computers
LSH-Preserving Functions and Their Applications
Sequencing Jobs with Stochastic Task Structures on a Single Machine
Monotone versus positive
Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages
Orbit-finite Linear Programming
On the family of generalized dependency constraints
Engineering with Logic: Rigorous Test-Oracle Specification and Validation for TCP/IP and the Sockets API
Time to Publication: A Progress Report
Optimization Among Provably Equivalent Programs
Sort sets in the relational model
Pseudo-Runge-Kutta Methods Involving Two Points
Early Stopping in Byzantine Agreement
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna
Erratum: P. van Beek and R. Dechter's theorem on constraint looseness and local consistency
A Direct Method for Chebyshev Approximation by Rational Functions
Statistical Properties of the Buddy System
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
Representing Graphs by Knuth Trees
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
Fast Multivariate Multipoint Evaluation over All Finite Fields
Analysis of Remote Terminal Backlogs under Heavy Demand Conditions
Upper and Lower Bounds on Switching Energy in VLSI
Efficiency of a Binary Comparison Storage Technique
Information Content of Programs and Operation Encoding
A Semi-Decision Procedure for the Functional Calculus
A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
The Reachability Problem for Two-Dimensional Vector Addition Systems with States
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
The Local Lemma Is Asymptotically Tight for SAT
Fooling Polytopes
Closures of Database Hypergraphs
Form and Content in Computer Science (1970 ACM turing lecture)
Slowing down sorting networks to obtain faster sorting algorithms
Storage Requirements for Information Handling Centers
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
On the Consistency of Precedence Matrices
Speedup in Parallel Algorithms for Adaptive Quadrature
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Tape Searching Techniques
From Real-time Logic to Timed Automata
Continuous sampling from distributed streams
Locally-iterative Distributed (Δ + 1)-coloring and Applications
Efficient Planarity Testing
Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach
Behavioral theory for mobile ambients
Space and Time Hierarchies for Classes of Control Structures and Data Structures
The Cost of Fault Tolerance in Multi-Party Communication Complexity
Quasi-Newton Methods for Nonlinear Equations
An Algorithm for the Numerical Application of a Linear Operator
Time lower bounds for implementations of multi-writer snapshots
A VLSI Decomposition of the deBruijn Graph
Input-Error-Limiting Automata
An analysis of the Burrows-Wheeler transform
The Marriage of Univalence and Parametricity
Convex quadratic and semidefinite programming relaxations in scheduling
Boosting textual compression in optimal linear time
Algebraic Laws for Nondeterminism and Concurrency
A note on probabilistically verifying integer and polynomial products
On the Communication Complexity of Distributed Algebraic Computation
A unified framework for race analysis of asynchronous networks
Constraint tightness and looseness versus local and global consistency
On the Boolean Matrix Equation M...
On the Sum-of-Squares algorithm for bin packing
Approximating the partition function of the ferromagnetic potts model
Capacity Upper Bounds for Deletion-type Channels
Optimal Decision Functions for Computer Character Recognition
Corrigendum: "PL360, a Programming Language for the 360 Computers"
Unitary Triangularization of a Nonsymmetric Matrix
The Isomorphism Conjecture Fails Relative to a Random Oracle
Scaling for Numerical Stability in Gaussian Elimination
A Lower Bound on the Complexity of Orthogonal Range Queries
Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors
Matroid Secretary Problems
The Change-Making Problem
The Expression of Algorithms by Charts
Convergence of datalog over (Pre-) Semirings
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead
Geometric Embeddability of Complexes is ∃ℝ-complete
Towards a complexity theory for local distributed computing
The combinatorics of local constraints in model-based recognition and localization from sparse data
Error Bounds for the Runge-Kutta Single-Step Integration Process
Fast Algorithms for ℓ p -Regression
Arcs and Curves in Digital Pictures
Machine Features for a More Automatic Monitoring System on Digital Computers
Efficient generation of shared RSA keys
Bounds on Optimal Merge Performance, and a Strategy for Optimality
Using dual approximation algorithms for scheduling problems theoretical and practical results
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Linear Hash Functions
Routing through a rectangle
Threshold Logic Elements Used as a Probability Transformer
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Erratum: "Automorphisms of polyadic automata"
Delegating Computation: Interactive Proofs for Muggles
Computing All Maps into a Sphere
On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
Monotonic reductions, representative equivalence, and compilation of intractable problems
On the Complexity of Cache Analysis for Different Replacement Policies
Probability Models for Multiprogramming Computer Systems
Efficient Normalization of Linear Temporal Logic
Testing of Operational Amplifiers
Mini-buckets: A general scheme for bounded inference
Compact oracles for reachability and approximate distances in planar digraphs
Controllability of Nonlinear Sequential Networks
Queueing Analysis of the IBM 2314 Disk Storage Facility
A Method for the Solution of Roots of a Nonlinear Equation and for Solution of the General Eigenvalue Problem
Introduction to PODS 2007 special section
Smooth Approximation of Lipschitz Maps and Their Subgradients
Frontier search
Message Waiting Time in a Packet Switching System
SKIP + : A Self-Stabilizing Skip Graph
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
A Document Storage Method Based on Polarized Distance
Single-Scan Techniques for the Translation of Arithmetic Expressions into ALGOL 60
On the minimization of XPath queries
On The Ambiguity Problem of Backus Systems
On the impact of combinatorial structure on congestion games
A simple min-cut algorithm
The performance of a precedence-based queuing discipline
Should Tables Be Sorted?
A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory
Reaching approximate agreement in the presence of faults
An Adaptation of the Fast Fourier Transform for Parallel Processing
Inversion of Triple-Diagonal Compound Matrices
Existential second-order logic over strings
Augmenting Parsers to Support Incrementality
Error Rates for Two Methods of Statistical Pattern Recognition
A Correction Concerning Resolution
Fast context-free grammar parsing requires fast boolean matrix multiplication
An Evaluation of Runge-Kutta Type Methods for Higher Order Differential Equations
Recursive Properties of Abstract Complexity Classes
Reply to Williams and White's Note
Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
Bar Induction is Compatible with Constructive Type Theory
An application of number theory to the organization of raster-graphics memory
Ordered Chaining Calculi for First-Order Theories of Transitive Relations
Large Parallel Computers
A Direct Descent Binary Knapsack Algorithm
Statistical Determination of Certain Mathematical Constants and Functions Using Computers
A characterization of first-order topological properties of planar spatial data
Efficiency of Predictor-Corrector Procedures
Placement of Records on a Secondary Storage Device to Minimize Access Time
The Share 709 System: Programming and Modification
Minimum cuts in near-linear time
Register-machine based processes
Corrigendum: "The Automorphism Group of the Direct Product of Strongly Related Automata"
Color-Coding
Module Algebra
The Generation of Optimal Code for Arithmetic Expressions
Alpha-structural recursion and induction
Theorem-Proving on the Computer
Computer Interval Arithmetic: Definition and Proof of Correct Implementation
Sorting on Electronic Computer Systems
Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input
Convex Separable Optimization Is Not Much Harder than Linear Optimization
A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus
Stability of a Numerical Solution of Differential Equations
An Error Bound for a Numerical Filtering Technique
Optimal Arrangement of Keys in a Hash Table
Iterative Aggregation/Disaggregation Techniques for Nearly Uncoupled Markov Chains
Corrigendum: "The Area-Time Complexity of Binary Multiplication"
Invariance of complexity measures for networks with unreliable gates
Distributions of packet delay and interdeparture time in slotted ALOHA and carrier sense multiple access
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints
On the impossibility of dimension reduction in l 1
Automatic Document Classification
The Power of Simple Tabulation Hashing
Sequential Machines, Ambiguity, and Dynamic Programming
On the discrepancy of GFSR pseudorandom numbers
Algebraic Structures with Hard Equivalence and Minimization Problems
5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
On the Inversion Complexity of a System of Functions
Sequential Processing Machines (S.P.M) Analyzed With a Queuing Theory Model
Wind Tunnel Data Reduction Using Paper-Tape Storage Media
Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
Sparse Dynamic Programming II: Convex and Concave Cost Functions
The Generation of Binary Trees as a Numerical Problem
On J-maximal and J-minimal Flow-Shop Schedules
One-way stack automata
Efficient Algorithms for Shortest Paths in Sparse Networks
A General Approach to Connected-Component Labelling for Arbitrary Image Representations
Corrigendum: "A Permutation Network"
Computing a Subinterval of the Image
Determining the Equivalence of Algebraic Expressions by Hash Coding
RS -Machines with Almost Blank Tape
Some Complexity Results for Matrix Computations on Parallel Processors
Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
Statistical Complexity of Algorithms for Boolean Function Minimization
Calculating the Eigenvectors of Diagonally Dominant Matrices
On the complexity of integer programming
A Mean Value Performance Model for Locking in Databases: The No-Waiting Case
An Algorithm for the Inversion of Block Matrices of Toeplitz Form
Input-Output Buffering and Fortran
Generalized hypertree decompositions: NP-hardness and tractable variants
Finite Automata, Pattern Recognition and Perceptrons
An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency
The PACT I Coding System for the IBM Type 701
An axiomatic approach to personalized ranking systems
A random-sampling-based algorithm for learning intersections of halfspaces
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Polylogarithmic independence fools AC 0 circuits
Distribution sort with randomized cycling