Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Home Topics Titles Quotes Blog Featured Help
Search
 
Wolfgang Schreiner
Johannes Kepler University
Linz, Austria
 

Wolfgang Schreiner is an associate professor at the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz in Austria. His research areas are formal methods; concurrency; and parallel, distributed, and grid computing.

Wolfgang Schreiner was born in 1967 in Austria. In 1994, he earned his PhD at the Johannes Kepler University Linz under the auspices of the federal president with a thesis on parallel functional programming for computer algebra. In 2001, he earned habilitation in practical computer science for his work on parallel software and algorithms for symbolic computation. From 2001 to 2004, he was the director of the degree program "Engineering for Computer-based Learning" at the Upper Austria University of Applied Sciences campus Hagenberg, where he still serves as a lecturer. Since 2004, he has been an associate professor at the RISC institute, where he served as vice-chair from 2004 to 2007.

During his career, Schreiner has participated in and directed various research projects funded by the Austrian Science Foundation, the Austrian Ministry for Science and Research, and the European Union. These projects include "Distributed Supercomputing in the Grid," "MathBroker I+II: Brokering Distributed Mathematical Services," and "HPGP: High-Performance Generic Programming." He has developed various software systems such as the para-functional language compiler pD, the parallel computer algebra software Distributed Maple, and the proving assistant RISC ProofNavigator.

Currently, Schreiner is participating in the doctoral program for computational mathematics at the Johannes Kepler University with a project on formally specified computer algebra software. He is also building the RISC ProgramExplorer, a software environment for program specification, exploration, and verification.

--

Read our Q&A with Wolfgang Schreiner here.


     

Algorithm 995: an efficient parallel anisotropic Delaunay mesh generator for two-dimensional finite element analysis
Pardue J., Chernikov A.  ACM Transactions on Mathematical Software 45(3): 1-30, 2019. Type: Article

Finite element analysis (FEA) depends on meshes that approximate the artifact to be analyzed. Starting with an initial mesh, an FEA development pipeline produces more and more refined meshes in an iterative process until the solution of the partia...

 

Exploring the prediction of variety-seeking behavior
Li J., Zhao J., Mao M., Zhao X., Zou J.  DSIT 2019 (Proceedings of the 2nd International Conference on Data Science and Information Technology, Seoul, South Korea,  Jul 19-21, 2019) 59-63, 2019. Type: Proceedings

Modern marketing applies data analytics to determine measures that influence a customer’s future purchase decisions based on past behavior. One aspect of this behavior is that customers like to vary their purchases over time by choosing alte...

 

Logic functions and equations: binary models for computer science (2nd ed.)
Posthoff C., Steinbach B.,  Springer International Publishing, New York, NY, 2019. 508 pp. Type: Book (978-3-030024-19-2)

Logic functions, commonly known as Boolean functions, arise in many areas of computer science and information technology. On a fundamental technological level, every digital circuit can be modeled as a Boolean function. Design, optimization, and c...

 

Advanced Boolean techniques: selected papers from the 13th International Workshop on Boolean Problems
Drechsler R., Soeken M.,  Springer International Publishing, New York, NY, 2019. 265 pp. Type: Book (978-3-030203-22-1)

Boolean functions--functions on the domain of the logical values “true” and “false”--represent a fundamental concept of computer science with applications in many areas, including the design of digital circuits, t...

 

Hierarchies in inclusion logic with lax semantics
Hannula M.  ACM Transactions on Computational Logic 19(3): 1-23, 2018. Type: Article

A natural interest of computational logic is to investigate decidable subsets of first-order logic. One such subset is the formalism of inclusion logic (FOI), introduced by Galliani as an evolution of dependence logic [1], which investigates funct...

 
  more...

 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2020 ThinkLoud, Inc.
Terms of Use
| Privacy Policy