Travelled to:1 × Finland
1 × Greece
1 × Italy
1 × Spain
2 × Germany
9 × USA
Collaborated with:∅ R.E.Tarjan Z.Galil C.A.Müller D.Kröning K.Mehlhorn S.Schmaltz A.Shadrin D.Leinenbach E.Petrova C.W.Keßler T.Rauber U.Vishkin H.Wagener J.I.Seiferas J.Simon J.R.Celoni M.M.Klawe N.Pippenger M.Yannakakis A.Borodin D.Dolev F.E.Fich P.Duris R.Reischuk
Talks about:bound (5) verif (4) time (3) two (3) parallel (2) approach (2) program (2) complet (2) versus (2) regist (2)
Person: Wolfgang J. Paul
DBLP: Paul:Wolfgang_J=
Contributed to:
2012
20112005
2001
1991
1989
198419831983198119801977197719761975Wrote 16 papers:
- SEFM-2012-PaulSS #assembly #automation #verification
- Completing the Automated Verification of a Small Hypervisor — Assembler Code Verification (WJP, SS, AS), pp. 188–202.
- CAV-2011-MullerP #hardware #interface #verification
- Complete Formal Hardware Verification of Interfaces for a FlexRay-Like Bus (CAM, WJP), pp. 633–648.
- SEFM-2005-LeinenbachPP #code generation #compilation #implementation #towards #verification
- Towards the Formal Verification of a C0 Compiler: Code Generation and Implementation Correctnes (DL, WJP, EP), pp. 2–12.
- DAC-2001-KroeningP #automation #design #pipes and filters
- Automated Pipeline Design (DK, WJP), pp. 810–815.
- PLILP-1991-KeslerPR #approach #heuristic #random
- A Randomized Heuristic Approach to Register Allocation (CWK, WJP, TR), pp. 195–206.
- ICALP-1989-MehlhornP #source code
- Two Versus One Index Register and Modifiable Versus Non-modifiable Programs (KM, WJP), pp. 603–609.
- STOC-1984-KlawePPY #on the #strict
- On Monotone Formulae with Restricted Depth (MMK, WJP, NP, MY), pp. 480–487.
- ICALP-1983-PaulVW #parallel
- Parallel Dictionaries in 2-3 Trees (WJP, UV, HW), pp. 597–609.
- STOC-1983-BorodinDFP #bound #branch #source code
- Bounds for Width Two Branching Programs (AB, DD, FEF, WJP), pp. 87–93.
- STOC-1983-DurisGPR #bound
- Two Nonlinear Lower Bounds (PD, ZG, WJP, RR), pp. 127–132.
- STOC-1981-GalilP #parallel #performance
- An Efficient General Purpose Parallel Computer (ZG, WJP), pp. 247–262.
- STOC-1980-PaulSS #approach #bound #online
- An Information-Theoretic Approach to Time Bounds for On-Line Computation (WJP, JIS, JS), pp. 357–367.
- ICALP-1977-PaulT #game studies #trade-off
- Time-Space Trade-Offs in a Pebble Game (WJP, RET), pp. 365–369.
- STOC-1977-Paul #on the
- On Time Hierarchies (WJP), pp. 218–222.
- STOC-1976-PaulTC #bound #game studies #graph
- Space Bounds for a Game of Graphs (WJP, RET, JRC), pp. 149–160.
- STOC-1975-Paul #bound #combinator #complexity
- A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions (WJP), pp. 27–36.