The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Program design by informal English descriptions (Q3668828) (← links)
- Replacing Square Roots by Pythagorean Sums (Q3670432) (← links)
- Random sampling with a reservoir (Q3675518) (← links)
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3675541) (← links)
- An Algorithm for the General Petri Net Reachability Problem (Q3677184) (← links)
- NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185) (← links)
- Equilibrium Analysis of Disaggregate Facility Choice Systems Subject to Congestion-Elastic Demand (Q3677474) (← links)
- Development of the ALOHANET (Q3677643) (← links)
- A Best Possible Heuristic for the <i>k</i>-Center Problem (Q3680584) (← links)
- Finding approximate patterns in strings (Q3681960) (← links)
- A Time-dependent Stopping Problem with Application to Live Organ Transplants (Q3683890) (← links)
- Disappointment in Decision Making Under Uncertainty (Q3686377) (← links)
- A public key cryptosystem and a signature scheme based on discrete logarithms (Q3689092) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- A taxonomy of problems with fast parallel algorithms (Q3694688) (← links)
- A Linear Recognition Algorithm for Cographs (Q3694709) (← links)
- ε-Approximations for Multidimensional Weighted Location Problems (Q3694957) (← links)
- Spaces for the assessment of knowledge (Q3703314) (← links)
- An efficient algorithm for the “stable roommates” problem (Q3703906) (← links)
- Finding minimal enclosing boxes (Q3704926) (← links)
- AVL-trees for localized search (Q3716309) (← links)
- On Fan's minimax theorem (Q3717690) (← links)
- On Approximation Algorithms for # P (Q3718150) (← links)
- Average Case Complete Problems (Q3718151) (← links)
- An average case analysis of Floyd's algorithm to construct heaps (Q3718164) (← links)
- Simultaneous Security of Bits in the Discrete Log (Q3718620) (← links)
- An essay on continued fractions (Q3718664) (← links)
- Automatic verification of finite-state concurrent systems using temporal logic specifications (Q3719811) (← links)
- Hash functions for priority queues (Q3719870) (← links)
- Triangulating Simple Polygons and Equivalent Problems (Q3721847) (← links)
- Linear Programming for Finite State Multi-Armed Bandit Problems (Q3722294) (← links)
- Inefficiency of Nash Equilibria (Q3722301) (← links)
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem (Q3722413) (← links)
- The complexity of promise problems with applications to public-key cryptography (Q3722415) (← links)
- Global convergence and empirical consistency of the generalized Lloyd algorithm (Q3724220) (← links)
- Models for Design and Control of Stochastic, Multi-Item Batch Production Systems (Q3725850) (← links)
- Algebraical Structures of Cryptographic Transformations (Q3728809) (← links)
- A compact representation for permutation groups (Q3731029) (← links)
- A forward algorithm for a generalized wheat trading model (Q3731341) (← links)
- Semantic confluence tests and completion methods (Q3732980) (← links)
- A Simple Unpredictable Pseudo-Random Number Generator (Q3738458) (← links)
- Optimal Point Location in a Monotone Subdivision (Q3738618) (← links)
- A pyramid vector quantizer (Q3739046) (← links)
- Constructing Arrangements of Lines and Hyperplanes with Applications (Q3740283) (← links)
- Finding a Maximum Clique in an Arbitrary Graph (Q3741641) (← links)
- A new upper bound for Shellsort (Q3742727) (← links)
- On the parallel Risch Algorithm (II) (Q3745270) (← links)
- Efficient algorithms for finding maximum matching in graphs (Q3745302) (← links)
- Single bend wiring (Q3745779) (← links)
- The NP-completeness column: an ongoing guide (Q3747723) (← links)
