Wolfgang Maass - US grants

Affiliations:

Technische Universität Graz, Graz, Steiermark, Austria

Area:

computation & theory

Tree Info Publications Similar researchers Related pubs Distance to... Nearest Nobel PubMed Report error

We are testing a new system for linking grants to scientists.

The funding information displayed below comes from the NIH Research Portfolio Online Reporting Tools and the NSF Award Database.
The grant data on this page is limited to grants awarded in the United States and is thus partial. It can nonetheless be used to understand how funding patterns influence mentorship networks and vice-versa, which has deep implications on how research is done.
You can help! If you notice any innacuracies, please sign in and mark grants as correct or incorrect matches.

Sign in to see low-probability grants and correct any errors in linkage between grants and researchers.

High-probability grants

According to our matching algorithm, Wolfgang Maass is the likely recipient of the following grants.

Years	Recipients	Code	Title / Keywords	Matching score
1985 — 1988	Maass, Wolfgang	N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information	Lower Bound Arguments in Machine Based Complexity Theory (Computer Research) @ University of Illinois At Chicago	0.937
1987 — 1990	Maass, Wolfgang	N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information	Lower Bound Arguments in Machine Based Complexity Theory @ University of Illinois At Chicago Mathematical arguments are being developed for proving lower bounds on the computation time and on other resources in machine based complexity theory. Combinatorial methods are being explored for answering a number of fundamental questions about important methods for both sequential and parallel computers. Among the mdoels considered are Turing machines, random access machines, branching programs, and circuits. Lower bound results are important in the science of computing for at least two major reasons: (1) they allow evaluation and comparison of various computational models that reflect interesting aspects of currently existing computers and of potential future computers; and (2) they allow comparisons of the use of computational resources by currently known algorithms with theoretically established optimal limits. Thus lower bound results may indicate where room for improvement lies in both computational models and in existing algorithms. Show summary Hide summary	0.937
1987 — 1988	Maass, Wolfgang	N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information	Mathematical and Computer Sciences: Conference On Combinatorics and Complexity, Chicago, Illinois, June 15-19,1987 @ University of Illinois At Chicago	0.937
1987 — 1988	Maass, Wolfgang	N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information	U.S.-Hungary Workshop On Combinatorics (Mathematics) @ University of Illinois At Chicago	0.937
1989 — 1992	Maass, Wolfgang	N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information	Lower Bounds and Structural Results in Complexity Theory @ University of Illinois At Chicago Three major issues are addressed in this project: 1) the computational power of Boolean circuits with threshold gates, as well as their ability to "learn" (with an emphasis on the development of techniques for proving lower bounds); 2) the mathematical structure of complexity classes and degrees in low-level complexity theory; and 3) the relationship between combinatorial and extensional properties of a set and its computational complexity. Show summary Hide summary	0.937
1991 — 1994	Maass, Wolfgang	N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information	Topics in Computational Learning Theory @ University of Illinois At Chicago This research project addresses problems in computational learning theory, the investigation of algorithms and formal methods for various natural and artificial learning systems. The following specific topics are addressed in this project: the complexity of on-line learning with an oblivious environment; the power of randomization for on-line learning; design of space-efficient algorithms for on-line learning; design and analysis of error-tolerant on-line learning algorithms; on-line learning of definitions in fragments of first order predicate logic; analysis of the computational power of common computational neural network models; design and analysis of learning algorithms for concept classes on neural networks of depth 2. Show summary Hide summary	0.937