#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1972

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant
- J. ACM
- 1977

It is shown that every deterministic multitape Turing machine of time complexity <italic>t</italic>(<italic>n</italic>) can be simulated by a deterministic Turing machine of tape complexity <italic>t</italic>(<italic>n</italic>)/log<italic>t</italic>(<italic>n</italic>). Consequently, for tape constructable <italic>t</italic>(<italic>n</italic>), the class… (More)

- Ferri Abolhassan, Reinhard Drefenstedt, Jörg Keller, Wolfgang J. Paul, Dieter Scheerer
- Comput. J.
- 1993

The Saarbr ucken Parallel Random Access Machine (SB-PRAM) is a scalable shared memory machine. At the gate level it is a re-engineered version of the Fluent machine A. G. Ranade, It uses hashing of adresses, combining and latency hiding. A prototype with 128 processors is presently being designed. In this paper we deal with several problems related to the… (More)

- Jörg Schmittler, Sven Woop, Daniel Wagner, Wolfgang J. Paul, Philipp Slusallek
- Graphics Hardware
- 2004

Realtime ray tracing has recently established itself as a possible alternative to the current rasterization approach for interactive 3D graphics. However, the performance of existing software implementations is still severely limited by today's CPUs, requiring many CPUs for achieving realtime performance.In this paper we present a prototype implementation… (More)

- Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter
- 24th Annual Symposium on Foundations of Computer…
- 1983

We show that, for multi-tape Turing machines, non-deterministic linear time is more powerful than deterministic linear time. We also discuss the prospects for extending this result to more general Turing machines.

- Wolfgang J. Paul, Robert E. Tarjan
- Acta Informatica
- 1977

A certain pebble game on graphs has been studied in various contexts as a model for the time and space requirements of computations [1,2,3,8]. In this note it is shown that there exists a family of directed acyclic graphs G n and constants c 1, c 2, c 3 such that (1) G n has n nodes and each node in G n has indegree at most 2. (2) Each graph G n can be… (More)

- Sven Beyer, Christian Jacobi, Daniel Kroening, Dirk Leinenbach, Wolfgang J. Paul
- International Journal on Software Tools for…
- 2005

In the verified architecture microprocessor (VAMP) project we have designed, functionally verified, and synthesized a processor with full DLX instruction set, delayed branch, Tomasulo scheduler, maskable nested precise interrupts, pipelined fully IEEE compatible dual precision floating point unit with variable latency, and separate instruction and data… (More)

- Wolfgang J. Paul, Robert E. Tarjan, James R. Celoni
- Mathematical systems theory
- 1977

We study a one-person game played by placing pebbles, according to certain rules, on the vertices of a directed graph. In [3] it was shown that for each graph withn vertices and maximum in-degreed, there is a pebbling strategy which requires at mostc(d) n/logn pebbles. Here we show that this bound is tight to within a constant factor. We also analyze a… (More)

- Wolfgang J. Paul, Uzi Vishkin, Hubert Wagener
- ICALP
- 1983

Our model of computation is a parallel computer with k synchronized processors PI,...,Pk sharing a common random access storage, where simultaneous access to the same storage location by two or more processors is not allowed. Suppose a 2-3 tree T with n leaves is implemented in the storage, suppose al,...,a k are data that may or may not be stored in the… (More)

- Dirk Leinenbach, Wolfgang J. Paul, Elena Petrova
- SEFM
- 2005

Use of verification for testing and debugging of complex reactive systems p. 13 Experimental evaluation of FSM-based testing methods p. 23 Putting detectors in their place p. 33 Timed automata with data structures for distributed systems design and analysis p. 44 Operational semantics for real-time processes with action refinement p. 54 Specifying urgency… (More)