default search action
Páidí Creed
Person information
- affiliation: University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j5]Andre Vauvelle, Páidí Creed, Spiros C. Denaxas:
Neural-signature methods for structured EHR prediction. BMC Medical Informatics Decis. Mak. 22(1): 320 (2022) - [c6]Adam Foster, Árpi Vezér, Craig A. Glastonbury, Páidí Creed, Samer Abujudeh, Aaron Sim:
Contrastive Mixture of Posteriors for Counterfactual Inference, Data Integration and Fairness. ICML 2022: 6578-6621 - 2021
- [c5]Aaron Sim, Maciej Wiatrak, Angus Brayne, Páidí Creed, Saee Paliwal:
Directed Graph Embeddings in Pseudo-Riemannian Manifolds. ICML 2021: 9681-9690 - [i7]Adam Foster, Árpi Vezér, Craig A. Glastonbury, Páidí Creed, Sam Abujudeh, Aaron Sim:
Contrastive Mixture of Posteriors for Counterfactual Inference, Data Integration and Fairness. CoRR abs/2106.08161 (2021) - [i6]Aaron Sim, Maciej Wiatrak, Angus Brayne, Páidí Creed, Saee Paliwal:
Directed Graph Embeddings in Pseudo-Riemannian Manifolds. CoRR abs/2106.08678 (2021)
2010 – 2019
- 2018
- [i5]Daniel Neil, Joss Briody, Alix Lacoste
, Aaron Sim, Páidí Creed, Amir Saffari:
Interpretable Graph Convolutional Neural Networks for Inference on Noisy Knowledge Graphs. CoRR abs/1812.00279 (2018) - 2013
- [j4]Páidí Creed, Mary Cryan:
The Number of Euler Tours of Random Directed Graphs. Electron. J. Comb. 20(3): 13 (2013) - [j3]David A. Cohen, Martin C. Cooper
An Algebraic Theory of Complexity for Discrete Optimization. SIAM J. Comput. 42(5): 1915-1939 (2013) - 2012
- [j2]David A. Cohen, Martin C. Cooper
The Tractability of CSP Classes Defined by Forbidden Patterns. J. Artif. Intell. Res. 45: 47-78 (2012) - [i4]Páidí Creed, Mary Cryan:
The number of Euler tours of a random directed graph. CoRR abs/1202.2156 (2012) - [i3]David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Discrete Optimisation. CoRR abs/1207.6692 (2012) - 2011
- [c4]Páidí Creed, Stanislav Zivný:
On Minimal Weighted Clones. CP 2011: 210-224 - [c3]David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. MFCS 2011: 231-242 - [i2]David A. Cohen, Martin C. Cooper, Páidí Creed, András Z. Salamon:
The tractability of CSP classes defined by forbidden patterns. CoRR abs/1103.1542 (2011)
2000 – 2009
- 2009
- [j1]Páidí J. Creed:
Sampling Eulerian orientations of triangular lattice graphs. J. Discrete Algorithms 7(2): 168-180 (2009) - 2007
- [i1]Páidí J. Creed:
Sampling Eulerian orientations of triangular lattice graphs. CoRR abs/cs/0703031 (2007) - 2006
- [c2]Páidí J. Creed:
Sampling Eulerian Orientations of the Triangle. ACiD 2006: 57-68 - 2004
- [c1]Kenneth N. Brown, James Little, Páidí J. Creed, Eugene C. Freuder:
Adversarial Constraint Satisfaction by Game-Tree Search. ECAI 2004: 151-155
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-04-25 05:47 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: