default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick Maier 0001
Person information
- affiliation: University of Stirling, UK
- affiliation (former): Sheffield Hallam University, UK
- affiliation (former): University of Glasgow, UK
- affiliation (former): Heriot-Watt University, Edinburgh, UK
- affiliation (former): University of Edinburgh, UK
- affiliation (former): Max-Planck-Institut für Informatik, Saarbrücken, Germany
Other persons with the same name
- Patrick Maier 0002 — Technische Universität München, Germasny
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Mila Goranova
, Gabriela Ochoa, Patrick Maier, Andrew Hoyle:
Evolutionary optimisation of antibiotic dosing regimens for bacteria with different levels of resistance. Artif. Intell. Medicine 133: 102405 (2022)- 2020
- [c23]Blair Archibald, Patrick Maier, Rob Stewart, Phil Trinder:
YewPar: skeletons for exact combinatorial search. PPoPP 2020: 292-307
2010 – 2019
- 2019
- [c22]Blair Archibald, Patrick Maier, Robert J. Stewart, Phil Trinder:
Implementing YewPar: A Framework for Parallel Tree Search. Euro-Par 2019: 184-196 - 2018
- [j4]Blair Archibald, Patrick Maier, Ciaran McCreesh, Robert J. Stewart, Phil Trinder:
Replicable parallel branch and bound search. J. Parallel Distributed Comput. 113: 92-114 (2018) - 2017
- [c21]Blair Archibald, Patrick Maier, Robert J. Stewart, Phil Trinder, Jan De Beule:
Towards Generic Scalable Parallel Combinatorial Search. PASCO@ISSAC 2017: 6:1-6:10 - [i1]Blair Archibald, Ciaran McCreesh, Patrick Maier, Rob Stewart, Phil Trinder:
Replicable Parallel Branch and Bound Search. CoRR abs/1703.05647 (2017) - 2016
- [j3]Reimer Behrends, Kevin Hammond, Vladimir Janjic, Alexander Konovalov, Steve Linton, Hans-Wolfgang Loidl, Patrick Maier, Phil Trinder:
HPC-GAP: engineering a 21st-century high-performance computer algebra system. Concurr. Comput. Pract. Exp. 28(13): 3606-3636 (2016) - [j2]Robert J. Stewart, Patrick Maier, Phil Trinder:
Transparent fault tolerance for scalable functional computation. J. Funct. Program. 26: e5 (2016) - [c20]Patrick Maier:
Why So Many?: A Brief Tour of Haskell DSLs for Parallel Programming. RWDSL@CGO 2016: 5:1-5:2 - [c19]Patrick Maier, John Magnus Morton, Phil Trinder:
JIT costing adaptive skeletons for performance portability. FHPC@ICFP 2016: 23-30 - [c18]John Magnus Morton, Patrick Maier, Phil Trinder:
JIT-Based Cost Analysis for Dynamic Program Transformations. RAC@ETAPS 2016: 5-25 - 2014
- [j1]Patrick Maier, Robert J. Stewart, Philip W. Trinder:
Reliable scalable symbolic computation: The design of SymGridPar2. Comput. Lang. Syst. Struct. 40(1): 19-35 (2014) - [c17]Patrick Maier, Daria Livesey, Hans-Wolfgang Loidl, Phil Trinder:
High-Performance Computer Algebra: A Hecke Algebra Case Study. Euro-Par 2014: 415-426 - [c16]Patrick Maier, Robert J. Stewart, Phil Trinder:
The HdpH DSLs for scalable reliable computation. Haskell 2014: 65-76 - 2013
- [c15]Patrick Maier, Robert J. Stewart, Philip W. Trinder:
Reliable scalable symbolic computation: the design of SymGridPar2. SAC 2013: 1674-1681 - 2012
- [c14]Robert J. Stewart, Phil Trinder, Patrick Maier:
Supervised Workpools for Reliable Massively Parallel Computing. Trends in Functional Programming 2012: 247-262 - 2011
- [c13]Patrick Maier, Philip W. Trinder:
Implementing a High-Level Distributed-Memory Parallel Haskell in Haskell. IFL 2011: 35-50 - 2010
- [c12]Simon Marlow, Patrick Maier, Hans-Wolfgang Loidl, Mustafa Aswad, Philip W. Trinder:
Seq no more: better strategies for parallel Haskell. Haskell 2010: 91-102
2000 – 2009
- 2009
- [c11]Lilia Georgieva, Patrick Maier:
Inductive Reasoning for Shape Invariants. FTP 2009 - [c10]Patrick Maier:
Deciding Extensions of the Theories of Vectors and Bags. VMCAI 2009: 245-259 - 2007
- [c9]David Aspinall, Patrick Maier, Ian Stark:
Safety Guarantees from Explicit Resource Management. FMCO 2007: 52-71 - [c8]David Aspinall, Patrick Maier, Ian Stark:
Monitoring External Resources in Java MIDP. REM@ESORICS 2007: 17-30 - 2005
- [c7]Witold Charatonik, Lilia Georgieva, Patrick Maier:
Bounded Model Checking of Pointer Programs. CSL 2005: 397-412 - [c6]Lilia Georgieva, Patrick Maier:
Towards Using Description Logics for Symbolic Shape Analysis. Description Logics 2005 - [c5]Jochen Hoenicke, Patrick Maier:
Model-Checking of Specifications Integrating Processes, Data and Time. FM 2005: 465-480 - [c4]Lilia Georgieva, Patrick Maier:
Description Logics for Shape Analysis. SEFM 2005: 321-331 - 2004
- [c3]Patrick Maier:
Intuitionistic LTL and a New Characterization of Safety and Liveness. CSL 2004: 295-309 - 2003
- [b1]Patrick Maier:
A lattice-theoretic framework for circular assume-guarantee reasoning. Saarland University, Saarbrücken, Germany, 2003, pp. 1-119 - [c2]Patrick Maier:
Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete. FoSSaCS 2003: 343-357 - 2001
- [c1]Patrick Maier:
A Set-Theoretic Framework for Assume-Guarantee Reasoning. ICALP 2001: 821-834
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
