MathNet Korea

수학계사람들 > 국내수학자




Alan Frieze (Alan Frieze Professor) Carnegie Mellon University



Total: 299
	On Markov chains for randomly H-coloring a graph. (Cooper, Colin; Dyer, Martin) J. Algorithms (2011), Vol 39, Pages 117-134 Ramsey games with giants. (Bohman, Tom;Krivelevich, Michael; Loh, Po-Shen; Sudakov, Benny) Random Structures Algorithms (2011), Vol 38, Pages 1–32 Loose Hamilton cycles in random uniform hypergraphs. (Dudek, Andrzej) Electron. J. Combin. (2011), Vol 18, Pages 14 The cover time of random geometric graphs. (Cooper, Colin) Random Structures Algorithms (2011), Vol 38, Pages 324-349 An analysis of random-walk cuckoo hashing. (Melsted, Páll; Mitzenmacher, Michael) SIAM J. Comput. (2011), Vol 40, Pages 291-308 Randomly coloring simple hypergraphs. (Melsted, Páll) Inform. Process. Lett. (2011), Vol 111, Pages 848-853 Karp-Sipser on random graphs with a fixed degree sequence. (Bohman, Tom) Combin. Probab. Comput. (2011), Vol 20, Pages 721-741 Packing tight Hamilton cycles in 3-uniform hypergraphs. (Krivelevich, Michael; Loh, Po-Shen) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011), Pages 913–932 Component structure of the vacant set induced by a random walk on a random graph. (Cooper, Colin) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011), Pages 1211–1221 Coloring H-free hypergraphs. (Bohman, Tom;Mubayi, Dhruv) Random Structures Algorithms (2010), Vol 36, Pages 11-25 Anti-Ramsey properties of random graphs. (Bohman, Tom;Pikhurko, Oleg; Smyth, Cliff) J. Combin. Theory Ser. B (2010), Vol 100, Pages 299–312 Randomly coloring random graphs. (Dyer, Martin) Random Structures Algorithms (2010), Vol 36, Pages 251-272 Loose Hamilton cycles in random 3-uniform hypergraphs. Electron. J. Combin. (2010), Vol 17, Pages 4 Finding a maximum matching in a sparse random graph in O(n) expected time. (Chebolu, Prasad; Melsted, Páll) J. ACM (2010), Vol 57, Pages 27 Logconcave random graphs. (Vempala, Santosh; Vera, Juan) Electron. J. Combin. (2010), Vol 17, Pages 31 Hamilton cycles in random graphs with a fixed degree sequence. (Cooper, Colin;Krivelevich, Michael) SIAM J. Discrete Math. (2010), Vol 24, Pages 558-569 Flips in graphs. (Bohman, Tom; Dudek, Andrzej;Pikhurko, Oleg) SIAM J. Discrete Math. (2010), Vol 24, Pages 1046-1055 Hypergraphs with independent neighborhoods. (Bohman, Tom; Mubayi, Dhruv; Pikhurko, Oleg) Combinatorica (2010), Vol 30, Pages 277–293 Random walks with look-ahead in scale-free random graphs. (Cooper, Colin) SIAM J. Discrete Math. (2010), Vol 24, Pages 1162-1176 A note on the random greedy triangle-packing algorithm. (Bohman, Tom;Lubetzky, Eyal) J. Comb. (2010), Vol 1, Pages 477-488 Cover time of a random graph with given degree sequence. (Abdullah, Mohammed; Cooper, Colin) Discrete Math. Theor. Comput. Sci. Proc. (2010), Pages 1–19 Multiple random walks in random regular graphs. (Cooper, Colin;Radzik, Tomasz) SIAM J. Discrete Math. (2009/10), Vol 23, Pages 1738–1761 An efficient sparse regularity concept. (Coja-Oghlan, Amin; Cooper, Colin) SIAM J. Discrete Math. (2009/10), Vol 23, Pages 2000–2034 Separating populations with wide data: a spectral analysis. (Blum, Avrim; Coja-Oghlan, Amin;Zhou, Shuheng) Electron. J. Stat. (2009), Vol 3, Pages 76–113 Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms (Cooper, Colin) Random Structures Algorithms (2009), Vol 34, Pages 300-304 Line-of-sight networks. (Kleinberg, Jon; Ravi, R.; Debany, Warren) Combin. Probab. Comput. (2009), Vol 18, Pages 145-163 Memoryless rules for Achlioptas processes. (Beveridge, Andrew; Bohman, Tom;Pikhurko, Oleg) SIAM J. Discrete Math. (2009), Vol 23, Pages 993–1008 Hamilton cycles in 3-out. (Bohman, Tom) Random Structures Algorithms (2009), Vol 35, Pages 393-417 Multiple random walks and interacting particle systems. (Cooper, Colin;Radzik, Tomasz) Lecture Notes in Comput. Sci. (2009), Pages 399-410 Average-class analyses of Vickrey costs. (Chebolu, Prasad;Melsted, Páll; Sorkin, Gregory B.) Lecture Notes in Comput. Sci. (2009), Pages 434-447 An analysis of random-walk Cuckoo hashing. (Melsted, Páll; Mitzenmacher, Michael) Lecture Notes in Comput. Sci. (2009), Pages 490–503 The cover time of random geometric graphs. (Cooper, Colin) Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (2009), Pages 48–57 On smoothed k-CNF formulas and the Walksat algorithm. (Coja-Oghlan, Amin; Feige, Uriel;Krivelevich, Michael; Vilenchik, Dan) Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (2009), Pages 451-460 An efficient sparse regularity concept. (Coja-Oghlan, Amin; Cooper, Colin) Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (2009), Pages 207–216 The game chromatic number of random graphs. (Bohman, Tom; Sudakov, Benny) Random Structures Algorithms (2008), Vol 32, Pages 223–235 Random k-SAT: the limiting probability for satisfiability for moderately growing k. (Coja-Oghlan, Amin) Electron. J. Combin. (2008), Vol 15, Pages 6 On rainbow trees and cycles. (Krivelevich, Michael) Electron. J. Combin. (2008), Vol 15, Pages 9 Hamilton cycles in random lifts of directed graphs. (Chebolu, Prasad) SIAM J. Discrete Math. (2008), Vol 22, Pages 520-540 The cover time of the giant component of a random graph. (Cooper, Colin) Random Structures Algorithms (2008), Vol 32, Pages 401–439 On two Hamilton cycle problems in random graphs. (Krivelevich, Michael) Israel J. Math. (2008), Vol 166, Pages 221-234 On the chromatic number of simple triangle-free triple systems. (Mubayi, Dhruv) Electron. J. Combin. (2008), Vol 15, Pages 27 Game chromatic index of graphs with given restrictions on degrees. (Beveridge, Andrew; Bohman, Tom;Pikhurko, Oleg) Theoret. Comput. Sci. (2008), Vol 407, Pages 242-249 Finding a maximum matching in a sparse random graph in O(n) expected time. (Chebolu, Prasad;Melsted, P) Lecture Notes in Comput. Sci. (2008), Pages 161-172 Logconcave random graphs. (Vempala, Santosh; Vera, Juan) ACM (2008), Pages 779–788 The cover time of sparse random graphs. (Cooper, Colin) Random Structures Algorithms (2007), Vol 30, Pages 1-16 Randomly generated intersecting hypergraphs. II. (Bohman, Tom;Martin, Ryan; Ruszinkó, Miklós; Smyth, Cliff) Random Structures Algorithms (2007), Vol 30, Pages 17-34 The cover time of the preferential attachment graph. (Cooper, Colin) J. Combin. Theory Ser. B (2007), Vol 97, Pages 269-290 Codes identifying sets of vertices in random networks. (Martin, Ryan; Moncel, Julien; Ruszinkó, Miklós; Smyth, Cliff) Discrete Math. (2007), Vol 307, Pages 1094-1107 Adversarial deletion in a scale-free random graph process. (Flaxman, Abraham D.; Vera, Juan) Combin. Probab. Comput. (2007), Vol 16, Pages 261-270 First-order definability of trees and sparse random graphs. (Bohman, Tom;Łuczak, Tomasz; Pikhurko, Oleg; Smyth, Clifford; Spencer, Joel; Verbitsky, Oleg) Combin. Probab. Comput. (2007), Vol 16, Pages 375-400 A survey on the use of Markov chains to randomly sample colourings. (Vigoda, Eric) Oxford Lecture Ser. Math. Appl. (2007), Pages 53-71 The diameter of randomly perturbed digraphs and some applications. (Flaxman, Abraham D.) Random Structures Algorithms (2007), Vol 30, Pages 484–504 Random 2-SAT with prescribed literal degrees. (Cooper, Colin; Sorkin, Gregory B.) Algorithmica (2007), Vol 48, Pages 249-265 Product rule wins a competitive game. (Beveridge, Andrew; Bohman, Tom;Pikhurko, Oleg) Proc. Amer. Math. Soc. (2007), Vol 135, Pages 3061–3071 On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. (Flaxman, Abraham D.; Vera, Juan Carlos) Combin. Probab. Comput. (2007), Vol 16, Pages 713-732 On the chromatic number of random graphs with a fixed degree sequence. (Krivelevich, Michael; Smyth, Cliff) Combin. Probab. Comput. (2007), Vol 16, Pages 733-746 A geometric preferential attachment model of networks. II. (Flaxman, Abraham D.;Vera, Juan) Internet Math. (2007), Vol 4, Pages 87–111 Line-of-sight networks. (Kleinberg, Jon; Ravi, R.; Debany, Warren) Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2007), Pages 968–977 Separating populations with wide data: a spectral analysis. (Blum, Avrim; Coja-Oghlan, Amin;Zhou, Shuheng) Lecture Notes in Comput. Sci. (2007), Pages 439-451 A geometric preferential attachment model of networks. II. (Flaxman, Abraham D.;Vera, Juan) Lecture Notes in Comput. Sci. (2007), Pages 41-55 The probabilistic relationship between the assignment and asymmetric traveling salesman problems. (Sorkin, Gregory B.) SIAM J. Comput. (2006/07), Vol 36, Pages 1436-1452 On the random 2-stage minimum spanning tree. (Flaxman, Abraham D.;Krivelevich, Michael) Random Structures Algorithms (2006), Vol 28, Pages 24-36 The satisfiability threshold for randomly generated binary constraint satisfaction problems. (Molloy, Michael) Random Structures Algorithms (2006), Vol 28, Pages 323-339 Almost universal graphs. (Krivelevich, Michael) Random Structures Algorithms (2006), Vol 28, Pages 499-510 On randomly colouring locally sparse graphs. (Vera, Juan) Discrete Math. Theor. Comput. Sci. (2006), Vol 8, Pages 121-127 Hamilton cycles in random lifts of graphs. (Burgin, K.; Chebolu, P.; Cooper, C.) European J. Combin. (2006), Vol 27, Pages 1282-1293 Randomly coloring sparse random graphs with fewer colors than the maximum degree. (Dyer, Martin; Flaxman, Abraham D.;Vigoda, Eric) Random Structures Algorithms (2006), Vol 29, Pages 450-465 A geometric preferential attachment model of networks. (Flaxman, Abraham D.;Vera, Juan) Internet Math. (2006), Vol 3, Pages 187–205 The influence of search engines on preferential attachment. (Vera, Juan; Chakrabarti, Soumen) Internet Math. (2006), Vol 3, Pages 361–381 Perfect matchings in random bipartite graphs with minimal degree at least 2. Random Structures Algorithms (2005), Vol 26, Pages 319-358 On packing Hamilton cycles in ε-regular graphs. (Krivelevich, Michael) J. Combin. Theory Ser. B (2005), Vol 94, Pages 159-172 Random k-SAT: a tight threshold for moderately growing k. (Wormald, Nicholas C.) Combinatorica (2005), Vol 25, Pages 297-305 The cover time of random regular graphs. (Cooper, Colin) SIAM J. Discrete Math. (2005), Vol 18, Pages 728-740 High degree vertices and eigenvalues in the preferential attachment graph. (Flaxman, Abraham;Fenner, Trevor) Internet Math. (2005), Vol 2, Pages 1-19 The game of JumbleG. (Krivelevich, Michael; Pikhurko, Oleg; Szabó, Tibor) Combin. Probab. Comput. (2005), Vol 14, Pages 783-793 On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. (Flaxman, Abraham D.;Vera, Juan C.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing (2005), Pages 441-449 The strong chromatic index of random graphs. (Krivelevich, Michael; Sudakov, Benny) SIAM J. Discrete Math. (2005), Vol 19, Pages 719–727 Adversarial deletion in a scale free random graph process. (Flaxman, Abraham D.;Vera, Juan) Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2005), Pages 287-292 The influence of search engines on preferential attachment. (Chakrabarti, Soumen;Vera, Juan) Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2005), Pages 293-300 On the random 2-stage minimum spanning tree. (Flaxman, Abraham D.;Krivelevich, Michael) Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2005), Pages 919-926 The cover time of two classes of random graphs. (Cooper, Colin) Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2005), Pages 961–970 The emergence of a giant component in random subgraphs of pseudo-random graphs. (Krivelevich, Michael; Martin, Ryan) Random Structures Algorithms (2004), Vol 24, Pages 42-50 Adding random edges to dense graphs. (Bohman, Tom;Krivelevich, Michael; Martin, Ryan) Random Structures Algorithms (2004), Vol 24, Pages 105-117 On the -independence number of sparse random graphs. (Atkinson, Geoffrey) Combin. Probab. Comput. (2004), Vol 13, Pages 295-309 The size of the largest strongly connected component of a random digraph with a given degree sequence. (Cooper, Colin) Combin. Probab. Comput. (2004), Vol 13, Pages 319-337 Efficient communication in an ad-hoc network. (Flaxman, Abraham; Upfal, Eli) J. Algorithms (2004), Vol 52, Pages 1-7 Perfect matchings in random graphs with prescribed minimal degree. (Pittel, Boris) Trends Math. (2004), Pages 95–132 Avoidance of a giant component in half the edge set of a random graph. (Bohman, Tom;Wormald, Nicholas C.) Random Structures Algorithms (2004), Vol 25, Pages 432-449 On random symmetric travelling salesman problems. Math. Oper. Res. (2004), Vol 29, Pages 878-890 Random deletion in a scale-free random graph process. (Cooper, Colin;Vera, Juan) Internet Math. (2004), Vol 1, Pages 463-483 Fast Monte-Carlo algorithms for finding low-rank approximations. (Kannan, Ravi; Vempala, Santosh) J. ACM (2004), Vol 51, Pages 1025-1041 A probabilistic analysis of randomly generated binary constraint satisfaction problems. (Dyer, Martin;Molloy, Michael) Theoret. Comput. Sci. (2003), Vol 290, Pages 1815-1828 How many random edges make a dense graph Hamiltonian? (Bohman, Tom;Martin, Ryan) Random Structures Algorithms (2003), Vol 22, Pages 33-42 A general model of web graphs. (Cooper, Colin) Random Structures Algorithms (2003), Vol 22, Pages 311-335 Arc-disjoint paths in expander digraphs. (Bohman, Tom) SIAM J. Comput. (2003), Vol 32, Pages 326-344 The cover time of sparse random graphs. (Cooper, Colin) Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2003), Pages 140-147 Perfect matchings in random graphs with prescribed minimal degree (Pittel, Boris) Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2003), Pages 148-157 Randomly coloring graphs with lower bounds on girth and maximum degree. (Dyer, Martin) Random Structures Algorithms (2003), Vol 23, Pages 167-179 On randomly generated intersecting hypergraphs. (Bohman, Tom; Cooper, Colin;Martin, Ryan; Ruszinkó, Miklós) Electron. J. Combin. (2003), Vol 10, Pages 10 Crawling on simple models of web graphs. (Cooper, Colin) Internet Math. (2003), Vol 1, Pages 57-90 High degree vertices and eigenvalues in the preferential attachment graph. (Flaxman, Abraham;Fenner, Trevor) Lecture Notes in Comput. Sci. (2003), Pages 264-274 The satisfiability threshold for randomly generated binary constraint satisfaction problems. (Molloy, Michael) Lecture Notes in Comput. Sci. (2003), Pages 275-289 Multi-coloured Hamilton cycles in random edge-coloured graphs. (Cooper, Colin) Combin. Probab. Comput. (2002), Vol 11, Pages 129-133 A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. (Arora, Sanjeev;Kaplan, Haim) Math. Program. (2002), Vol 92, Pages 1-36 Random regular graphs of non-constant degree: connectivity and Hamiltonicity. (Cooper, Colin;Reed, Bruce) Combin. Probab. Comput. (2002), Vol 11, Pages 249-261 Random regular graphs of non-constant degree: independence and chromatic number. (Cooper, Colin;Reed, Bruce; Riordan, Oliver) Combin. Probab. Comput. (2002), Vol 11, Pages 323-341 On graph irregularity strength. (Gould, Ronald J.; Karoński, Michał; Pfender, Florian) J. Graph Theory (2002), Vol 41, Pages 120-137 Hamilton cycles in random subgraphs of pseudo-random graphs. (Krivelevich, Michael) Discrete Math. (2002), Vol 256, Pages 137-150 On counting independent sets in sparse graphs. (Dyer, Martin;Jerrum, Mark) SIAM J. Comput. (2002), Vol 31, Pages 1527-1541 Probabilistic analysis of the TSP. (Yukich, J. E.) Comb. Optim. (2002), Pages 257-307 Crawling on web graphs. (Cooper, Colin) Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing (2002), Pages 419–427 Addendum to "Avoiding a giant component'' (Bohman, Tom) Random Structures Algorithms (2002), Vol 20, Pages 126-130 Corrigendum: "Edge-disjoint paths in expander graphs'' SIAM J. Comput. (2001/02), Vol 31, Pages 988 Hamilton cycles in the union of random permutations. Random Structures Algorithms (2001), Vol 18, Pages 83-94 Vertex covers by edge disjoint cliques. (Bohman, Tom;Ruszinkó, Miklós; Thoma, Lubos) Combinatorica (2001), Vol 21, Pages 171-197 Avoiding a giant component. (Bohman, Tom) Random Structures Algorithms (2001), Vol 19, Pages 75-85 Edge-disjoint paths in expander graphs. SIAM J. Comput. (2001), Vol 30, Pages 1790-1801 G-intersecting families. (Bohman, Tom;Ruszinkó, Miklós; Thoma, Luboš) Combin. Probab. Comput. (2001), Vol 10, Pages 349-384 A general approach to dynamic packet routing with bounded buffers. (Broder, Andrei Z.;Upfal, Eli) J. ACM (2001), Vol 48, Pages 324-349 A general model of undirected web graphs. (Cooper, Colin) Lecture Notes in Comput. Sci. (2001), Pages 500-511 Arc-disjoint paths in expander digraphs. (Bohman, Tom) IEEE Computer Soc. (2001), Pages 558-567 Randomly colouring graphs with lower bounds on girth and maximum degree. (Dyer, Martin) IEEE Computer Soc. (2001), Pages 579-587 The probabilistic relationship between the assignment and asymmetric traveling salesman problems. (Sorkin, Gregory B.) Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (2001), Pages 652-660 Average-case complexity of shortest-paths problems in the vertex-potential model. (Cooper, Colin;Mehlhorn, Kurt; Priebe, Volker) Random Structures Algorithms (2000), Vol 16, Pages 33-46 Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least $k$. (Bollobás, B.; Cooper, C.; Fenner, T. I.) J. Graph Theory (2000), Vol 34, Pages 42-59 Min-wise independent linear permutations. (Bohman, Tom; Cooper, Colin) Electron. J. Combin. (2000), Vol 7, Pages 6 A note on sparse random graphs and cover graphs. (Bohman, Tom;Ruszinkó, Miklós; Thoma, Lubos) Electron. J. Combin. (2000), Vol 7, Pages 9 Edge-disjoint paths in expander graphs. Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (2000), Pages 717-725 Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids. (Cooper, Colin; Dyer, Martin E.;Rue, Rachel) J. Math. Phys. (2000), Vol 41, Pages 1499-1527 Hamilton cycles in random graphs and directed graphs. (Cooper, Colin) Random Structures Algorithms (2000), Vol 16, Pages 369-401 Optimal construction of edge-disjoint paths in random regular graphs. (Zhao, Lei) Combin. Probab. Comput. (2000), Vol 9, Pages 241-263 A note on random minimum length spanning trees. (Ruszinkó, Miklós; Thoma, Lubos) Electron. J. Combin. (2000), Vol 7, Pages 5 Min-wise independent permutations (Broder, Andrei Z.; Charikar, Moses;Mitzenmacher, Michael) J. Comput. System Sci. (2000), Vol 60, Pages 630-659 On the number of perfect matchings and Hamilton cycles in ε-regular non-bipartite graphs. Electron. J. Combin. (2000), Vol 7, Pages 11 Optimal construction of edge-disjoint paths in random graphs. (Broder, Andrei Z.;Suen, Stephen; Upfal, Eli) SIAM J. Comput. (1999), Vol 28, Pages 541-573 Static and dynamic path selection on expander graphs: a random walk approach. (Broder, Andrei Z.;Upfal, Eli) Random Structures Algorithms (1999), Vol 14, Pages 87-109 A simple algorithm for constructing Szemerédi's regularity partition. (Kannan, Ravi) Electron. J. Combin. (1999), Vol 6, Pages 7 Log-Sobolev inequalities and sampling from log-concave distributions. (Kannan, Ravi) Ann. Appl. Probab. (1999), Vol 9, Pages 14-26 On perfect matchings and Hamilton cycles in sums of random trees. (Karoński, Michał; Thoma, Luboš) SIAM J. Discrete Math. (1999), Vol 12, Pages 208-216 Splitting an expander graph. (Molloy, Michael) J. Algorithms (1999), Vol 33, Pages 166-172 Mixing properties of the Swendsen-Wang process on classes of graphs. (Cooper, Colin) Random Structures Algorithms (1999), Vol 15, Pages 242–261 Quick approximation to matrices and applications. (Kannan, Ravi) Combinatorica (1999), Vol 19, Pages 175-220 Clustering in large graphs and matrices. (Drineas, P.;Kannan, Ravi; Vempala, Santosh; Vinay, V.) Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (1999), Pages 291-299 Optimal construction of edge-disjoint paths in random regular graphs. (Zhao, Lei) Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (1999), Pages 346-355 On counting independent sets in sparse graphs. (Dyer, Martin;Jerrum, Mark) IEEE Computer Soc. (1999), Pages 210-217 Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics. (Borgs, Christian; Chayes, Jennifer T.;Kim, Jeong Han; Tetali, Prasad; Vigoda, Eric; Vu, Van Ha) IEEE Computer Soc. (1999), Pages 218-229 Greedy algorithms for the shortest common superstring that are asymptotically optimal. (Szpankowski, W.) Algorithmica (1998), Vol 21, Pages 21-36 Approximately counting Hamilton paths and cycles in dense graphs. (Dyer, Martin;Jerrum, Mark) SIAM J. Comput. (1998), Vol 27, Pages 1262-1272 Maximum matchings in sparse random graphs: Karp-Sipser revisited. (Aronson, Jonathan;Pittel, Boris G.) Random Structures Algorithms (1998), Vol 12, Pages 111-177 A polynomial-time algorithm for learning noisy linear threshold functions. (Blum, A.;Kannan, R.; Vempala, S.) Algorithmica (1998), Vol 22, Pages 35–52 Dynamic packet routing on arrays with bounded buffers. (Broder, Andrei Z.;Upfal, Eli) Lecture Notes in Comput. Sci. (1998), Pages 273–281 Probabilistic analysis of algorithms. (Reed, Bruce) Algorithms Combin. (1998), Pages 36-92 Average-case analysis of the merging algorithm of Hwang and Lin. (Fernandez de la Vega, W.; Santha, M.) Algorithmica (1998), Vol 22, Pages 483-489 Random minimum length spanning trees in regular graphs. (Beveridge, Andrew;McDiarmid, Colin) Combinatorica (1998), Vol 18, Pages 311–333 Disjoint paths in expander graphs via random walks: a short survey. Lecture Notes in Comput. Sci. (1998), Pages 1-14 On balls and bins with deletions. (Cole, Richard;Maggs, Bruce M.; Mitzenmacher, Michael; Richa, Andréa W.; Sitaraman, Ramesh; Upfal, Eli) Lecture Notes in Comput. Sci. (1998), Pages 145–158 Improved approximation algorithms for MAX $k$-CUT and MAX BISECTION. (Jerrum, M.) Algorithmica (1997), Vol 18, Pages 67-81 Hamilton cycles in random regular digraphs (Cooper, Colin;Molloy, Michael) Cambridge Univ. (1997), Pages 153-163 Average-case complexity of shortest-paths problems in the vertex-potential model. (Cooper, Colin;Mehlhorn, Kurt; Priebe, Volker) Lecture Notes in Comput. Sci. (1997), Pages 15-26 Algorithmic theory of random graphs. (McDiarmid, Colin) Random Structures Algorithms (1997), Vol 10, Pages 5-42 On the best case of Heapsort. (Bollobás, B.; Fenner, T. I.) J. Algorithms (1996), Vol 20, Pages 205-217 Analysis of two simple heuristics on a random instance of $k$. (Suen, Stephen) J. Algorithms (1996), Vol 20, Pages 312-355 An efficient algorithm for the vertex-disjoint paths problem in random graphs. (Broder, Andrei Z.;Suen, Stephen; Upfal, Eli) Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (1996), Pages 261-268 Perfect matchings in random $r$-regular, $s$-uniform hypergraphs. (Cooper, Colin;Molloy, Michael; Reed, Bruce) Combin. Probab. Comput. (1996), Vol 5, Pages 1-14 Generating and counting Hamilton cycles in random regular graphs. (Jerrum, Mark; Molloy, Michael; Robinson, Robert; Wormald, Nicholas) J. Algorithms (1996), Vol 21, Pages 176-198 Coloring bipartite hypergraphs. (Chen, Hui) Lecture Notes in Comput. Sci. (1996), Pages 345-358 The regularity lemma and approximation schemes for dense problems. (Kannan, Ravi) IEEE Comput. Soc. (1996), Pages 12-20 A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. (Arora, Sanjeev;Kaplan, Haim) IEEE Comput. Soc. (1996), Pages 21-30 A polynomial-time algorithm for learning noisy linear threshold functions. (Blum, Avrim;Kannan, Ravi; Vempala, Santosh) IEEE Comput. Soc. (1996), Pages 330-338 Learning linear transformations. (Jerrum, Mark; Kannan, Ravi) IEEE Comput. Soc. (1996), Pages 359-368 A general approach to dynamic packet routing with bounded buffers (Broder, Andrei Z.;Upfal, Eli) IEEE Comput. Soc. (1996), Pages 390–399 Greedy algorithms for the shortest common superstring that are asymptotically optimal. (Szpankowski, Wojciech) Lecture Notes in Comput. Sci. (1996), Pages 194–207 Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph. (Chen, H.) Random Structures Algorithms (1996), Vol 9, Pages 359-377 An analysis of a Monte Carlo algorithm for estimating the permanent. (Jerrum, Mark) Combinatorica (1995), Vol 15, Pages 67-83 Multicoloured Hamilton cycles. (Albert, Michael;Reed, Bruce) Electron. J. Combin. (1995), Vol 2, Pages 13 When is the assignment bound tight for the asymmetric traveling-salesman problem? (Karp, Richard M.; Reed, Bruce) SIAM J. Comput. (1995), Vol 24, Pages 484-493 Analysis of a simple greedy matching algorithm on random cubic graphs. (Radcliffe, A. J.; Suen, Stephen) Combin. Probab. Comput. (1995), Vol 4, Pages 47-66 Perfect matchings in random $s$-uniform hypergraphs. (Janson, Svante) Random Structures Algorithms (1995), Vol 7, Pages 41-57 Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. (Cooper, Colin) Electron. J. Combin. (1995), Vol 2, Pages 20 Balanced allocations for tree-like inputs. (Radcliffe, A. J.; Suen, Stephen) Inform. Process. Lett. (1995), Vol 55, Pages 329-332 The worst-case running time of the random simplex algorithm is exponential in the height. ( Broder, Andrei Z.; Dyer, Martin E.;Raghavan, Prabhakar; Upfal, Eli) Inform. Process. Lett. (1995), Vol 56, Pages 79-81 Probabilistic analysis of an algorithm in the theory of markets in indivisible goods. (Pittel, Boris G.) Ann. Appl. Probab. (1995), Vol 5, Pages 768-808 Covering the edges of a random graph by cliques. (Reed, Bruce) Combinatorica (1995), Vol 15, Pages 489-497 Improved approximation algorithms for MAX $k$-CUT and MAX BISECTION (Jerrum, Mark) Lecture Notes in Comput. Sci. (1995), Pages 1-13 Randomized greedy matching. II. (Aronson, Jonathan; Dyer, Martin;Suen, Stephen) Random Structures Algorithms (1995), Vol 6, Pages 55-73 Polynomial time randomized approximation schemes for Tutte-Gröthendieck invariants: the dense case. (Alon, Noga;Welsh, Dominic) Random Structures Algorithms (1995), Vol 6, Pages 459-478 On the connectivity of random $k$th nearest neighbour graphs. (Cooper, Colin) Combin. Probab. Comput. (1995), Vol 4, Pages 343-362 Comments on: "Multicoloured Hamilton cycles'' (Albert, Michael;Reed, Bruce) Electron. J. Combin. (1995), Vol 2, Multicolored trees in random graphs. (McKay, Brendan D.) Random Structures Algorithms (1994), Vol 5, Pages 45-56 Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. (Dyer, Martin) Math. Programming (1994), Vol 64, Pages 1-16 Finding hidden Hamiltonian cycles. (Broder, Andrei Z.;Shamir, Eli) Random Structures Algorithms (1994), Vol 5, Pages 395-410 On the problem of approximating the number of bases of a matroid. (Azar, Y.; Broder, A. Z.) Inform. Process. Lett. (1994), Vol 50, Pages 9-11 Sampling from log-concave distributions. (Kannan, Ravi; Polson, Nick) Ann. Appl. Probab. (1994), Vol 4, Pages 812-837 On the greedy heuristic for matchings. (Aronson, Jonathan; Dyer, Martin;Suen, Stephen) Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (1994), Pages 141-149 Approximately counting Hamilton cycles in dense graphs. (Dyer, Martin;Jerrum, Mark) Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (1994), Pages 336-343 Optimal construction of edge-disjoint paths in random graphs. (Broder, Andrei A.;Suen, Stephen; Upfal, Eli) Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (1994), Pages 603-612 Hamilton cycles in random regular digraphs. (Cooper, Colin; Molloy, Michael) Combin. Probab. Comput. (1994), Vol 3, Pages 39-49 Hamilton cycles in a class of random directed graphs. (Cooper, Colin) J. Combin. Theory Ser. B (1994), Vol 62, Pages 151-163 Near-perfect token distribution. (Broder, A. Z.;Shamir, E.; Upfal, E.) Random Structures Algorithms (1994), Vol 5, Pages 559-572 Existence and construction of edge-disjoint paths on expander graphs. (Broder, Andrei Z.; Upfal, Eli) SIAM J. Comput. (1994), Vol 23, Pages 976-989 Broadcasting in random graphs. (Molloy, Michael) Discrete Appl. Math. (1994), Vol 54, Pages 77-79 On the complexity of computing the diameter of a polytope. (Teng, Shang-Hua) Comput. Complexity (1994), Vol 4, Pages 207-219 On the independence number of random cubic graphs. (Suen, Stephen) Random Structures Algorithms (1994), Vol 5, Pages 649-664 Correction: "Sampling from log-concave distributions''. (Kannan, Ravi; Polson, Nick) Ann. Appl. Probab. (1994), Vol 4, Pages 1255 Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs. (Alon, Noga;Welsh, Dominic) IEEE Comput. Soc. (1994), Pages 24-35 On the satisfiability and maximum satisfiability of random $3$-CNF formulas. (Broder, Andrei Z.;Upfal, Eli) Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993), Pages 322-330 Analysis of a simple greedy matching algorithm on random cubic graphs. (Radcliffe, A. J.; Suen, Stephen) Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993), Pages 341-351 The average performance of the greedy matching algorithm. (Dyer, Martin;Pittel, Boris) Ann. Appl. Probab. (1993), Vol 3, Pages 526-552 Polychromatic Hamilton cycles. (Reed, Bruce) Discrete Math. (1993), Vol 118, Pages 69-74 A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem. (Dyer, Martin;Kannan, Ravi; Kapoor, Ajai; Perkovic, Ljubomir; Vazirani, Umesh) Combin. Probab. Comput. (1993), Vol 2, Pages 271-284 On the independence and chromatic numbers of random regular graphs. (Łuczak, T.) J. Combin. Theory Ser. B (1992), Vol 54, Pages 123-132 On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph. (Calkin, Neil J.;Kučera, L.) Random Structures Algorithms (1992), Vol 3, Pages 215-221 Counting the number of Hamilton cycles in random digraphs. (Suen, Stephen) Random Structures Algorithms (1992), Vol 3, Pages 235-241 On small subgraphs of random graphs. Wiley-Intersci. Publ. (1992), Pages 67-90 Probabilistic analysis of the generalised assignment problem. (Dyer, Martin) Math. Programming (1992), Vol 55, Pages 169-181 On a conjecture of Bondy and Fan. (McDiarmid, Colin; Reed, Bruce) Ars Combin. (1992), Vol 33, Pages 329-336 On subgraph sizes in random graphs. (Calkin, Neil;McKay, Brendan D.) Combin. Probab. Comput. (1992), Vol 1, Pages 123-134 Near-perfect token distribution. (Broder, Andrei Z.;Shamir, E.; Upfal, E.) Lecture Notes in Comput. Sci. (1992), Pages 308-317 Occupancy problems and random algebras. (Albert, Michael H.) Discrete Math. (1991), Vol 87, Pages 1-8 A random polynomial-time algorithm for approximating the volume of convex bodies. (Dyer, Martin;Kannan, Ravi) J. Assoc. Comput. Mach. (1991), Vol 38, Pages 1-17 Randomized greedy matching. (Dyer, Martin) Random Structures Algorithms (1991), Vol 2, Pages 29-45 Spanning maximal planar subgraphs of random graphs. (Bollobás, B.) Random Structures Algorithms (1991), Vol 2, Pages 225-231 Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph. (Dyer, Martin) Random Structures Algorithms (1991), Vol 2, Pages 233-239 On the length of the longest monotone subsequence in a random permutation. Ann. Appl. Probab. (1991), Vol 1, Pages 301-305 Computing the volume of convex bodies: a case where randomness provably helps. (Dyer, Martin) Proc. Sympos. Appl. Math. (1991), Pages 123-169 On an optimization problem with nested constraints. (Dyer, M. E.) Discrete Appl. Math. (1990), Vol 26, Pages 159-173 The limiting probability that $alpha$-in, $beta$-out is strongly connected. (Cooper, C..) J. Combin. Theory Ser. B (1990), Vol 48, Pages 117-134 Greedy matching on the line. (McDiarmid, Colin; Reeds, Bruce) SIAM J. Comput. (1990), Vol 19, Pages 666–672 On patching algorithms for random asymmetric travelling salesman problems. (Dyer, M. E.) Math. Programming (1990), Vol 46, Pages 361-378 On the independence number of random graphs. Discrete Math. (1990), Vol 81, Pages 171-175 Probabilistic analysis of graph algorithms. Comput. Suppl. (1990), Pages 209-233 Edge disjoint spanning trees in random graphs. (Łuczak, T.) Period. Math. Hungar. (1990), Vol 21, Pages 35-37 Probabilistic analysis of a parallel algorithm for finding maximal independent sets. (Calkin, Neil) Random Structures Algorithms (1990), Vol 1, Pages 39-50 Pancyclic random graphs. (Cooper, Colin) Random graphs (1990), Pages 29-39 Parallel colouring of random graphs. (Kučera, Luděk) Random graphs (1990), Pages 41-52 Hamiltonian cycles in a class of random graphs: one step further. (Łuczak, Tomasz) Random graphs (1990), Pages 53-59 Hamilton cycles in random graphs of minimal degree at least $k$. (Bollobás, B.; Fenner, T. I.) Cambridge Univ (1990), Pages 59-95 Probabilistic analysis of the multidimensional knapsack problem. (Dyer, M. E.) Math. Oper. Res. (1989), Vol 14, Pages 162-176 A new integer programming formulation for the permutation flowshop problem. (Yadegar, J.) European J. Oper. Res. (1989), Vol 40, Pages 90-98 A randomized algorithm for fixed-dimensional linear programming. (Dyer, M. E.) Math. Programming (1989), Vol 44, Pages 203-212 Algorithms for assignment problems on an array processor. (Yadegar, J.; El-Horbaty, S.; Parkinson, D.) Parallel Comput. (1989), Vol 11, Pages 151-162 Random graph orders. (Albert, Michael H.) Order (1989), Vol 6, Pages 19-30 The solution of some random NP-hard problems in polynomial expected time. (Dyer, M. E.) J. Algorithms (1989), Vol 10, Pages 451-489 On the number of Hamilton cycles in a random graph. (Cooper, C.) J. Graph Theory (1989), Vol 13, Pages 719-735 Survival time of a random graph. Combinatorica (1989), Vol 9, Pages 133-143 On matchings and Hamilton cycles in random graphs. London Math. Soc. Lecture Note Ser. (1989), Pages 84-114 On random minimum length spanning trees. (McDiarmid, C. J. H.) Combinatorica (1989), Vol 9, Pages 363-374 On the random construction of heaps. Inform. Process. Lett. (1988), Vol 27, Pages 103-109 Finding Hamilton cycles in sparse random graphs. J. Combin. Theory Ser. B (1988), Vol 44, Pages 230-250 Probabilistic analysis of a relaxation for the $k$-median problem. (Ahn, Sang; Cooper, Colin; Cornuéjols, Gérard) Math. Oper. Res. (1988), Vol 13, Pages 1-31 Reconstructing truncated integer variables satisfying linear congruences. Special issue on cryptography. (Håstad, Johan; Kannan, Ravi; Lagarias, Jeffrey C.; Shamir, Adi) SIAM J. Comput. (1988), Vol 17, Pages 262-280 An algorithm for finding Hamilton cycles in random directed graphs. J. Algorithms (1988), Vol 9, Pages 181-204 Partitioning random graphs into large cycles. Discrete Math. (1988), Vol 70, Pages 149-158 On the complexity of computing the volume of a polyhedron. (Dyer, M. E.) SIAM J. Comput. (1988), Vol 17, Pages 967-974 Edge-colouring random graphs. (Jackson, B.; McDiarmid, C. J. H.; Reed, B.) J. Combin. Theory Ser. B (1988), Vol 45, Pages 135-149 Large induced trees in sparse random graphs. (Jackson, B.) J. Combin. Theory Ser. B (1987), Vol 42, Pages 181-195 Parallel algorithms for finding Hamilton cycles in random graphs. Inform. Process. Lett. (1987), Vol 25, Pages 111-117 On the exact solution of random travelling salesman problems with medium size integer coefficients. SIAM J. Comput. (1987), Vol 16, Pages 1052-1072 Large holes in sparse random graphs. (Jackson, B.) Combinatorica (1987), Vol 7, Pages 265-274 On the strength of connectivity of random subgraphs of the $n$-cube. (Dyer, M. E.;Foulds, L. R.) North-Holland Math. Stud. (1987), Pages 17-40 An algorithm for finding Hamilton paths and cycles in random graphs. (Bollobás, B.; Fenner, T. I.) Combinatorica (1987), Vol 7, Pages 327-341 Expected behaviour of line-balancing heuristics. (Baybars, İlker) IMA J. Math. Management (1986/87), Vol 1, Pages 1-11 On the Lagarias-Odlyzko algorithm for the subset sum problem. SIAM J. Comput. (1986), Vol 15, Pages 536-539 Maximum matchings in a class of random graphs. J. Combin. Theory Ser. B (1986), Vol 40, Pages 196-212 Planar $3$DM is NP-complete. (Dyer, M. E.) J. Algorithms (1986), Vol 7, Pages 174-184 On large matchings and cycles in sparse random graphs. Discrete Math. (1986), Vol 59, Pages 243-256 On linear programs with random costs. (Dyer, M. E.;McDiarmid, C. J. H.) Math. Programming (1986), Vol 35, Pages 3-16 A probabilistic analysis of the next fit decreasing bin packing heuristic. (Csirik, J.; Galambos, G.; Frenk, J. B. G.;Rinnooy Kan, A. H. G.) Oper. Res. Lett. (1986), Vol 5, Pages 233-236 On the value of a random minimum spanning tree problem. Discrete Appl. Math. (1985), Vol 10, Pages 47-56 The shortest-path problem for graphs with random arc-lengths. (Grimmett, G. R.) Discrete Appl. Math. (1985), Vol 10, Pages 57-77 On the complexity of partitioning graphs into connected subgraphs. (Dyer, M. E.) Discrete Appl. Math. (1985), Vol 10, Pages 139-153 Analysis of heuristics for finding a maximum weight planar subgraph. (Dyer, M. E.; Foulds, L. R.) European J. Oper. Res. (1985), Vol 20, Pages 102-114 An algorithm for finding a matroid basis which maximizes the product of the weights of the elements. (Fenner, T. I.) BIT (1985), Vol 25, Pages 434–438 A simple heuristic for the $p$-centre problem. (Dyer, M. E.) Oper. Res. Lett. (1985), Vol 3, Pages 285-288 Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs. European J. Combin. (1985), Vol 6, Pages 327–334 On matchings and Hamiltonian cycles in random graphs. (Bollobás, Béla) North-Holland Math. Stud. (1985), Pages 23-46 Approximation algorithms for the $m$-dimensional $0-1$ knapsack problem: worst-case and probabilistic analyses. (Clarke, M. R. B.) European J. Oper. Res. (1984), Vol 15, Pages 100-109 A partitioning algorithm for minimum weighted Euclidean matching. (Dyer, M. E.) Inform. Process. Lett. (1984), Vol 18, Pages 59-62 Hamiltonian cycles in random regular graphs. (Fenner, T. I.) J. Combin. Theory Ser. B (1984), Vol 37, Pages 103-112 On the complexity of finding sets of edges in graphs and digraphs. (Fenner, T. I.) Progress in graph theory (1984), Pages 219-232 Long cycles in sparse random graphs. (Bollobás, B.; Fenner, T. I.) Academic Press (1984), Pages 59-64 Partitioning heuristics for two geometric maximization problems. (Dyer, M. E.;McDiarmid, C. J. H.) Oper. Res. Lett. (1984), Vol 3, Pages 267-270 Algebraic flows. North-Holland Math. Stud. (1984), Pages 135-146 On the quadratic assignment problem. (Yadegar, J.) Discrete Appl. Math. (1983), Vol 5, Pages 89-98 An extension of Christofides heuristic to the $k$-person travelling salesman problem. Discrete Appl. Math. (1983), Vol 6, Pages 79-83 On the existence of Hamiltonian cycles in a class of random graphs. (Fenner, T. I.) Discrete Math. (1983), Vol 45, Pages 301-305 Complexity of a $3$-dimensional assignment problem. European J. Oper. Res. (1983), Vol 13, Pages 161-164 Corrigendum: "Algebraic linear programming'' Math. Oper. Res. (1983), Vol 8, Pages 477 On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. (Galbiati, G.; Maffioli, F.) Networks (1982), Vol 12, Pages 23–39 Algebraic linear programming. Math. Oper. Res. (1982), Vol 7, Pages 172-182 On the connectivity of random $m$-orientable graphs and digraphs. (Fenner, T. I.) Combinatorica (1982), Vol 2, Pages 347-359 Probabilistic analysis of some Euclidean clustering problems. Discrete Appl. Math. (1980), Vol 2, Pages 295-309 Worst-case analysis of algorithms for travelling salesman problems. Operations Res. Verfahren (1979), Pages 93-112 An algorithm for algebraic assignment problems. Discrete Appl. Math. (1979), Vol 1, Pages 253-259 A partitioned inverse in linear programming. J. Oper. Res. Soc. (1978), Vol 29, Pages 383-388 Shortest path algorithms for knapsack type problems. Math. Programming (1976), Vol 11, Pages 150-157 Bottleneck linear programming. Operational Res. Quart. (1975), Vol 26, Pages 871-874 A bilinear programming formulation of the $3$-dimensional assignment problem. Math. Programming (1974), Vol 7, Pages 376-379 A cost function property for plant location problems. Math. Programming (1974), Vol 7, Pages 245-248

맨위로

Information Center for Mathematical Sciences KAIST
34141 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8196
e-mail : mathnet@mathnet.or.kr
Copyright (C) 2018. ICMS All Rights Reserved.