The SCEAS System
| |||||||

## Search the dblp DataBase
Michael Molloy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Russell Greiner, Ryan Hayward, Michael Molloy
**Optimal Depth-First Strategies for And-Or Trees.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2002, pp:725-730 [Conf] - Michael Molloy, Mohammad R. Salavatipour
**Frequency Channel Assignment on Planar Networks.**[Citation Graph (0, 0)][DBLP] ESA, 2002, pp:736-747 [Conf] - Harold S. Connamacher, Michael Molloy
**The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:590-599 [Conf] - Michael Molloy, Mohammad R. Salavatipour
**The Resolution Complexity of Random Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:330-339 [Conf] - Andreas Goerdt, Michael Molloy
**Analysis of Edge Deletion Processes on Faulty Random Regular Graphs.**[Citation Graph (0, 0)][DBLP] LATIN, 2000, pp:38-47 [Conf] - Lap Chi Lau, Michael Molloy
**Randomly Colouring Graphs with Girth Five and Large Maximum Degree.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:665-676 [Conf] - Michael Molloy, Bruce A. Reed
**Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree.**[Citation Graph (0, 0)][DBLP] LATIN, 1998, pp:216-225 [Conf] - Alan M. Frieze, Michael Molloy
**The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:275-289 [Conf] - Dimitris Achlioptas, Paul Beame, Michael Molloy
**Exponential bounds for DPLL below the satisfiability threshold.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:139-140 [Conf] - Michael Molloy
**The pure literal rule threshold and cores in random hypergraphs.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:672-681 [Conf] - Michael Molloy
**The Glauber dynamics on colourings of a graph with high girth and maximum degree.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:91-98 [Conf] - Michael Molloy
**Models and thresholds for random constraint satisfaction problems.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:209-217 [Conf] - Michael Molloy, Bruce A. Reed
**Colouring graphs when the number of colours is nearly the maximum degree.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:462-470 [Conf] - Michael Molloy, Bruce A. Reed
**Further Algorithmic Aspects of the Local Lemma.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:524-529 [Conf] - Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy
**Finding optimal satisficing strategies for and-or trees.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 2006, v:170, n:1, pp:19-58 [Journal] - Hugh Hind, Michael Molloy, Bruce A. Reed
**Colouring a Graph Frugally.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1997, v:17, n:4, pp:469-482 [Journal] - Michael Molloy, Bruce A. Reed
**A Bound on the Total Chromatic Number.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1998, v:18, n:2, pp:241-280 [Journal] - Dimitris Achlioptas, Michael Molloy
**Almost all graphs with 2.522 n edges are not 3-colorable.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 1999, v:6, n:, pp:- [Journal] - Michael Molloy, Bruce A. Reed
**Critical Subgraphs of a Random Graph.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 1999, v:6, n:, pp:- [Journal] - Colin Cooper, Alan M. Frieze, Michael Molloy
**Hamilton Cycles in Random Regular Digraphs.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1994, v:3, n:, pp:39-49 [Journal] - Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed
**Perfect Matchings in Random r-regular, s-uniform Hypergraphs.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:1-14 [Journal] - Michael Molloy, Bruce A. Reed
**The Size of the Giant Component of a Random Graph with a Given Degree Sequence.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:295-305 [Journal] - Alan M. Frieze, Michael Molloy
**Broadcasting in Random Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:54, n:1, pp:77-79 [Journal] - Michael Molloy, Laura Sedgwick
**Isomorphism certificates for undirected graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:256, n:1-2, pp:349-359 [Journal] - Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
**Generating and Counting Hamilton Cycles in Random Regular Graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:21, n:1, pp:176-198 [Journal] - Alan M. Frieze, Michael Molloy
**Splitting an Expander Graph.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:166-172 [Journal] - Michael Molloy, Mohammad R. Salavatipour
**A bound on the chromatic number of the square of a planar graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:189-213 [Journal] - Martin E. Dyer, Catherine S. Greenhill, Michael Molloy
**Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:20, n:1, pp:98-114 [Journal] - Alan M. Frieze, Michael Molloy
**The satisfiability threshold for randomly generated binary constraint satisfaction problems.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2006, v:28, n:3, pp:323-339 [Journal] - Michael Molloy
**Very rapidly mixing Markov chains for 2-colorings and for independent sets in a graph with maximum degree 4.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2001, v:18, n:2, pp:101-115 [Journal] - Michael Molloy
**Cores in random hypergraphs and Boolean formulas.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2005, v:27, n:1, pp:124-135 [Journal] - Michael Molloy
**A gap between the appearances of a k-core and a (k+1)-chromatic graph.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1996, v:8, n:2, pp:159-160 [Journal] - Michael Molloy, Bruce A. Reed
**Near-optimal list colorings.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2000, v:17, n:3-4, pp:376-402 [Journal] - Michael Molloy, Bruce A. Reed
**The Dominating Number of Random Cubic Graph.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1995, v:7, n:3, pp:209-222 [Journal] - Michael Molloy, Bruce A. Reed
**A Critical Point for Random Graphs with a Given Degree Sequence.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1995, v:6, n:2/3, pp:161-180 [Journal] - Hugh Hind, Michael Molloy, Bruce A. Reed
**Total Coloring With Delta + (log Delta) Colors.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:28, n:3, pp:816-821 [Journal] - Michael Molloy
**Models for Random Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:4, pp:935-949 [Journal] - Michael Molloy
**The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:3, pp:721-737 [Journal] - Martin E. Dyer, Alan M. Frieze, Michael Molloy
**A probabilistic analysis of randomly generated binary constraint satisfaction problems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:290, n:3, pp:1815-1828 [Journal] - Andreas Goerdt, Michael Molloy
**Analysis of edge deletion processes on faulty random regular graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:297, pp:241-260 [Journal] - Michael Molloy, Mohammad R. Salavatipour
**The Resolution Complexity of Random Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:3, pp:895-922 [Journal] **The Glauber Dynamics for Colourings of Bounded Degree Trees.**[Citation Graph (, )][DBLP]**A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems.**[Citation Graph (, )][DBLP]**Asymptotically optimal frugal colouring.**[Citation Graph (, )][DBLP]**The Scaling Window for a Random Graph with a Given Degree Sequence.**[Citation Graph (, )][DBLP]**When does the giant component bring unsatisfiability?**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |