The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- On filling space with different integer cubes (Q788733) (← links)
- Iterative algebras (Q789385) (← links)
- Medians in median graphs (Q791544) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- On some variants of Post's correspondence problem (Q792770) (← links)
- A combinatorial distinction between the Euclidean and projective planes (Q793745) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- On computing the determinant in small parallel time using a small number of processors (Q794429) (← links)
- Logic of paradox revisited (Q795814) (← links)
- Fuzzy probabilities (Q796165) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- Scheduling independent 2-processor tasks to minimize schedule length (Q796987) (← links)
- An algorithm for merging heaps (Q797280) (← links)
- Rank three permutation groups with rank three subconstituents (Q797675) (← links)
- Convergence of method of lines approximations to partial differential equations (Q797976) (← links)
- Finding pseudoperipheral nodes in graphs (Q797999) (← links)
- The Ramsey number of a graph with bounded maximum degree (Q798674) (← links)
- Symmetric graphs and interpretations (Q798680) (← links)
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories (Q799371) (← links)
- The role of the interactor matrix in multivariable stochastic adaptive control (Q799644) (← links)
- Graph minors. III. Planar tree-width (Q799684) (← links)
- On the windy postman problem (Q800837) (← links)
- On universal graphs without instances of CH (Q801052) (← links)
- Weakly triangulated graphs (Q801088) (← links)
- The set union problem with dynamic weighted backtracking (Q804287) (← links)
- Petri nets and algebraic specifications (Q804305) (← links)
- Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- On the dimension to represent a graph by a unit distance graph (Q804603) (← links)
- A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead (Q805244) (← links)
- Graph invariants related to statistical mechanical models: Examples and problems (Q806104) (← links)
- Parameter estimation aspects in adaptive control (Q807564) (← links)
- Distinct distances determined by subsets of a point set in space (Q808426) (← links)
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- On the rate of convergence in topology preserving neural networks (Q808996) (← links)
- From copair hypergraphs to median graphs with latent vertices (Q809099) (← links)
- Experiments with proof plans for induction (Q809617) (← links)
- Generating relevant models (Q809621) (← links)
- Analysis and design of rate-based congestion control of high speed networks. I: Stochastic fluid models, access regulation (Q809871) (← links)
- A critical examination of Allen's theory of action and time (Q809997) (← links)
- Scenario optimization (Q811363) (← links)
- Quantitative determination of the three-dimensional appearances of a rotating ellipse without a rigidity assumption (Q811460) (← links)
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- The G/M/1 queue revisited (Q811972) (← links)
- Large deviations without principle: join the shortest queue (Q811979) (← links)
- A case-based explanation system for black-box systems (Q812004) (← links)
- Explanation in recommender systems (Q812005) (← links)
- A network analysis model for disambiguation of names in lists (Q812013) (← links)
- Live and dead nodes (Q812021) (← links)
