The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Computing a ham-sandwich cut in two dimensions (Q1091824) (← links)
- Another step forward in searching for cubature formulae with a minimal number of knots for the square (Q1093315) (← links)
- Computing the volume is difficult (Q1093369) (← links)
- Repeated angles in \(E_ 4\) (Q1093908) (← links)
- Subsumption and implication (Q1094152) (← links)
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- Super-exponentials nonprimitive recursive, but rudimentary (Q1095134) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- Combinatorial reconstruction problems (Q1095932) (← links)
- Frege against the Booleans (Q1096601) (← links)
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed (Q1096622) (← links)
- Nonobtuse triangulation of polygons (Q1096930) (← links)
- On the robust stabilizability of uncertain linear time-invariant plants using nonlinear time-varying controllers (Q1097227) (← links)
- Stationary deterministic flows: II. The Single-server queue (Q1097690) (← links)
- A note on unification type zero (Q1098285) (← links)
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments (Q1098294) (← links)
- Learning regular sets from queries and counterexamples (Q1098326) (← links)
- A structure-preserving clause form translation (Q1098330) (← links)
- Termination of rewriting (Q1098624) (← links)
- Nonconstructive advances in polynomial-time complexity (Q1098635) (← links)
- On the consistency of the first-order portion of Frege's logical system (Q1098830) (← links)
- The method of forced enumeration for nondeterministic automata (Q1099620) (← links)
- Associative-commutative unification (Q1099648) (← links)
- Constrained string editing (Q1099954) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- Translation separability of sets of polygons (Q1100897) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Optimal worst case trees (Q1101234) (← links)
- Proving termination of normalization functions for conditional expressions (Q1101251) (← links)
- A hierarchy of polynomial time lattice basis reduction algorithms (Q1101500) (← links)
- Easy multiplications. I: The realm of Kleene's theorem (Q1101553) (← links)
- Numerical transient analysis of Markov models (Q1101812) (← links)
- Algorithms for minimum length partitions of polygons (Q1102107) (← links)
- Corrections to Lee's visibility polygon algorithm (Q1102120) (← links)
- Competitive snoopy caching (Q1103391) (← links)
- Covering graphs by the minimum number of equivalence relations (Q1103644) (← links)
- Uses and abuses of statistical simulation (Q1104027) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships (Q1104114) (← links)
- Quantifier elimination: Optimal solution for two classical examples (Q1104314) (← links)
- On submodular function minimization (Q1104332) (← links)
- The algebraic degree of geometric optimization problems (Q1104865) (← links)
- Threshold functions (Q1104940) (← links)
- A semantics of multiple inheritance (Q1106652) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- Blockbusting and domineering (Q1106742) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315) (← links)
- Counterexamples to termination for the direct sum of term rewriting systems (Q1107975) (← links)
