Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Molloy, Michael J.
29  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Awareness:

, In: Catastrophic Perioperative Complications and Management,
Carvajal, Tomas ; Misra, Lopa ; Molloy, Michael. - p. 45-59 , 2019
Link: https://doi.org/10.1007/..
 
?
2

Frozen variables in random boolean constraint satisfaction ..:

, In: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms,
Molloy, Michael ; Restrepo, Ricardo - p. 1306-1318 , 2013
Link: https://dl.acm.org/doi/1..
 
?
3

The freezing threshold for k-colourings of a random graph:

, In: Proceedings of the forty-fourth annual ACM symposium on Theory of computing,
Molloy, Michael - p. 921-930 , 2012
Link: https://dl.acm.org/doi/1..
 
?
4

The scaling window for a random graph with a given degree s..:

, In: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms,
Hatami, Hamed ; Molloy, Michael - p. 1403-1411 , 2010
Link: https://dl.acm.org/doi/1..
 
?
5

Asymptotically optimal frugal colouring:

, In: Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms,
Molloy, Michael ; Reed, Bruce - p. 106-114 , 2009
Link: https://dl.acm.org/doi/1..
 
?
6

Exponential bounds for DPLL below the satisfiability thresh..:

, In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms,
Achlioptas, Dimitris ; Beame, Paul ; Molloy, Michael - p. 139-140 , 2004
Link: https://dl.acm.org/doi/1..
 
?
7

The pure literal rule threshold and cores in random hypergr..:

, In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms,
Molloy, Michael - p. 672-681 , 2004
Link: https://dl.acm.org/doi/1..
 
?
8

Models and thresholds for random constraint satisfaction pr..:

, In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing,
Molloy, Michael - p. 209-217 , 2002
Link: https://dl.acm.org/doi/1..
 
?
9

The Glauber dynamics on colourings of a graph with high gir..:

, In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing,
Molloy, Michael - p. 91-98 , 2002
Link: https://dl.acm.org/doi/1..
 
?
10

Optimal depth-first strategies for and-or trees:

, In: Eighteenth national conference on Artificial intelligence,
Greiner, Russell ; Hayward, Ryan ; Molloy, Michael - p. 725-730 , 2002
Link: https://dl.acm.org/doi/1..
 
?
11

A sharp threshold in proof complexity:

, In: Proceedings of the thirty-third annual ACM symposium on Theory of computing,
Achlioptas, Dimitris ; Beame, Paul ; Molloy, Michael - p. 337-346 , 2001
Link: https://dl.acm.org/doi/1..
 
?
12

Colouring graphs when the number of colours is nearly the m..:

, In: Proceedings of the thirty-third annual ACM symposium on Theory of computing,
Molloy, Michael ; Reed, Bruce - p. 462-470 , 2001
Link: https://dl.acm.org/doi/1..
 
?
13

Further algorithmic aspects of the local lemma:

, In: Proceedings of the thirtieth annual ACM symposium on Theory of computing,
Molloy, Michael ; Reed, Bruce - p. 524-529 , 1998
Link: https://dl.acm.org/doi/1..
 
?
14

Medical Logistics and Operational Planning for Patient Care..:

, In: Mass Gathering Medicine,
Goldberg, Scott A. ; Nichols, L. Scott ; Molloy, Michael S.. - p. 41-56 , 2024
Link: https://doi.org/10.1017/..
 
?
15

Simulation of the LAN behavior in the distributed HP-UXenvi..:

, In: Proceedings of the 22nd conference on Winter simulation,
Devai, Joseph J. ; Kerrigan, Thomas C. ; Molloy, Michael K. - p. 805-812 , 1990
Link: https://dl.acm.org/doi/1..
 
1-15