Wolfgang J. Paul

From MaRDI portal
Person:290241

Available identifiers

zbMath Open paul.wolfgang-jDBLP15/1572WikidataQ2590792 ScholiaQ2590792MaRDI QIDQ290241

List of research outcomes





PublicationDate of PublicationType
On the design of IEEE compliant floating point units2018-07-09Paper
Decimal adjustment of long numbers in constant time2016-06-01Paper
Correct Hardware Design and Verification Methods2010-02-05Paper
Proving the correctness of client/server software2009-11-23Paper
Pervasive Theory of Memory2009-11-12Paper
On the correctness of upper layers of automotive systems2009-05-27Paper
Pervasive verification of distributed real-time systems2008-03-06Paper
Realistic Worst-Case Execution Time Analysis in the Context of Pervasive System Verification2007-09-24Paper
Correct Hardware Design and Verification Methods2006-10-20Paper
Correct Hardware Design and Verification Methods2006-10-20Paper
Theorem Proving in Higher Order Logics2006-07-06Paper
https://portal.mardi4nfdi.de/entity/Q46756132005-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48130962004-08-12Paper
To Booth or not to Booth2003-01-22Paper
https://portal.mardi4nfdi.de/entity/Q44946912000-08-08Paper
https://portal.mardi4nfdi.de/entity/Q49460422000-03-22Paper
On the cost-effectiveness of PRAMs2000-01-04Paper
https://portal.mardi4nfdi.de/entity/Q42158261998-10-29Paper
https://portal.mardi4nfdi.de/entity/Q47182291996-12-01Paper
The complexity of simple computer architectures1995-11-27Paper
Autonomous theory building systems1995-08-27Paper
https://portal.mardi4nfdi.de/entity/Q42874701994-06-13Paper
A note on bitonic sorting1994-04-05Paper
\(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs1993-01-17Paper
https://portal.mardi4nfdi.de/entity/Q47321191989-01-01Paper
Bounds for Width Two Branching Programs1986-01-01Paper
Coding Strings by Pairs of Strings1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36790101984-01-01Paper
Two nonlinear lower bounds for on-line computations1984-01-01Paper
On heads versus tapes1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36792161984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36705871983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33132671983-01-01Paper
An Efficient General-Purpose Parallel Computer1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33349881983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33349891983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39408461982-01-01Paper
On-line simulation of k + 1 tapes by k tapes requires nonlinear time1982-01-01Paper
On time versus space. II1981-01-01Paper
An information-theoretic approach to time bounds for on-line computation1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33434411981-01-01Paper
On alternation1980-01-01Paper
On alternation. II. A graph theoretic approach to determinism versus nondeterminism1980-01-01Paper
On time hierarchies1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30513781979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38917681979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41819671979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41604091978-01-01Paper
Time-space trade-offs in a pebble game1978-01-01Paper
On Time Versus Space1977-01-01Paper
Space bounds for a game on graphs1977-01-01Paper
A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions1977-01-01Paper
Correction to “Space Bounds for a Game on Graphs” by Wolfgang J. Paul, Robert Endre Tarjan and James R. Celoni1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41372041977-01-01Paper
Realizing Boolean functions on disjoint sets of variables1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41412741976-01-01Paper
Boolesche Minimalpolynome und Überdeckungsprobleme1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41381381975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47665861973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32126571973-01-01Paper

Research outcomes over time

This page was built for person: Wolfgang J. Paul