Patrick Maier

Orcid: 0000-0002-7051-8169

Affiliations:
  • University of Stirling, UK
  • Sheffield Hallam University, UK (former)
  • University of Glasgow, UK (former)
  • Heriot-Watt University, Edinburgh, UK (former)
  • University of Edinburgh, UK (former)
  • Max-Planck-Institut für Informatik, Saarbrücken, Germany (former)


According to our database1, Patrick Maier authored at least 28 papers between 2001 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Evolutionary optimisation of antibiotic dosing regimens for bacteria with different levels of resistance.
Artif. Intell. Medicine, 2022

2020
YewPar: skeletons for exact combinatorial search.
Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

2019
Implementing YewPar: A Framework for Parallel Tree Search.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

2018
Replicable parallel branch and bound search.
J. Parallel Distributed Comput., 2018

2017
Towards Generic Scalable Parallel Combinatorial Search.
Proceedings of the International Workshop on Parallel Symbolic Computation, 2017

2016
Transparent fault tolerance for scalable functional computation.
J. Funct. Program., 2016

JIT-Based Cost Analysis for Dynamic Program Transformations.
Proceedings of the Resource Aware Computing, 2016

HPC-GAP: engineering a 21st-century high-performance computer algebra system.
Concurr. Comput. Pract. Exp., 2016

JIT costing adaptive skeletons for performance portability.
Proceedings of the 5th International Workshop on Functional High-Performance Computing, 2016

Why So Many?: A Brief Tour of Haskell DSLs for Parallel Programming.
Proceedings of the 1st International Workshop on Real World Domain Specific Languages, 2016

2014
Reliable scalable symbolic computation: The design of SymGridPar2.
Comput. Lang. Syst. Struct., 2014

The HdpH DSLs for scalable reliable computation.
Proceedings of the 2014 ACM SIGPLAN symposium on Haskell, 2014

High-Performance Computer Algebra: A Hecke Algebra Case Study.
Proceedings of the Euro-Par 2014 Parallel Processing, 2014

2012
Supervised Workpools for Reliable Massively Parallel Computing.
Proceedings of the Trends in Functional Programming - 13th International Symposium, 2012

2011
Implementing a High-Level Distributed-Memory Parallel Haskell in Haskell.
Proceedings of the Implementation and Application of Functional Languages, 2011

2010
Seq no more: better strategies for parallel Haskell.
Proceedings of the 3rd ACM SIGPLAN Symposium on Haskell, 2010

2009
Deciding Extensions of the Theories of Vectors and Bags.
Proceedings of the Verification, 2009

Inductive Reasoning for Shape Invariants.
Proceedings of the 7th International Workshop on First-Order Theorem Proving, 2009

2007
Monitoring External Resources in Java MIDP.
Proceedings of the First International Workshop on Run Time Enforcement for Mobile and Distributed Systems, 2007

Safety Guarantees from Explicit Resource Management.
Proceedings of the Formal Methods for Components and Objects, 6th International Symposium, 2007

2005
Description Logics for Shape Analysis.
Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 2005

Model-Checking of Specifications Integrating Processes, Data and Time.
Proceedings of the FM 2005: Formal Methods, 2005

Towards Using Description Logics for Symbolic Shape Analysis.
Proceedings of the 2005 International Workshop on Description Logics (DL2005), 2005

Bounded Model Checking of Pointer Programs.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004
Intuitionistic LTL and a New Characterization of Safety and Liveness.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
A lattice-theoretic framework for circular assume-guarantee reasoning.
PhD thesis, 2003

Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2001
A Set-Theoretic Framework for Assume-Guarantee Reasoning.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001


  Loading...