The following pages link to Jan van Leeuwen (Q418789):
Displayed 50 items.
- Computation as an unbounded process (Q418791) (← links)
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- (Q685692) (redirect page) (← links)
- Maintenance of 2- and 3-edge-connected components of graphs. I (Q685694) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
- Systolische Berechnungen und VLSI (Q1057060) (← links)
- Array processing machines: an abstract model (Q1094879) (← links)
- The derivation of graph marking algorithms from distributed termination detection protocols (Q1104744) (← links)
- On estimating the complexity of logarithmic decomposition (Q1116321) (← links)
- Further comments on Bykat's convex hull algorithm (Q1147518) (← links)
- The complexity of basic complex operations (Q1148674) (← links)
- Some principles for dynamizing decomposable searching problems (Q1149253) (← links)
- Two general methods for dynamizing decomposable searching problems (Q1149778) (← links)
- Worst-case optimal insertion and deletion methods for decomposable searching problems (Q1152223) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- (Q1163358) (redirect page) (← links)
- Über Programmeffizienz und algebraische Komplexitaet (Q1163359) (← links)
- Efficient recognition of rational relations (Q1163370) (← links)
- Dynamic multi-dimensional data structures based on quad- and k-d trees (Q1166932) (← links)
- Stratified balanced search trees (Q1168743) (← links)
- On models for propositional dynamic logic (Q1183594) (← links)
- On the fixpoints of monogenic functions in free monoids (Q1215012) (← links)
- The membership question for ETOL-languages is polynomially complete (Q1219165) (← links)
- The tape-complexity of context-independent developmental languages (Q1220791) (← links)
- A decomposition theorem for hyper-algebraic extensions of language families (Q1225945) (← links)
- The halting problem for linear Turing assemblers (Q1231906) (← links)
- The complexity of vector-products (Q1243128) (← links)
- Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
- Effective constructions in well-partially-ordered free monoids (Q1249047) (← links)
- On compromising statistical data-bases with a few known elements (Q1256850) (← links)
- A useful lemma for context-free programmed grammars (Q1256864) (← links)
- Efficient elections in chordal ring networks (Q1262125) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Finding a \(\Delta\)-regular supergraph of minimum order (Q1408809) (← links)
- Finite state machines with feedback: an architecture supporting minimal machine consciousness (Q2179372) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- Question answering by humans and machines: a complexity-theoretic view (Q2422044) (← links)
- (Q2762165) (← links)
- Treewidth and Pure Nash Equilibria (Q2867095) (← links)
- Name Resolution by Rewriting in Dynamic Networks of Mobile Entities (Q3003476) (← links)
- (Q3039427) (← links)
- Convex Polygon Intersection Graphs (Q3073689) (← links)
- (Q3216469) (← links)
- (Q3309031) (← links)
- (Q3326823) (← links)
- (Q3343924) (← links)
- Separating the Classes of Recursively Enumerable Languages Based on Machine Size (Q3455749) (← links)