The following pages link to Peter van Emde Boas (Q582045):
Displaying 50 items.
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- (Q684563) (redirect page) (← links)
- Specifying message passing and time-critical systems with temporal logic (Q684564) (← links)
- A speed-up theorem without tape compression (Q688718) (← links)
- A note on the recursive enumerability of some classes of recursively enumerable languages (Q754652) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- The expressive power of stratified logic programs (Q803773) (← links)
- Is there an axiomatic semantics for standard pure Prolog? (Q805224) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- (Q920621) (redirect page) (← links)
- Comparative semantics for prolog with cut (Q920622) (← links)
- Recursion equation sets computing logic programs (Q920624) (← links)
- A topological approach to evasiveness (Q1065831) (← links)
- Two results on tables (Q1069703) (← links)
- Lower bounds on communication complexity (Q1097691) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- (Q1106013) (redirect page) (← links)
- A proof system for distributed processes (Q1106014) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- Simplicity, immunity, relativizations and nondeterminism (Q1115610) (← links)
- Space measures for storage modification machines (Q1119021) (← links)
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← links)
- A note on ''Master keys for group sharing'' (Q1169968) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- On mod \(p\) transversals (Q1180406) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- On Golay polynomial pairs (Q1189706) (← links)
- The reduction of an association scheme (Q1200686) (← links)
- Quantifiers and approximation (Q1208413) (← links)
- The non-renamability of honesty classes (Q1220385) (← links)
- (Q1241057) (redirect page) (← links)
- Preserving order in a forest in less than logarithmic time and linear space (Q1241058) (← links)
- Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
- Some applications of the McCreight-Meyer algorithm in abstract complexity theory (Q1249043) (← links)
- The double selection problem (Q1262124) (← links)
- Relation-based semantics for concurrency (Q1328556) (← links)
- The complexity of optimizing finite-state transducers (Q1329734) (← links)
- On the solvability of domino snake problems (Q1331945) (← links)
- A theory of finite closure spaces based on implications (Q1341147) (← links)
- On a conjecture of Stanley on Jack symmetric functions (Q1801700) (← links)
- Axiomatizing schemes and their behaviors (Q1819574) (← links)
- A generalized model for understanding evasiveness (Q1825645) (← links)
- Parallel processing can be harmful: The unusual behavior of interpolation search (Q1825662) (← links)
- The STO-problem is NP-hard (Q1892125) (← links)
- Hierarchies and space measures for pointer machines (Q2366564) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Unification modulo an equality theory for equational logic programming (Q2639627) (← links)
- Turing Machines for Dummies (Q2891358) (← links)
- Travelling with Dexter Kozen (Q2897972) (← links)
