The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Point Selections and Weak ε-Nets for Convex Hulls (Q4291196) (← links)
- The Computational Complexity of the Tutte Plane: the Bipartite Case (Q4291212) (← links)
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art (Q4291492) (← links)
- Rejoinder—The Last Word on Interior Point Methods for Linear Programming—For Now (Q4291497) (← links)
- Generating Linear Extensions Fast (Q4291563) (← links)
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems (Q4294367) (← links)
- Algorithms for inferring functional dependencies from relations (Q4294515) (← links)
- Clique Graphs of Chordal and Path Graphs (Q4296528) (← links)
- Algorithms for intersecting parametric and algebraic curves I (Q4296531) (← links)
- Cryptographic limitations on learning Boolean formulae and finite automata (Q4299296) (← links)
- Approximation algorithms for NP-complete problems on planar graphs (Q4299299) (← links)
- Analysing front view face profiles for face recognition via the Walsh transform (Q4299420) (← links)
- Two-plus-one-dimensional differential geometry (Q4299432) (← links)
- A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity (Q4301636) (← links)
- Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Q4302273) (← links)
- The Reactive Tabu Search (Q4302715) (← links)
- An optimal on-line algorithm for metrical task system (Q4302787) (← links)
- Algebraic methods for interactive proof systems (Q4302792) (← links)
- Sparse dynamic programming II (Q4302803) (← links)
- A general approach to connected-component labeling for arbitrary image representations (Q4302810) (← links)
- An optimal algorithm for intersecting line segments in the plane (Q4302817) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Graphs with E Edges Have Pagenumber O(√E) (Q4304061) (← links)
- Genus g Graphs Have Pagenumber O(√g) (Q4304062) (← links)
- A unified view of product-form approximation techniques for general closed queueing networks (Q4304998) (← links)
- The Complexity of Multiterminal Cuts (Q4305362) (← links)
- Logic programming and knowledge representation (Q4305625) (← links)
- Finding hidden hamiltonian cycles (Q4306372) (← links)
- Reducing elliptic curve logarithms to logarithms in a finite field (Q4307376) (← links)
- A morphological pyramidal image decomposition (Q4310399) (← links)
- Designing broadcasting algorithms in the postal model for message-passing systems (Q4311639) (← links)
- Structuring logic programs: a modal approach (Q4311648) (← links)
- A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS (Q4312276) (← links)
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs (Q4312418) (← links)
- A Uniform Circuit Lower Bound for the Permanent (Q4312420) (← links)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (Q4314500) (← links)
- On the Approximation of Maximum Satisfiability (Q4314502) (← links)
- Efficient Variants of the Vertex Space Domain Decomposition Algorithm (Q4316310) (← links)
- Derivatives with Support and Applications (Q4316550) (← links)
- The evolution and recognition of protein sequence repeats (Q4316913) (← links)
- Non-globular domains in protein sequences: Automated segmentation using complexity measures (Q4316916) (← links)
- Some useful statistical properties of position-weight matrices (Q4316917) (← links)
- Landscapes: Complex optimization problems and biopolymer structures (Q4316918) (← links)
- Predicting Cause-Effect Relationships from Incomplete Discrete Observations (Q4317698) (← links)
- Applying SLD-Resolution to a Class of Non-Horn Logic Programs (Q4318172) (← links)
- Flexible‐link robot arm control by a feedback linearization/singular perturbation approach (Q4318982) (← links)
- The Commercial Data Masking Facility (CDMF) data privacy algorithm (Q4320789) (← links)
- The Data Encryption Standard (DES) and its strength against attacks (Q4320790) (← links)
- On the arrival theorem for communication networks (Q4322097) (← links)
- Randomized greedy matching. II (Q4322476) (← links)
