|
Prof. RNDr. Jiří Wiedermann, DrSc. Academy
of Sciences of the Czech Republic Institute
of Computer Science |
Jiří Wiedermann belongs
to the first generation of computer scientists graduating in former
Czechoslovakia. He works in informatics since the beginning of his scientific
carrier in nineteen seventies. His research interests include ad-hoc networks,
algorithms (design and analysis), algorithmic systems, applied algorithmics, artificial intelligence, artificial life,
cognitive systems, computational complexity theory (incl. non-uniform
complexity theory), datastructures, distributed
computing, embodied robotics, information technology, intelligent algorithms,
languages and automata, machine learning, non-standard computational models
(amorphous computing, molecular computing, nano-computing,
super-Turing computability, etc.), networks and network modeling, network
algorithms, neurocomputing, parallel computing, philosophy
and computing, theoretical computer science, and more. In these fields he published two monographs
and more than 150 papers in scientific journals and conference
proceedings. Some of his results have
entered the monographs and textbooks in computer science. By his invited talks,
publications and activities in organization of important European and national
computer science conferences he contributed to the development of informatics
both at national and international level. In nineteen nineties he acted as the
vice-president of the European Association for Theoretical Computer Science
(EATCS). Between 2000 and 2012 he served as the director and since 2017 he is
the deputy director of the Institute of Computer Science of Academy of Sciences
of the Czech Republic. Professor Wiedermann was a member of the board of
directors of ERCIM (European Research Consortium in Informatics and
Mathematics) (1997-2010) and is a member of Academia Europaea
(London) and of the Czech Learned Society (Prague).
Biography:
Prof. of Computer Science, Charles University,
Prague, 2004
Assoc. Prof. of Computer Science, Charles University, Prague, 2000
DrSc. degree in computer science, Comenius University,
Bratislava, 1993
CSc. (equiv. of PhD) in computer science,
Czechoslovak Academy of Sciences, Prague, 1980
RNDr. degree, Comenius University, Bratislava, 1974
M.Sc. degree, Comenius University, Bratislava, 1971
Position:
- Deputy director, Institute of Computer
Science, since 2017
- Senior researcher, Institute of
Computer Science, since 2013
- Director of the Institute
of Computer Science,
Academy of Sciences of the Czech / Republic, Prague, 2000 - 2012
- Professor of Computer Science
at the Department of Theoretical Computer Science and Mathematical Logic, Faculty
of Mathematics and Physics, Charles University, Prague (1995-2006)
Research Interests:
Theoretical
computer science, computational complexity; models of sequential and parallel
computational systems; neurocomputing; amorphous
computing; non-standard computing; complexity of data structures and
algorithms; artificial intelligence, artificial life, embodied cognition, machine
consciousness, history and prospects of informatics; philosophy of computing.
Projects:
1.
ALTEC
(Algorithms For Future Technologies), deputy coordinator, EU project, participants: University of
Bordeaux, Bratislava, Budapest,
Prague, Saarbrücken, Utrecht, Warszaw; total budget: 500 000 ECU, 1992-1995
2.
HYPERCOMPLEX
(Complexity Issues in High Performance Computing), Czech Grant Agency, 1995-1997, 700 000 CZK
3.
ALTEC-KIT
(Keep in Touch), follow-up on the ALTEC project, , INCO-COPERNICUS, local
coordinator (with the participation of
Charles University), 1997-1998
4.
Machine models and computational complexity, Czech
Grant Agency, 1999-2001, 1 200 000 CZK
5.
Soft
Computing: theoretical foundations and experiments, Czech Grant Agency, 2000-2002,
2 350 000 CZK
6.
New
Information Technologies – Theoretical Foundations, Methodology, Tools and
Applications (Institute’s Research Project, Ministry of Education and
Science) , 1999-2003
7.
Mathematics,
Computer Science and Cybernetics: Methods, Tools and Applications (Institute’s
Research Project, Academy of Sciences of the Czech Republic), 2000-2004
8.
Specialized
computational models in contemporary computer science, Czech Grant Agency,
participants: Charles University and Technical University, Ostrava, 2 640 000.
CZK
9.
Computer
Science for Information Society: Models, Algorithms, Applications. Institute‘s
Research Project, 2005-2011
Teaching:
1. Models of Sequential and Parallel
Computers (Charles University) (1995-2006)
2. Hora Informaticae (a weekly seminar on
complexity theory running since 1994, Charles University and Institute of
Computer Science AS CR)
3. Committee for doctoral
dissertations (DSc) defense in informatics and
cybernetics AS CR, Chairman, since
2011
Editorship:
1. Proceedings of MFCS'86, LNCS Vol.
233, Springer Verlag 1986 (with J. Gruska and B. Rovan)
2. Proceedings of MFCS'95, LNCS Vol.
969, Springer Verlag 1995 (with P. Hájek);
3. Proceedings of SOFSEM'95, LNCS Vol.
1016, Springer Verlag, 1995 (with J. Staudek a M. Bartošek
4. Proceedings of ICALP'99, LNCS Vol.
1644, Springer Verlag (with P. van Emde Boas
and M. Nielsen)
5.
Proceedings of SOFSEM‘00, Vol. 1963, Springer (with V. Hlaváč and K.J. Jeffery)
6. Proceedings of SOFSEM’06, Vol. 3831, Springer (with G. Tel, J Pokorný,
M. Bieliková, J. Štuller)
7. A Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jirí Wiedermann:
SOFSEM
2018: Theory and Practice of Computer Science - 44th International Conference
on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings. Lecture Notes in Computer Science 10706, Springer 2018
Honors and Memberships:
·
Member
of the Karel Čapek Center for Values
in Science and Technology, since 2018
·
Member
of Academia Europaea (London, UK), section Informatics, since 2006
·
Member
of the Czech
Learned Society,
since 2003
·
Member
of the Board of Directors of the ERCIM (European Research Consortium for
Informatics and Mathematics), 1997-2010
·
EATCS
(European Association for Theoretical Computer Science): vicepresident 1997-2002; council member 1995-2003; member
1993-2009
Invited Talks:
·
FCT'85 (Fundamentals of Computer Science), 1985, Cottbus, NDR
·
23rd semester in the International Banach Center,Warszaw,
1985
·
Summer school "Parallel Algorithms and Architectures", 1988, 1990, Czechoslovakia
·
IMYCS'90 (International Meeting
of Young
Computer Scientists), 1990,
Czechoslovakia
·
konference FAIR'91 (Foundations
of Artificial Intelligence), 1991, Poland
·
MFCS'92 (Mathematical Foundations of Computer Science), 1992, Czechoslovakia
·
Kurt-Gödel Gessellschaft
Colloquium, Wien, 1994,
1997, 1999
·
SOFSEM: Current Trends in Theory and Practice of
Informatics, 1995, 1997, 2001, Czechoslovakia
·
Workshop on Computability, Complexity, and Logic WCCL'96, Usedom, 1996, Germany
·
IVth South American Workshop on String Processing'97, Viňa del Mar,
Chile, 1997
·
MFCS'98, Czech Republic 1998
·
MFCS‘2001, Slovakia, 2001
·
ECAL‘2001 (European Colloquium on Artificial Life), Praha, 2001
·
euCognition (The European Network for the Advancement of
Artificial Cognitive Systems), Inaugural Meeting, Nice 2006
·
DCFS‘2007 (Descriptional Complexity of Formal
Systems), Slovakia, 2007
·
CiE‘2008 (Computability in Europe – Logic and Theory of
Algorithms), Athens, GR, 2008
·
Physics and Computation
2009 (a satelite event of Unconventional
Computation 2009), Ponta-Delgada, Azores, Portugal
·
SOFSEM‘2012, Czech Republic, 2012
·
Computability in Europe CiE 2012, Cambridge, 2012
·
IFIP TCS (Theoretical Computer Science) 2012, Amsterdam, 2012
·
NCMA 2017 (Non-standard Models of Automata), Prague
2017
Conference Chairmanships:
·
MFCS’95, (
Mathematical Foundations of Computer Science)
·
ICALP’99
(International Colloquium on Automata, Programming and Languages)
·
SOFSEM’95,
2000; 2006
·
SOFSEM
Steering Committee Chairman 1996-2000
Conference Committees:
·
MFCS
(1981, 1984, 1994); Graph-Theoretic Concepts in Computer Science (1993, 1994);
Theoretical Computer Science – Exploring New Frontiers of Theoretical
Informatics, 2000, 2002; ALGOSENSORS
2004; 2006;
·
Machines,
Computations, and Universality MCU 2007
·
Developments in
Computational Models DCM 2009
·
SOFSEM 2008, 2009
·
Bio-Inspired
Models of Network, Information and Computing Systems BIONETICS 2010
·
Physics and Computation P&C 2010
·
Theory
and Practice of Natural Computing TPNC 2012
·
SOFSEM
2018, co-chair
Scientific Council Memberships:
Faculty
of Informatics, Masaryk University, Brno (since1998); Faculty of Electrical
Engineering, Czech Technical University, Prague (2000-2002; 2008-); Faculty of
Nuclear Physics and Engineering, Czech Technical University (since 2000-2006);
Faculty of Mathematics, Physics and Informatics, Comenius University,
Bratislava (1995-2002); Technical University Liberec (2001-2009); Faculty of
Mathematics and Physics, Charles University, Prague (2002-2005; 2008-2012);
Editorial Board:
·
AI
Communications
(European Journal on Artificial Intelligence)
Selected Publications[1]
SCOPUS Author ID: 35619249200
https://www.scopus.com/authid/detail.uri?authorId=35619249200&eid=2-s2.0-84947257202
1. Jan
van Leeuwen, Jirí Wiedermann:
Question answering by humans and
machines: A complexity-theoretic view. Theor. Comput. Sci. 777: 464-473 (2019)
2. Jirí
Wiedermann,
Jan van Leeuwen: Finite State Machines with Feedback: An Architecture Supporting Minimal
Machine Consciousness. In: Manea F., Martin B., Paulusma
D., Primiero G. (eds) Computing with Foresight and Industry. CiE 2019. Lecture Notes in Computer Science, vol 11558. Springer, Cham
3. Wiedermann, J.,
van Leeuwen, J. Epistemic Computation and Artificial Intelligence (2018) Studies in Applied Philosophy, Epistemology and Rational Ethics, 44, pp. 215-224.
4. Wiedermann, J., Van Leeuwen, J. Understanding and controlling artificial general intelligent systems(2017) Proceedings of AISB Annual Convention 2017, pp. 356-363.5. van Leeuwen, J., Wiedermann, J. Knowledge, representation and the dynamics of computation (2017) Studies in Applied Philosophy, Epistemology and Rational Ethics, 28, pp. 69-89.
6.
J. van Leeuwen, J.
Wiedermann, Turing machines with one-sided advice and acceptance of the co-RE
languages. Fundamenta Informaticae
153 (2017), pp. 347-366
7.
van Leeuwen,
J., Wiedermann, J. Separating the Classes of
Recursively Enumerable Languages Based on Machine Size, 2015, International Journal of
Foundations of Computer Science 26 (6), pp. 677-695
8.
Wiedermann, J., van Leeuwen,
J., Towards a computational theory of
epistemic creativity, 2015, AISB Convention 2015
9.
Wiedermann, J., van Leeuwen,
J., What is computation: An epistemic
approach, 2015, Lecture Notes in Computer Science
(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics) 8939, pp. 1-13
10. Wiedermann, J., Fast nondeterministic matrix
multiplication via derandomization of Freivalds' algorithm, , 2014, Lecture Notes in Computer Science
(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics) 8705 LNCS, pp. 123-135
11. Korec, I., Wiedermann, J., Deterministic verification of
integer matrix multiplication in quadratic time, ,
2014, Lecture Notes in Computer Science
(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics), 8327 LNCS, pp. 375-382
12. Wiedermann, J., Van Leeuwen,
J., Computation as knowledge
generation, with application to the observer-relativity problem, 2014, AISB
2014 - 50th Annual Convention of the AISB
13. J. van Leeuwen, J. Wiedermann, The computational power of Turing's
non-terminating circular a-machines. In: S.B. Cooper & J. van Leeuwen, Alan Turing: His Work and Impact, Elsevier, 2013,
pp. 80-84.
14. Wiedermann, J., Van Leeuwen,
J., Rethinking computations, 2013, 6th
AISB Symposium on Computing and Philosophy: The Scandal of Computation - What
is Computation? - AISB Convention 2013, pp. 6-10
15. Wiedermann, J., The creativity mechanisms in
embodied agents: An explanatory model, 2013, Proceedings of the 2013 IEEE Symposium on
Computational Intelligence for Human-Like Intelligence, CIHLI 2013 - 2013 IEEE
Symposium Series on Computational Intelligence, SSCI 2013, 6613263, pp. 41-47
16. Wiedermann, J., Towards constructive foundations of cognitivism: Breaking in open
doors?, 2013, Constructivist Foundations, 9 (1), pp.
38-40
17. Wiedermann, J., Computability and
non-computability issues in amorphous computing, 2012, Lecture Notes in Computer Science
(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics) , 7604 LNCS, pp. 1-9
18. Wiedermann,
J.: The many forms of amorphous computational systems. In: H. Zenil (Ed.): A Computable Universe. Understanding
Computation and Exploring Nature As Computation, 2012, 243-256, Singapore:
World Scientific
19. Wiedermann,
J.: Amorphous computing: a research agenda for the near future
Natural Computing, Vol. 11, Issue 1, 2012 pp. 59-63
20. Wiedermann,
J.: Thirty years of collaboration with Jan van Leeuwen:
In search of understanding computation. Bulletin of the European Association
for Theoretical Computer Science, 2012, Vol. 108, 148-160
21. Wiedermann,
J.: A computability argument against superintelligence. Cognitive Computation, Cognitive
Computation, 2012, Vol. 4, No. 3, 236-245
22. Wiedermann, J.: On the Road to Thinking Machines: Insights and Ideas (Invited Session Talk) To appear in: Turing Centenary Conference Computability in Europe (CiE) 2012 - How the World Computes. LNCS, Springer, 2012
23. Wiedermann,
J.: The Many Forms of Amorphous
Computational Systems. (Invited) In: H. Zenil (Editor): A Computable Universe:
Understanding Computation & Exploring Nature As
Computation. World Scientific Publishing Company, 2012, to appear
24. van Leeuwen, J.,
Wiedermann, J.: The computational power
of Turing’s non-terminating circular a-machines. (Invited) In: S. B.
Cooper, J. van Leeuwen (Eds),
Alan Turing - His Work and Impact, Elsevier Publ., 2012, to appear.
25. van
Leeuwen, J., Wiedermann, J: Computation
as an Unbounded Process. Theoretical
Computer Science, accepted (2012) (ISSN:
034-3975)
26. Wiedermann, J.:Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test. (Invited paper) In: SOFSEM 2012. Theory and Practice of Computer Science. (Ed.: Bieliková, M.) - Berlin: Springer, 2012, pp. 44-63 (ISSN 0302-9743) (Lecture Notes in Computer Science. 7147)
27.
van Leeuwen
J., Wiedermann, J.: Name
Resolution by Rewriting in Dynamic Networks of Mobile Entities. In: Rainbow of Computer Science. Dedicated to
Hermann Maurer on the Occasion of His 70th Birthday. Berlin,
Springer, 2011. (Ed.: Calude, C.; Rozenberg,
G.; Salomaa, A.), pp. 215-227 (ISBN
978-3-642-19390-3) (Lecture Notes in Computer Science. 6570)
28. Wiedermann,
J.: Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences. In: Description Complexity of Formal Systems. (Ed.: Holzer, M.; Kutrib, M.; Pighizzini, G.) - Berlin: Springer, 2011, pp. 314-327 (ISBN
978-3-642-22599-4) (SSN 0302-9743) Held: DCFS 2011. International Workshop on Descriptional Complexity of Formal Systems /13./. (Lecture Notes in Computer Science. 6808)
29.
Petrů L., Wiedermann J.: A Universal Flying Amorphous Computer In: Unconventional Computation. (Ed.: Calude, C.; Kari, J.; Petre, I.; Rozenberg, G.) - Berlin: Springer, 2011, pp. 189-200 (ISBN
978-3-642-21340-3) (ISSN 0302-9743) Held: UC 2011. Unconventional Computation
/10/. Turku (FI), 06.06.2011-10.06.2011
(Lecture Notes in Computer Science. 6714)
30. Wiedermann,
J.: The singularity might indeed be near,
but the next interesting level of intelligence is too far. In:
AISB 2011. Computing & Philosophy.
- (Kazakov, D.; Tsoulas,
G.) - York : The University of York, 2011, pp. 73-79 (ISBN
978-1-908187-03-1) Held: AISB 2011. York (GB), 04.04.2011-07.04.2011
31. Wiedermann,
J.: Nanomachine
Computing by Quorum Sensing. In: Computation, Cooperation, and Life. Essays
Dedicated to Gheorghe Paun on the Occasion of His
60th Birthday. Berlin : Springer, 2011 - (Ed.: Kelemen
J., Kelemenová A.), pp. 203-215 (ISBN
978-3-642-19999-8) (Lecture Notes in Computer Science. 6610)
32. Wiedermann,
J.: Amorphous Computing: A Research Agenda
for the Near Future.
Natural Computing, published online 20 August (2011) (ISSN: 1567-7818)
33.
Wiedermann, J.: A High Level Model of a Conscious
Embodied Agent. International
Journal of Software Science and Computational Intelligence, Vol. 2, No 3
(2010), pp. 62-78 (ISSN 1942-9045)
34. Wiedermann,
J.: On Super-Turing Computing Power and
Hierarchies of Artificial General Intelligence Systems.
In: Artificial General
Intelligence. - (Baum, E.; Hutter, M.; Kitzelmann, E.) - Amsterdam: Atlantis Press, 2010, pp.
196-197 (ISBN 978-90-78677-36-9) Held: AGI 2010. International Conference on
Artificial General Intelligence /3./. Lugano (CH), 05.03.2010-08.03.2010
35. Petrů
L., Wiedermann, J: On the Universal Computing Power of
Amorphous Computing Systems. Theory of Computing Systems, Vol. 45,
No 4 (2009), s. 995-1010 (ISSN 1432-4350)
36. Wiedermann,
J., Pardubská D.: Wireless
Mobile Computing and its Links to Descriptive Complexity. International
Journal of Foundations of Computer Science, Vol. 19, No 4 (2008), pp.
887-913 (ISSN 0129-0541)
37.
Wiedermann Jiří, Petrů
L.: Communicating
Mobile Nano-Machines and their Computational Power. In: Nano-Net 2008. Revised Selected Papers.(Ed.:
Cheng, M.) - . Berlin : Springer, 2009, pp. 123-130
(ISBN 978-3-642-02426-9) Held: Nano-Net 2008.
International Conference on Nano-Networks /3./. Boston (US), 14.09.2008-16.09.2008 (Lecture Notes of the
Institute for Computer Sciences, Social Informatics and Telecommunications
Engineering. 3).
38. Wiedermann,
J.: Autopoietic Automata: Complexity Issues
in Offspring-Producing Evolving Processes. Theoretical
Computer Science, Vol. 383, No 2-3 (2007), pp. 260-269 (ISSN 0304-3975)
39. Wiedermann
Jiří, Pardubská, D.: On the Power of Broadcasting in Mobile
Computing.
In: New Computational Paradigms.
Changing Conceptions of what is Computable. Berlin : Springer, 2008 -
(Ed.: Cooper B., Löwe B., Sorbi
A.), pp. 195-209 ( ISBN 978-0-387-36033-1)
40.
Wiedermann, J., van Leeuwen, J.: How
we Think of Computing Today?. (Invited.) In: Logic and Theory of Algorithms. (Ed.: Beckmann, A.; Dimitracopoulos, C.; Löwe, B.) -
Berlin: Springer, 2008, pp. 579-593. (ISBN 978-3-540-69405-2) Held: CiE 2008. Conference on Computability in Europe /4./. Athens (GR), 15.06.2008-20.06.2008 (Lecture Notes in
Computer Sciences. 5028)
41.
Wiedermann, J., Pardubská, D.: Wireless Parallel Computing and
Its Links to Descriptive Complexity. Invited talk, DCFS‘2007 (Descriptive
Complexity of Formal Systems), High Tatras, Slovakia,
2007
42.
Wiedermann, J., Pardubská, D.: On the Power of Broadcasting in
Mobile Computing. Chapter in: B. Cooper, B. Loewe, A. Sorbi
(eds.), New Computational Paradigms: Changing
Conceptions of What Is Computable. To appear in LNCS Springer-Verlag, New York Inc., 2007.
43. Wiedermann
J., Petrů L.: Computability in Amorphous Structures. Computation
and Logic in the Real World. (Ed.: Cooper, S.; Löwe,
B.; Sorbi, A.) - Berlin: Springer, 2007, pp. 781-790
(ISBN 978-3-540-73000-2) Held: CiE 2007.
Computability in Europe /3./. Siena (IT),
18.06.2007-23.06.2007 (Lecture Notes in Computer Science. 4497)
44. Petrů, L.,
Wiedermann, J.: A Model of an Amorphous Computer and its Communication
Protocol. LNCS, Springer, Vol. 4362,
2007, s.446-455
45. van Leeuwen, J.,
Wiedermann, J.: A Theory of Interactive Computation. A chapter in: Interactive
Computation: The New Paradigm. Goldin, D.; Smolka, S. A.; Wegner, P. (Eds.) Springer Verlag, XV, 487 p., 84 illus., Hardcover, 2006
47. Wiedermann,
J.: Globular Universe and Autopoietic Automata: A Framework for Artificial
Life. In: Advances in Artificial Life. (Ed.: Capcarrere M., Freitas
A.A., Bentley P.J., Johnson C.G., Timmis J.), Berlin, LNCS Vol. 3630, Springer-Verlag 2005, pp. 21-30
48. Wiedermann,
J.: Computing by Self-Reproduction: Autopoietic Automata. In:
Unconventional Computation. (Ed.: Calude C.S., Dinnen
M.J., Paun G., Perez-Jimenez M.J., Rozenberg G.) - Berlin, LNCS 3699, Springer-Verlag 2005, pp. 224-236, 2005
49. Verbaan, P.R.A., Leeuwen,
J. van, & Wiedermann, J. Complexity of Evolving Interactive Systems. In:
Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday
Springer-Verlag, Berlin, p. 261-281, 2004.
51. Wiedermann,
J.: Building a Bridge between Mirror Neurons and Theory of Embodied Cognition.
In: SOFSEM 2004: Theory and Practice of Computer Science (Ed. Peter van Emde Boas et al.), LNCS Vol. 2932,
Berlin, Springer 2004, p. 361-372
53.
Wiedermann, J.: The Computational Limits
to the Cognitive Power of the Neuroidal Tabula Rasa.
Journal of Experimental & Theoretical Artificial Intelligence (JETAI),
Taylor & Francis Publ., Vol. 15, No. 3, 2003, pp. 267-279
55. Wiedermann
J., van Leeuwen, J: The Emergent Computational
Potential of Evolving Artificial Living Systems. Ai Communications, IOS
Press, Vol. 15, No. 4, 2002, pp. 205-216
56. van Leeuwen, J. -
Wiedermann, J.: The Turing machine paradigm in contemporary computing, in: B. Enquist and W. Schmidt (Eds),
Mathematics Unlimited - 2001 and Beyond, Springer-Verlag,
2001, pp. 1139-1155.
57. van Leeuwen, J. - Wiedermann, J.: On algorithms and
interaction, in: M. Nielsen and B. Rovan (Eds), Mathematical Foundations of Computer Science 2000,
25th Int. Symposium (MFCS'2000), Lecture Notes in Computer Science Vol. 1893,
Springer-Verlag, Berlin, 2000, pp. 99-112.
59. Wiedermann,
J.: Towards Algorithmic Explanation of Mind Evolution and Functioning (Invited
Talk). In: L. Brim, J. Gruska and J. Zlatuška
(Eds.), Mathematical Foundations of Computer Science, Proc. of the 23-rd
International Symposium (MFCS'98), Lecture Notes in Computer Science Vol. 1450,
Springer Verlag, Berlin, 1998, pp. 152--166.
60. Šíma, J. - Wiedermann, J.: Theory of Neuromata. Journal of the ACM, Vol. 45, No. 1, 1998, pp.
155--178.
61. Wiedermann
J.: Speeding-up Single-Tape Nondeterministic Computations by Single
Alternation, with Separation Results. In: Automata, Languagues and Programming. ICALP'96. (Ed.: Meyer
auf der Heide F., Monien B.), LNCS Vol. 1099 - Berlin, Springer 1996, pp.
381-392
62. Wiedermann
J.: Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One
Alternation. In: Mathematical Foundation of Computer Science 1998. Proceedings.
(Ed.: Brim L., Gruska J., Zlatuška
J.), LNCS Vol. 1450, Berlin, Springer 1998, pp. 607-615
63.
Wiedermann J.: Fast Sequential and
Parallel Simulations of Nondeterministic Computations. Computers and Artificial
Intelligence, Vol. 13, 1994, No. 6, pp. 521-536
65. Wiedermann
J.: Optimal Algorithms for Sorting on Single Tape Turing Machines. In:
Algorithms, Software, Architecture. Information Processing '92.
Proceedings of the IFIP. (Ed.: Leeuwen van J.) Vol. : Vol. 1. - Amsterdam, North-Holland 1992, pp. 306-314
66. Wiedermann
J.: Weak Parallel Machines: A New Class of Physically Feasible Parallel Machine
Models (Invited Talk). In: Mathematical Foundations of Computer Science 1992.
Proceedings of the 17. International Symposium. (Ed.: Havel I.M., Koubek V.) - Berlin, Springer-Verlag 1992, LNCS Vol. 629, pp. 95-111
67. van Leeuwen J., Wiedermann J.:Array
Processing Machines: An Abstract Model, BIT, Vol. 27, 1987, pp. 25-43
68. Wiedermann
J.: Normalizing and Accelerating RAM Computations and the Problem of Reasonable
Space Measures. Proceedings ICALP'90. LNCS Vol 443, Berlin, Springer Verlag 1990, pp. 125-138
70. Wiedermann
J.: Fast Simulation of Nondeterministic Turing Machines With Applications to the Knapsack Problem.
Computers and Artificial Intelligence, Vol. 8, 1989, No. 6, pp. 591-596
71. Wiedermann,
J.: Searching Algorithms.- Leipzig, Verlaggesellschaft, Teubner Texte zur Mathematik, Vol. 99, 1987, 123p