| | - Sven Kosub
Sven Kosub is Lecturer in Mathematics in Computer Science in the Department of Computer and Information Science at University of Konstanz. His research interests are algorithms and complexity, formal methods in social network analysis, Internet and g ...
http://www.inf.uni-konstanz.de/~kosub/
|
| |
- Mihir Bellare
Professor in the Department of Computer Science and Engineering at the University of California, San Diego. ...
http://www.cse.ucsd.edu/users/mihir/
|
| |
|
- Christos Papadimitriou,
I studied in Athens Polytechnic BS in EE 1972 and Princeton MS in EE, 1974 and PhD in EECS, 1976. Since then, I have taught at Harvard, MIT, Athens Polytechnic, Stanford, and UCSD. came to Berkeley in January 1996 but I was here also in 1978 as a Mi ...
http://www.cs.berkeley.edu/~christos/
| | |
| |
- Karpinski, Marek University of Bonn.
In this area Professor Karpinski is occupied with fundamental questions of computational complexity, design of randomized and approximate algorithms, organization of parallel and distributed systems, internet algorithms as well as the resulting probl ...
http://theory.cs.uni-bonn.de/~marek/
|
| |
- Salil Vadhan
My research interests are in the Theory of Computation, and focuses on complexity theory, cryptography, and randomness in computation. ...
http://www.eecs.harvard.edu/~salil/
| | - Rolf Niedermeier
This researchlevel text is an applicationoriented introduction to the growing and highly topical area of the development and analysis of efficient fixedparameter algorithms for optimally solving computationally hard combinatorial problems. The book i ...
http://theinf1.informatik.uni-jena.de/~niedermr/
|
| |
- Stasys Jukna
My research interests lie between mathematics and computer science. I want to prove that complex problems are indeed complex. Here are only three problems I would like to see solved. ...
http://www.thi.informatik.uni-frankfurt.de/~jukna/
| | - Eyal Kushilevitz
Eyal Kushilevitz Israel Institute of Technology. ...
http://www.cs.technion.ac.il/~eyalk/
|
| |
- Jan Johannsen
I am currently a faculty member Wissenschaftlicher Assistent at the Institut für Informatik of the LudwigMaximiliansUniversität München, working in the theory group Lehr und Forschungseinheit Theoretische Informatik led by Martin Hofmann. Previously, ...
http://www.tcs.informatik.uni-muenchen.de/~jjohanns/
| | - Detlef Sieling
Complexity theory and efficient algorithms, in particular: Lower bound methods for Branching ProgramsBinary Decision Diagrams. Algorithms on Binary Decision Diagrams. Hardness and Nonapproximability Results for Operations on Binary Decision Diagrams. ...
http://ls2-www.cs.uni-dortmund.de/~sieling/
|
| |
