The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- The Complexity of Enumeration and Reliability Problems (Q3853129) (← links)
- Towards more portable COBOL (Q3860845) (← links)
- Fast Approximation Algorithms for Knapsack Problems (Q3861164) (← links)
- Classes of Pebble Games and Complete Problems (Q3862399) (← links)
- <i>n</i>‐cubes and median graphs (Q3863918) (← links)
- Continuation-Based Program Transformation Strategies (Q3867165) (← links)
- Extension to the maximum entropy method II (Q3873362) (← links)
- GO Is Polynomial-Space Hard (Q3873542) (← links)
- Reaching Agreement in the Presence of Faults (Q3873545) (← links)
- New directions in cryptography (Q3875826) (← links)
- A note on perfect duality and limiting lagrangeans (Q3880596) (← links)
- Mean-Value Analysis of Closed Multichain Queuing Networks (Q3883485) (← links)
- Concurrent manipulation of binary search trees (Q3883522) (← links)
- Secure statistical databases with random sample queries (Q3883574) (← links)
- A comparison of programming languages for software engineering (Q3885166) (← links)
- The Relaxation Method for Solving Systems of Linear Inequalities (Q3885509) (← links)
- Converting Linear Programs to Network Problems (Q3885552) (← links)
- Parallel Prefix Computation (Q3890136) (← links)
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix (Q3891677) (← links)
- The Optimal Choice of a Subset of a Population (Q3892059) (← links)
- Eliminating extraneous edges in Greenberg's algorithm (Q3892062) (← links)
- Orthogonal Packings in Two Dimensions (Q3893334) (← links)
- Waiting Time In a Multi-Server Cutoff-Priority Queue, and Its Application to an Urban Ambulance Service (Q3896816) (← links)
- Recognizing disguised NR(1) instances of the satisfiability problem (Q3898029) (← links)
- Cyclic Scheduling via Integer Programs with Circular Ones (Q3898330) (← links)
- A Stochastic Service Network Model with Application to Hospital Facilities (Q3899804) (← links)
- Some NP-Complete Problems Similar to Graph Isomorphism (Q3902476) (← links)
- The theory and computation of evolutionary distances: Pattern recognition (Q3902542) (← links)
- Heavy-Traffic Limits for Queues with Many Exponential Servers (Q3903837) (← links)
- Expected Length of the Longest Probe Sequence in Hash Code Searching (Q3906430) (← links)
- Instrumental Variable Algorithms for Multiple Input Systems Described by Multiple Transfer Functions (Q3908877) (← links)
- A linear-time approximation algorithm for the weighted vertex cover problem (Q3910012) (← links)
- A linear algorithm for computing the visibility polygon from a point (Q3910036) (← links)
- Probabilistic Algorithms in Finite Fields (Q3910619) (← links)
- Connected Component Labeling Using Quadtrees (Q3912065) (← links)
- A Unification Algorithm for Associative-Commutative Functions (Q3912070) (← links)
- A normal form for relational databases that is based on domains and keys (Q3912084) (← links)
- Generating coset representatives for permutation groups (Q3913569) (← links)
- An analysis of parallel-read sequential-write systems (Q3914422) (← links)
- Efficient locking for concurrent operations on B-trees (Q3917524) (← links)
- The minimum-length generator sequence problem is NP-hard (Q3920644) (← links)
- Parallel Matrix and Graph Algorithms (Q3922163) (← links)
- A Lower Bound to Finding Convex Hulls (Q3922189) (← links)
- Direct theorems in semi-infinite convex programming (Q3923950) (← links)
- Generating gamma variates by a modified rejection technique (Q3925781) (← links)
- Breaking paragraphs into lines (Q3926032) (← links)
- On Etol Systems with Finite Tree-Rank (Q3926054) (← links)
- The NP-Completeness of Edge-Coloring (Q3928241) (← links)
- Heuristics for the fixed cost median problem (Q3929508) (← links)
- Determination of Optimal Variable-Sized Multiple-Block Appointment Systems (Q3929519) (← links)
