Travelled to:
1 × Czech Republic
1 × Denmark
1 × Italy
1 × The Netherlands
1 × USA
Collaborated with:
∅ R.Rettinger N.Zhong P.Hertling F.W.v.Henke K.Indermark
Talks about:
comput (3) complex (2) set (2) wordfunct (1) transduct (1) hierarchi (1) schemata (1) automata (1) program (1) probabl (1)
Person: Klaus Weihrauch
DBLP: Weihrauch:Klaus
Contributed to:
Wrote 6 papers:
- STOC-2003-RettingerW #complexity #set
- The computational complexity of some julia sets (RR, KW), pp. 177–185.
- ICALP-1999-WeihrauchZ
- The Wave Propagator Is Turing Computable (KW, NZ), pp. 697–707.
- ICALP-1998-HertlingW
- Randomness Spaces (PH, KW), pp. 796–807.
- ICALP-1997-Weihrauch #metric #probability #set
- Computability on the Probability Measures on the Borel Sets of the Unit Interval (KW), pp. 166–176.
- ICALP-1974-Weihrauch #complexity
- The Compuational Complexity of Program Schemata (KW), pp. 326–334.
- ICALP-1972-HenkeIW #automaton #recursion
- Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata (FWvH, KI, KW), pp. 549–561.