The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Probabilistic Analysis of a Relaxation for the <i>k</i>-Median Problem (Q3799815) (← links)
- Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081) (← links)
- Three Partition Refinement Algorithms (Q3801084) (← links)
- List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations (Q3801086) (← links)
- epsilon -optimal discretized linear reward-penalty learning automata (Q3805915) (← links)
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (Q3809272) (← links)
- SL parses the LR languages (Q3809290) (← links)
- A lower bound for r(5, 5) (Q3809827) (← links)
- Semantic data models (Q3811689) (← links)
- Non-monotonic compatibility relations in the theory of evidence (Q3813322) (← links)
- Markov Chains with Rare Transitions and Simulated Annealing (Q3814505) (← links)
- On the chromatic number of the product of graphs (Q3815317) (← links)
- Highly irregular graphs (Q3816111) (← links)
- Properties and update semantics of consistent views (Q3817025) (← links)
- The Confidence Profile Method: A Bayesian Method for Assessing Health Technologies (Q3817492) (← links)
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm (Q3818123) (← links)
- Maximizing Classes of Two-Parameter Objectives Over Matroids (Q3820617) (← links)
- On the Complexity of Computing the Volume of a Polyhedron (Q3821581) (← links)
- Extreme Points of Moment Sets (Q3822904) (← links)
- Split-radix algorithms for length-p/sup m/ DFT's (Q3823113) (← links)
- Updating the Inverse of a Matrix (Q3823718) (← links)
- The Evolution of the Minimum Degree Ordering Algorithm (Q3823722) (← links)
- Origin of Rice's formula (Q3825857) (← links)
- Entropy expressions and their estimators for multivariate distributions (Q3825911) (← links)
- Link scheduling in polynomial time (Q3826350) (← links)
- A note on list-colorings (Q3828020) (← links)
- Universal Graphs for Bounded-Degree Trees and Planar Graphs (Q3828026) (← links)
- Boundary Behavior of Interior Point Algorithms in Linear Programming (Q3830814) (← links)
- Mass Screening Models for Contagious Diseases with No Latent Period (Q3830846) (← links)
- Closed Form Two-Sided Bounds for Probabilities that At Least <i>r</i> and Exactly <i>r</i> Out of <i>n</i> Events Occur (Q3831789) (← links)
- Probabilistic Analysis of the Multidimensional Knapsack Problem (Q3832316) (← links)
- Tight bounds on the chromatic sum of a connected graph (Q3832591) (← links)
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Q3833604) (← links)
- Unification: a multidisciplinary survey (Q3833654) (← links)
- Edge-Coloring Partialk-Trees (Q3837389) (← links)
- The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases (Q3839873) (← links)
- Generalization-based data mining in object-oriented databases using an object cube model (Q3840866) (← links)
- Relational expressive power of constraint query languages (Q3841038) (← links)
- Probabilistic checking of proofs (Q3841041) (← links)
- SLDNFA: An abductive procedure for abductive logic programs (Q3841101) (← links)
- Randomized binary search trees (Q3841653) (← links)
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind (Q3844634) (← links)
- Some Combinatorial Lemmas in Topology (Q3845873) (← links)
- Multiple burst error correction (Q3847279) (← links)
- An empirical study of minimal storage sorting (Q3849244) (← links)
- Regularity preserving modifications of regular expressions (Q3849398) (← links)
- Translation to and from Polish Notation (Q3850220) (← links)
- Zur mathematischen Behandlung des Entscheidungsprozesses (Q3850303) (← links)
- Updating mean and variance estimates (Q3852944) (← links)
- A Generalized Queueing Discipline for Product Form Network Solutions (Q3853118) (← links)
