Travelled to:1 × Canada
1 × Switzerland
4 × Germany
Collaborated with:∅ J.A.Makowsky D.S.Johnson C.H.Papadimitriou P.D.Seymour M.Yannakakis
Talks about:program (3) languag (2) complex (2) setl (2) nondeterminist (1) determinist (1) subtheori (1) interpret (1) implement (1) existenti (1)
Person: Elias Dahlhaus
DBLP: Dahlhaus:Elias
Contributed to:
1992
1991198919881987
1986Wrote 6 papers:
- STOC-1992-DahlhausJPSY #complexity #multi
- The Complexity of Multiway Cuts (ED, DSJ, CHP, PDS, MY), pp. 241–251.
- CSL-1991-Dahlhaus #first-order #how #memory management #modelling
- How to Implement First Order Formulas in Local Memory Machine Models (ED), pp. 68–78.
- CSL-1989-Dahlhaus #complexity #linear
- The Complexity of Subtheories of the Existential Linear Theory of Reals (ED), pp. 76–89.
- CSL-1988-Dahlhaus #nondeterminism #polynomial
- Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time (ED), pp. 52–62.
- CSL-1987-Dahlhaus #approach #parallel #programming
- Is SETL a Suitable Language for Parallel Programming — A Theoretical Approach (ED), pp. 56–63.
- ESOP-1986-DahlhausM #programming language
- The Choice of Programming Primitives for SETL-Like Programming Languages (ED, JAM), pp. 160–172.