Páidí Creed

发表

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection

Stanislav Zivny, David A. Cohen, Páidí Creed, 2011, MFCS.

Sampling Eulerian orientations of triangular lattice graphs

Páidí Creed, 2009, J. Discrete Algorithms.

THERMAL TEST SCHEDULING USING CONSTRAINT PROGRAMMING

James Little, Suresh Goyal, Páidí Creed, 2006 .

Sampling Eulerian Orientations of the Triangle

Páidí Creed, 2006, ACiD.

On Minimal Weighted Clones

Stanislav Zivny, Páidí Creed, Páidí Creed, 2011, CP.

The Number of Euler Tours of Random Directed Graphs

Páidí Creed, Mary Cryan, 2013, Electron. J. Comb..

Adversarial Constraint Satisfaction by Game-Tree Search

Kenneth N. Brown, Eugene C. Freuder, James Little, 2004, ECAI.

An Algebraic Theory of Complexity for Discrete Optimization

Martin C. Cooper, Stanislav Zivny, David A. Cohen, 2012, SIAM J. Comput..

DMTCS Proceedings, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)

Páidí Creed, Mary Cryan, 2010 .

The number of Euler tours of a random regular graph

Páidí Creed, Mary Cryan, Mary Cryan, 2013 .