On the Lower Bound for Minimum Comparison Selection. - Peter Ruzicka; Juraj Wiedermann (MFCS, 1976)

How Good Is the Adversary Lower Bound? - Peter Ruzicka; Juraj Wiedermann (MFCS, 1977)

The Complexity of Lexicographic Sorting and Searching. - Juraj Wiedermann (MFCS, 1979)

Preserving Total Order in Constant Expected Time. - Juraj Wiedermann (MFCS, 1981)

Deterministic and Nondeterministic Simulation of the RAM by the Turing Machine. - Juraj Wiedermann (IFIP Congress, 1983)

Array processing machines. - Jan van Leeuwen; Jirí Wiedermann (FCT, 1985)

Array Processing Machines: An Abstract Model. - Jan van Leeuwen; Jirí Wiedermann (BIT, 1987)

On the Power of Synchronization. - Juraj Wiedermann (J. Inf. Process. Cybern., 1989)

Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures. - Juraj Wiedermann (ICALP, 1990)

Complexity Issues in Discrete Neurocomputing. - Juraj Wiedermann (IMYCS, 1990)

Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines. - Juraj Wiedermann (FAIR, 1991)

On the Computational Efficiency of Symmetric Neural Networks. - Juraj Wiedermann (Theor. Comput. Sci., 1991)

Optimal Algorithms for Sorting on Single-tape Turing Machines. - Juraj Wiedermann (IFIP Congress (1), 1992)

Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models. - Juraj Wiedermann (MFCS, 1992)

Quo Vadetis, Parallel Machine Models? - Jirí Wiedermann (Computer Science Today, 1995)

Neural Language Acceptors. - Jirí Síma; Jirí Wiedermann (Developments in Language Theory, 1995)

Parallel Machine Models: How They Are and Where Are They Going. - Jirí Wiedermann (SOFSEM, 1995)

Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results. - Jirí Wiedermann (ICALP, 1996)

Towards Machines That Can Think. - Jirí Wiedermann (SOFSEM, 1997)

Towards Algorithmic Explanation of Mind Evolution and Functioning. - Jirí Wiedermann (MFCS, 1998)

Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One Alternation. - Jirí Wiedermann (MFCS, 1998)

Theory of Neuromata. - Jirí Síma; Jirí Wiedermann (J. ACM, 1998)

Computational Power of Neuroidal Nets. - Jirí Wiedermann (SOFSEM, 1999)

Simulating the Mind: A Gaunlet Thrown to Computer Science. - Jirí Wiedermann (ACM Comput. Surv., 1999)

On the Power of Interactive Computing. - Jan van Leeuwen; Jirí Wiedermann (IFIP TCS, 2000)

Towards a Computational Theory of Everything. - Jirí Wiedermann (IFIP TCS, 2000)

On Algorithms and Interaction. - Jan van Leeuwen; Jirí Wiedermann (MFCS, 2000)

Emergence of a Super-Turing Computational Potential in Artificial Living Systems. - Jirí Wiedermann; Jan van Leeuwen (ECAL, 2001)

Beyond the Turing Limit: Evolving Interactive Systems. - Jan van Leeuwen; Jirí Wiedermann (SOFSEM, 2001)

Relativistic Computers and Non-uniform Complexity Theory. - Jirí Wiedermann; Jan van Leeuwen (UMC, 2002)

The emergent computational potential of evolving artificial living systems. - Jirí Wiedermann; Jan van Leeuwen (AI Commun., 2002)

Fuzzy Turing Machines Revised. - Jirí Wiedermann (Comput. Artif. Intell., 2002)

Mirror Neurons, Embodied Cognitive Agents and Imitation Learning. - Jirí Wiedermann (Comput. Artif. Intell., 2003)

The computational limits to the cognitive power of the neuroidal tabula rasa. - Jirí Wiedermann (J. Exp. Theor. Artif. Intell., 2003)

Complexity of Evolving Interactive Systems. - Peter Verbaan; Jan van Leeuwen; Jirí Wiedermann (Theory Is Forever, 2004)

Building a Bridge between Mirror Neurons and Theory of Embodied Cognition. - Jirí Wiedermann (SOFSEM, 2004)

Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines. - Jirí Wiedermann (Theor. Comput. Sci., 2004)

Globular Universe and Autopoietic Automata: A Framework for Artificial Life. - Jirí Wiedermann (ECAL, 2005)

Computing by Self-reproduction: Autopoietic Automata. - Jirí Wiedermann (UC, 2005)

Computability in Amorphous Structures. - Jirí Wiedermann; Lukás Petru (CiE, 2007)

Wireless Parallel Computing and its Links to Descriptive Complexity. - Jirí Wiedermann; Dana Pardubská (DCFS, 2007)

A Model of an Amorphous Computer and Its Communication Protocol. - Lukás Petru; Jirí Wiedermann (SOFSEM (1), 2007)

Autopoietic automata: Complexity issues in offspring-producing evolving processes. - Jirí Wiedermann (Theor. Comput. Sci., 2007)

How We Think of Computing Today. - Jirí Wiedermann; Jan van Leeuwen (CiE, 2008)

Communicating Mobile Nano-Machines and Their Computational Power. - Jirí Wiedermann; Lukás Petru (NanoNet, 2008)

Wireless Mobile Computing and its Links to Descriptive Complexity. - Jirí Wiedermann; Dana Pardubská (Int. J. Found. Comput. Sci., 2008)

On the Universal Computing Power of Amorphous Computing Systems. - Jirí Wiedermann; Lukás Petru (Theory Comput. Syst., 2009)

A High Level Model of a Conscious Embodied Agent. - Jirí Wiedermann (Int. J. Softw. Sci. Comput. Intell., 2010)

Name Resolution by Rewriting in Dynamic Networks of Mobile Entities. - Jan van Leeuwen; Jirí Wiedermann (Rainbow of Computer Science, 2011)

Nanomachine Computing by Quorum Sensing. - Jirí Wiedermann (Computation, Cooperation, and Life, 2011)

Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences. - Jirí Wiedermann (DCFS, 2011)

A Universal Flying Amorphous Computer. - Lukás Petru; Jirí Wiedermann (UC, 2011)

On the Road to Thinking Machines: Insights and Ideas. - Jirí Wiedermann (CiE, 2012)

Computability and Non-computability Issues in Amorphous Computing. - Jirí Wiedermann (IFIP TCS, 2012)

Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test. - Jirí Wiedermann (SOFSEM, 2012)

A Computability Argument Against Superintelligence. - Jirí Wiedermann (Cogn. Comput., 2012)

Thirty Years of Collaboration with Jan van Leeuwen: In Search of Understanding Computation. - Jirí Wiedermann (Bull. EATCS, 2012)

Amorphous computing: a research agenda for the near future. - Jirí Wiedermann (Nat. Comput., 2012)

Computation as an unbounded process. - Jan van Leeuwen; Jirí Wiedermann (Theor. Comput. Sci., 2012)

The creativity mechanisms in embodied agents: An explanatory model. - Jirí Wiedermann (CIHLI, 2013)

A Robust Universal Flying Amorphous Computer. - Lukás Petru; Jirí Wiedermann (Computing with New Resources, 2014)

Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm. - Jirí Wiedermann (IFIP TCS, 2014)

Deterministic Verification of Integer Matrix Multiplication in Quadratic Time. - Ivan Korec; Jirí Wiedermann (SOFSEM, 2014)

What is Computation: An Epistemic Approach. - Jirí Wiedermann; Jan van Leeuwen (SOFSEM, 2015)

Separating the Classes of Recursively Enumerable Languages Based on Machine Size. - Jan van Leeuwen; Jirí Wiedermann (Int. J. Found. Comput. Sci., 2015)

Non-classical Turing machines: extending the notion of computation. - Jirí Wiedermann; Jan van Leeuwen (NCMA, 2017)

Epistemic Computation and Artificial Intelligence. - Jirí Wiedermann; Jan van Leeuwen (PT-AI, 2017)

Turing Machines with One-sided Advice and Acceptance of the co-RE Languages. - Jan van Leeuwen; Jirí Wiedermann (Fundam. Informaticae, 2017)

Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness. - Jirí Wiedermann; Jan van Leeuwen (CiE, 2019)

Question answering by humans and machines: A complexity-theoretic view. - Jan van Leeuwen; Jirí Wiedermann (Theor. Comput. Sci., 2019)

Towards Minimally Conscious Cyber-Physical Systems: A Manifesto. - Jirí Wiedermann; Jan van Leeuwen (SOFSEM, 2021)

Large Language Models and the Extended Church-Turing Thesis. - Jirí Wiedermann; Jan van Leeuwen (NCMA, 2024)