Wolfgang Maass

From MaRDI portal
Person:353853

Available identifiers

zbMath Open maass.wolfgangDBLPm/WolfgangMaassWikidataQ49266810 ScholiaQ49266810MaRDI QIDQ353853

List of research outcomes





PublicationDate of PublicationType
Reservoirs learn to learn2021-09-30Paper
Long Term Memory and the Densest K-Subgraph Problem2021-06-15Paper
Emergence of Optimal Decoding of Population Codes Through STDP2019-06-12Paper
Bounds for the computational power and learning complexity of analog neural nets2015-05-07Paper
The role of feedback in morphological computation with compliant bodies2013-07-16Paper
A learning rule for very simple universal approximators consisting of a single layer of perceptrons2013-01-17Paper
Towards a theoretical foundation for morphological computation with compliant bodies2012-10-19Paper
Liquid state machines: motivation, theory, and applications2012-09-05Paper
Biologically inspired kinematic synergies enable linear balance control of a humanoid robot2012-02-27Paper
A Theoretical Basis for Emergent Pattern Discrimination in Neural Systems Through Slow Feature Extraction2011-01-20Paper
A Spiking Neuron as Information Bottleneck2010-08-17Paper
Reward-modulated Hebbian learning of decision making2010-06-11Paper
Belief Propagation in Networks of Spiking Neurons2009-10-09Paper
Spiking Neurons Can Learn to Solve Information Bottleneck Problems and Extract Independent Components2009-03-25Paper
Energy Complexity and Entropy of Threshold Circuits2009-03-12Paper
On the Classification Capability of Sign-Constrained Perceptrons2008-11-19Paper
Liquid Computing2007-11-13Paper
Edge of chaos and prediction of computational performance for neural circuit models2007-07-11Paper
On the Computational Power of Threshold Circuits with Sparse Activity2007-02-12Paper
A model for the interaction of oscillations and pattern generation with real-time computing in generic neural microcircuit models2006-10-10Paper
What Can a Neuron Learn with Spike-Timing-Dependent Plasticity?2005-10-26Paper
Movement Generation with Circuits of Spiking Neurons2005-10-18Paper
On the computational power of circuits of spiking neurons2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q47365642004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44235702003-09-08Paper
https://portal.mardi4nfdi.de/entity/Q47064452003-06-16Paper
https://portal.mardi4nfdi.de/entity/Q47064752003-06-16Paper
Spiking neurons and the induction of finite state machines.2003-01-21Paper
Neural circuits for pattern recognition with small total wire length.2003-01-21Paper
On the complexity of learning for spiking neurons with temporal coding.2003-01-14Paper
Efficient temporal processing with biologically realistic dynamic synapses2002-10-10Paper
Computing the optimally fitted spike train for a synapse2002-07-02Paper
Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations2002-01-01Paper
Neural computation: A research topic for theoretical computer science? Some thoughts and pointers2001-12-18Paper
On the relevance of time in neural computation and learning2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q47904192001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q49376942000-02-10Paper
On computation with pulses1999-03-30Paper
A simple model for neural computation with firing rates and firing correlations1999-03-04Paper
Networks of spiking neurons can emulate arbitrary Hopfield nets in temporal coding1998-11-03Paper
Efficient learning with virtual threshold gates1998-04-26Paper
Bounds for the Computational Power and Learning Complexity of Analog Neural Nets1997-05-26Paper
Fast Sigmoidal Networks via Spiking Neurons1997-03-18Paper
Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning1996-11-26Paper
Lower Bounds for the Computational Power of Networks of Spiking Neurons1996-06-05Paper
https://portal.mardi4nfdi.de/entity/Q48390541996-04-16Paper
https://portal.mardi4nfdi.de/entity/Q48390581996-04-16Paper
On the complexity of function learning1995-10-29Paper
https://portal.mardi4nfdi.de/entity/Q48390551995-07-13Paper
Neural Nets with Superlinear VC-Dimension1995-06-12Paper
On-line learning of rectangles and unions of rectangles1995-01-15Paper
Fast identification of geometric objects with membership queries1995-01-01Paper
Algorithms and lower bounds for on-line learning of geometrical concepts1994-07-12Paper
Two tapes versus one for off-line Turing machines1994-05-08Paper
Threshold circuits of bounded depth1993-06-29Paper
The complexity of matrix transposition on one-tape off-line Turing machines with output tape1993-05-16Paper
Lower bound methods and separation results for on-line learning models1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40135551992-09-27Paper
The complexity types of computable sets1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40103631992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39748761992-06-26Paper
The complexity of matrix transposition on one-tape off-line Turing machines1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34873281990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38354491989-01-01Paper
Motion planning among time dependent obstacles1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952161988-01-01Paper
Meanders and their applications in lower bounds arguments1988-01-01Paper
Lower bound arguments with ``inaccessible numbers1988-01-01Paper
On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines1988-01-01Paper
On the construction of Lyapunov functions for a class of evolution equations1988-01-01Paper
Fast approximation algorithms for a nonconvex covering problem1987-01-01Paper
Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30333211986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37510091986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37510081986-01-01Paper
On the Complexity of Nonconvex Covering1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37458311986-01-01Paper
Approximation schemes for covering and packing problems in image processing and VLSI1985-01-01Paper
Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37151031985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37205801985-01-01Paper
Stability properties of a class of kinetic equations including Boltzmann's equation1985-01-01Paper
Variations on promptly simple sets1985-01-01Paper
On the orbits of hyperhypersimple sets1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32214061984-01-01Paper
Oracle-dependent properties of the lattice of NP sets1983-01-01Paper
Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets1983-01-01Paper
The intervals of the lattice of recursively enumerable sets determined by major subsets1983-01-01Paper
Recursively enumerable generic sets1982-01-01Paper
Splitting properties and jump classes1981-01-01Paper
Recursively invariant β-recursion theory1981-01-01Paper
A Countable Basis For Σ 1 2 Sets and Recursion Theory on ℵ 11981-01-01Paper
On α- and β-recursively enumerable degrees1979-01-01Paper
Inadmissibility, tame R.E. sets and the admissible collapse1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41456971978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41803381978-01-01Paper
The uniform regular set theorem in α-recursion theory1978-01-01Paper
On minimal pairs and minimal degrees in higher recursion theory1977-01-01Paper
Eine Funktionalinterpretation der prädikativen Analysis1976-01-01Paper
On the sign of successive time derivatives of Boltzmann's H function1970-01-01Paper

Research outcomes over time

This page was built for person: Wolfgang Maass