The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- A linear space algorithm for computing maximal common subsequences (Q4055176) (← links)
- Efficient string matching (Q4055184) (← links)
- A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String (Q4061953) (← links)
- Multidimensional binary search trees used for associative searching (Q4062679) (← links)
- Guarded commands, nondeterminacy and formal derivation of programs (Q4066568) (← links)
- Algorithms on circular-arc graphs (Q4067141) (← links)
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (Q4072866) (← links)
- The Change-Making Problem (Q4074676) (← links)
- Matroid intersection algorithms (Q4077061) (← links)
- Precision Weighting—An Effective Automatic Indexing Method (Q4077440) (← links)
- On self-organizing sequential search heuristics (Q4079040) (← links)
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) (Q4085609) (← links)
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question (Q4086709) (← links)
- Fast Multiple-Precision Evaluation of Elementary Functions (Q4088201) (← links)
- Definierbare Funktionen imλ-Kalkül mit Typen (Q4094854) (← links)
- Bounds for Multiprocessor Scheduling with Resource Constraints (Q4099212) (← links)
- Technical Note—Exact Solutions of Inexact Linear Programs (Q4102909) (← links)
- Conceptual Graphs for a Data Base Interface (Q4107915) (← links)
- Macro SPITBOL—a SNOBOL4 compiler (Q4109278) (← links)
- Efficient Algorithms for Shortest Paths in Sparse Networks (Q4111093) (← links)
- On fast M-sequence transforms (Corresp.) (Q4113748) (← links)
- A Comparison of Several Bandwidth and Profile Reduction Algorithms (Q4114693) (← links)
- Two Algorithms for Generating Weighted Spanning Trees in Order (Q4116059) (← links)
- On Crossbar Switching Networks (Q4119106) (← links)
- A New Class of Algorithms for Multipoint Network Optimization (Q4121719) (← links)
- Algorithmic Aspects of Vertex Elimination on Graphs (Q4124209) (← links)
- Flip-Flops for Multiple-Valued Logic (Q4126225) (← links)
- Complexity of computations (Q4127384) (← links)
- A Combinatorial Problem Which Is Complete in Polynomial Space (Q4127387) (← links)
- Some convergence properties of the conjugate gradient method (Q4127902) (← links)
- Abstract data types and the development of data structures (Q4127984) (← links)
- A survey of multi-way channels in information theory: 1961-1976 (Q4128700) (← links)
- On code generation in a PASCAL compiler (Q4131636) (← links)
- Sieves for low autocorrelation binary sequences (Q4132111) (← links)
- On the Complexity of Timetable and Multicommodity Flow Problems (Q4132234) (← links)
- A canonical representation of trivalent hamiltonian graphs (Q4133660) (← links)
- An algorithm for reduction of operator strength (Q4134923) (← links)
- Abstraction mechanisms in CLU (Q4136503) (← links)
- A Best Possible Bound for The Weighted Path Length of Binary Search Trees (Q4136557) (← links)
- Design and implementation of an efficient priority queue (Q4137890) (← links)
- Robust estimation via stochastic approximation (Q4137923) (← links)
- A Simplified Analysis of Scan Times in an Asymmetrical Newhall Loop with Exhaustive Service (Q4138624) (← links)
- A New Algorithm for Generating All the Maximal Independent Sets (Q4138754) (← links)
- An efficient algorithm for a complete link method (Q4139673) (← links)
- A solution of the syntactical induction-inference problem for regular languages (Q4139695) (← links)
- Line perfect graphs (Q4141848) (← links)
- Generating Binary Trees Lexicographically (Q4142685) (← links)
- Nonnegative entropy measures of multivariate symmetric correlations (Q4145598) (← links)
- A data structure for manipulating priority queues (Q4147586) (← links)
- The Complexity of Some Problems on Subsequences and Supersequences (Q4147591) (← links)
