1998 · 188 citations · 12 references
Mathematical ProgrammingTheory Of ComputingComputational ScienceLocal Lemma AuthorsEngineeringInformation RetrievalData ScienceAlgorithmic LibraryAnalysis Of AlgorithmExtremal Set TheoryCitation AnalysisComputer ScienceAlgorithmic DevelopmentReal Algebraic GeometryLocal LemmaComputingmay 1998
Article Free Access Share on Further algorithmic aspects of the local lemma Authors: Michael Molloy Department of Computer Science, University of Toronto, Toronto, Canada Department of Computer Science, University of Toronto, Toronto, CanadaView Profile , Bruce Reed Equipe Combinatoire, CNRS, Université Pierre et Marie Curie Paris, France Equipe Combinatoire, CNRS, Université Pierre et Marie Curie Paris, FranceView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 524–529https://doi.org/10.1145/276698.276866Published:23 May 1998Publication History 114citation569DownloadsMetricsTotal Citations114Total Downloads569Last 12 Months40Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
12
Miklós Ajtai, János Komlós, Endre Szemerédi · 1983 · 665 citations
Péter L. Erdős, J. L. Selfridge · Journal of Combinatorial Theory Series A · 1973 · 299 citations