Emde Boas, Peter van.
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
Emde Boas, P. van
Peter van Emde Boas Nederlands universitair docent (1945-)
Emde Boas, Peter van, 1945-
VIAF ID: 5113494 (Personal)
Permalink: http://viaf.org/viaf/5113494
Preferred Forms
-
200 _ |
‡a
Emde Boas
‡b
Peter van
-
100 1 _
‡a
Emde Boas, P. van
-
100 1 _ ‡a Emde Boas, P. van
-
100 1 _
‡a
Emde Boas, P. van
-
100 1 _
‡a
Emde Boas, P. van
-
100 1 _ ‡a Emde Boas, P. van
-
100 1 _
‡a
Emde Boas, P. van
-
100 1 _ ‡a Emde Boas, Peter van
-
100 1 _ ‡a Emde Boas, Peter van
-
100 1 _ ‡a Emde Boas, Peter van
-
100 1 _
‡a
Emde Boas, Peter van
-
100 1 _ ‡a Emde Boas, Peter van
-
100 1 _ ‡a Emde Boas, Peter van, ‡d 1945-
-
100 1 _ ‡a Emde Boas, Peter van.
-
100 0 _
‡a
Peter van Emde Boas
‡c
Nederlands universitair docent (1945-)
4xx's: Alternate Name Forms (20)
5xx's: Related Names (1)
Works
| Title | Sources |
|---|---|
| Abstract resource-bound classes |
|
| Analyzing the logic of Sun Tzu in "The art of war", using mind maps |
|
| An appraisal of computational complexity for operations researchers |
|
| Are polynomial algorithms really good? |
|
| Automata, languages, and programming, 1999: |
|
| Bases for Boolean rings |
|
| Belief dependence, revision and persistence |
|
| Bounded tiling, an alternative to satisfiability? |
|
| Colloquium complexiteit en algoritmen |
|
| A combinatorial problem on finite Abelian groups II |
|
| Compiling Horn-clause rules in IBM's business system 12 : an early experiment in declarativeness |
|
| Compositionality of meaning in logic and computer science |
|
| Diagonalisation methods and the separation of relativized complexity classes |
|
| Diagonalisation methods in a polynomial setting |
|
| Dominoes are forever |
|
| Each complete bipartite graph minus a matching is representable by line segments |
|
| Information acquisition from multi-agebt resources : abstract |
|
| Interfaces between computer science and operations research : proceedings of a symposium held at the Mathematisch Centrum, Amsterdam, September 7-10, 1976 |
|
| "Is er nog nieuws?" : aangeboden aan Prof. Dr. Th. J. Dekker |
|
| Machine models and simulations |
|
| Ne probentur oracula |
|
| Nondeterminism, fairness and a fundamental analogy |
|
| A note on the McCreight-Meyer naming theorem in the theory of computational complexity |
|
| A note on the recursive enumerability of some classes of recursively enumerable languages ; prepublication |
|
| Object oriented application flow graphs and their semantics |
|
| On tape versus core : an application of space efficient hash functions to the invariance of space |
|
| On the proper treatment of referencing, dereferencing and assignment |
|
| The power of your editor |
|
| The problem of space invariance for sequential machines |
|
| The reconstruction and optimization of trie hashing functions |
|
| Resistance is futile : formal linguistic observations on design patterns |
|
| RL, a language for enhanced rule based database processing : working document |
|
| The Schoenmakers paradox : its solution in a belief dependence framework |
|
| The second machine class |
|
| A semantical model for integration and modularization of rules |
|
| Semantics and contextual expression |
|
| A sharpened version of the Aanderaa-Rosenberg conjecture |
|
| Simplicty, immunity, relativizations and non-determinism |
|
| SOFSEM 2004 : theory and practice of computer science : 30th Conference on Current Trends in Theory and Practice of Computer Science, Měřín, Czech Republic, January 24-30, 2004 : proceedings |
|
| Space measures for storage modification machines |
|
| The STO-problem is NP-hard |
|
| Towards implementing RL |
|
| Two results on tables |
|
