Jahr:

2000 - 1999 - 1998 - 1997 - 1996 - 1995 - 1994 - 1993 - 1992 - 1991 - 1990

STACS

• V. Arvind, J. Köbler, M. Mundhenk, J. Torán:Nondeterministic Instance Complexity and Hard-to-prove Tautologies STACS 2000, Lille, France, 2000.

ISAS

• J. Bern, Ch. Meinel:Electronic Colloquia in the WWW - a New Form of Scientific Publications SCI'99 / ISAS'99, Orlando, USA, 1999.

JIM

• M. Mundhenk:Hard Instances of NP-hard Sets Journées de l´Informatique Messine, 1999.

SCI - see ISAS above

SIGDOC

• J. Bern, Ch. Meinel:One Step Further - Extending Electronic Submission Into the Reviewing Process ACM SIGDOC'99, New Orleans, USA, 1999.

CC

• J. Goldsmith, M. Mundhenk:Complexity Issues in Markov Decision Processes Computational Complexity, 1998.

SIGDOC

• J. Bern, Ch. Meinel, H. Sack:Electronic Colloquia: Idea and Practice ACM SIGDOC'98, Quebec Canada, 1998, pp. 113-119.

ECDL

• J. Bern, C. Damm, Ch. Meinel:The Electronic Colloquium on Computational Complexity: A Digital Library in Use Proc. ECDL'97, Pisa (Italien), LNCS 1324, 1997, pp. 405-421.

MFCS

• M. Mundhenk:On hard instances Proc. 25th Mathematical Foundations of Computer Science, Lecture Notes in Computer Science # 1295:428-437, Springer Verlag, 1997.

MFCS

• M. Mundhenk, J. Goldsmith, E. Allender:The Complexity of Unobservable Finite-Horizon Markov Decision Processes Proc. 25th Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, # 1295:129-138, Springer Verlag, 1997.

UAI

• J. Goldsmith, M.L. Littman, M. Mundhenk:The Complexity of Plan Existence and Evaluation in Probalistic Domains Proc. of Uncertainty in AI'97.

CAV

• J. Bern, Ch. Meinel, A. Slobodová:Global Rebuilding of OBDD's - Tunneling Memory Requirement Maxima Proc. CAV'95, Liège (Belgium), LNCS 939, Springer-Verlag 1995, 4-15.

DAC

• J. Bern, Ch. Meinel, A. Slobodová:Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits Proc. 32nd IEEE/ACM DAC, San Francisco (USA), IEEE Computer Society Press 1995, 408-413.

LATIN

• M. Mundhenk:On Monotonous Oracle Machines Proc. 2nd Latinamerican Conference on Theoretical Informatics, Lecture Notes in Computer Science, # 911:436-448, Springer Verlag, 1995.

CIAC

• M. Mundhenk:On self-reducible sets of low information content Proc. 2nd Italian Conference on Algorithms and Complexity, Lecture Notes in Computer Science,# 778:203-212, Springer Verlag, 1994.

EDAC

• J. Bern, J. Gergov, Ch. Meinel, A. Slobodová:Boolean Manipulation with Free BDDs. First Experimental Results Proc. EDAC'94, Paris (France), IEEE Computer Society Press 1994, 200-207.

MFCS

• V. Arvind, J. Köbler, M. Mundhenk:Hausdorff Reductions to Sparse Sets and to Sets of High Information Content Proc. 18th International Conference on Mathematical Foundations of Computer Sciences, #711:232-241, Springer Verlag, 1993.

FST-TCS

• V. Arvind, J. Köbler, M. Mundhenk:Bounded Truth-Table and Conjunktive Reductions to Sparse and Tally Sets Proc. 12th Conference on the Foundations of Software Technology & Theoretical Computer Science, Lecture Notes in Computer Science, #652:140-151, Springer Verlag, 1992.

ISAAC

• V. Arvind, J. Köbler, M. Mundhenk:Lowness and the Complexity of Sparse and Tally Descriptions Proc. Third International Symposium on Algorithm and Computation, Lecture Notes in Computer Science, #650:249-258, Springer Verlag, 1992.

ICALP

• V.Arvind, Han, Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, Ogiwara, U. Schöning, Silvestri, T. Thierauf:Reductions to Sets of Low Information Content Proc. of the 19th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, #623:162-173, Springer Verlag, 1992.

Structures

• M. Mundhenk, R. Schuler:Random languages for non-uniform complexity classes Proc. 5th Conference on Structure in Complexity Theory, IEEE, 1990, Elaborated version in: Journal of Complexity, 7, S. 296-310, 1991.