Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA 2001, Washington, DC, USA, January 7--9, 2001 (Q2714097)

The articles of this volume will be reviewed individually. The preceding symposium (11th, 2000) has been reviewed (see Zbl 0933.00039).NEWLINENEWLINEIndexed articles:NEWLINENEWLINE\textit{Halperin, Eran; Zwick, Uri}, Combinatorial approximation algorithms for the maximum directed cut problem, 1-7 [Zbl 1018.90039]NEWLINENEWLINE\textit{Calinescu, Gruia; Karloff, Howard; Rabani, Yuval}, Approximation algorithms for the 0-extension problem, 8-16 [Zbl 0987.05086]NEWLINENEWLINE\textit{Cole, Richard; Hariharan, Ramesh; Lewenstein, Moshe; Porat, Ely}, A faster implementation of the Goemans-Williamson clustering algorithm, 17-25 [Zbl 1002.90047]NEWLINENEWLINE\textit{Naor, Joseph; Rabani, Yuval}, Tree packing and approximating \(k\)-cuts, 26-27 [Zbl 0987.05089]NEWLINENEWLINE\textit{Li, Xiang-Yang; Teng, Shang-Hua}, Generating well-shaped Delaunay meshes in 3D, 28-37 [Zbl 0988.65014]NEWLINENEWLINE\textit{Dumitrescu, Adrian; Mitchell, Joseph S. B.}, Approximation algorithms for TSP with neighborhoods in the plane, 38-46 [Zbl 1018.90038]NEWLINENEWLINE\textit{Cheng, Ho-Lun; Dey, Tamal K.; Edelsbrunner, Herbert; Sullivan, John}, Dynamic skin triangulation. (Extended abstract), 47-56 [Zbl 0988.65016]NEWLINENEWLINE\textit{Har-Peled, Sariel; Sharir, Micha}, Online point location in planar arrangements and its applications, 57-66 [Zbl 0992.68159]NEWLINENEWLINE\textit{Sanders, Peter}, Reconciling simplicity and realism in parallel disk models, 67-76 [Zbl 0987.68103]NEWLINENEWLINE\textit{Vitter, Jeffrey Scott; Hutchinson, David A.}, Distribution sort with randomized cycling, 77-86 [Zbl 0987.68018]NEWLINENEWLINE\textit{Meyer, Ulrich}, External memory BFS on undirected graphs with bounded degree., 87-88 [Zbl 1113.68041]NEWLINENEWLINE\textit{Maheshwari, Anil; Zeh, Norbert}, I/O-efficient algorithms for graphs of bounded treewidth, 89-90 [Zbl 0989.90113]NEWLINENEWLINE\textit{Alon, Noga; Sudakov, Benny; Zwick, Uri}, Constructing worst case instances for semidefinite programming based approximation algorithms, 92-100 [Zbl 1012.90034]NEWLINENEWLINE\textit{Pellegrini, M.}, Randomized combinatorial algorithms for linear programming when the dimension is moderately high, 101-108 [Zbl 1012.90051]NEWLINENEWLINE\textit{Chekuri, Chandra; Khanna, Sanjeev; Naor, Joseph; Zosin, Leonid}, Approximation algorithms for the metric labeling problem via a new linear programming formulation, 109-118 [Zbl 0989.90104]NEWLINENEWLINE\textit{Doerr, Benjamin}, Lattice approximation and linear discrepancy of totally unimodular matrices. Extended abstract, 119-125 [Zbl 1018.90026]NEWLINENEWLINE\textit{Kumar, Ravi; Sivakumar, D.}, On polynomial approximations to the shortest lattice vector length, 126-127 [Zbl 0989.90112]NEWLINENEWLINE\textit{Chin, F. Y. L.; Fung, S. P. Y.; Wang, C. A.}, Approximation for minimum triangulation of convex polyhedra, 128-137 [Zbl 0988.65017]NEWLINENEWLINE\textit{Arkin, Esther M.; Bender, Michael A.; Demaine, Erik D.; Fekete, Sándor P.; Mitchell, Joseph S. B.; Sethia, Saurabh}, Optimal covering tours with turn costs, 138-147 [Zbl 0989.90023]NEWLINENEWLINE\textit{Agarwal, Pankaj K.; Har-Peled, Sariel}, Maintaining approximate extent measures of moving points, 148-157 [Zbl 1006.68138]NEWLINENEWLINE\textit{Hershberger, John; Suri, Subhash}, Simplified kinetic connectivity for rectangles and hypercubes, 158-167 [Zbl 0988.68138]NEWLINENEWLINE\textit{Karavelas, Menelaos I.; Guibas, Leonidas J.}, Static and kinetic geometric spanners with applications, 168-176 [Zbl 0987.68081]NEWLINENEWLINE\textit{Liben-Nowell, David}, Gossip is synteny: Incomplete gossip and an exact algorithm for syntenic distance, 177-185 [Zbl 1006.92023]NEWLINENEWLINE\textit{Warnow, Tandy; Moret, Bernard M. E.; St. John, Katherine}, Absolute convergence: True trees from short sequences, 186-195 [Zbl 0982.92026]NEWLINENEWLINE\textit{St. John, Katherine; Warnow, Tandy; Moret, Bernard M. E.; Vawter, Lisa}, Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining, 196-206 [Zbl 0982.92025]NEWLINENEWLINE\textit{Shah, Rahul; Farach-Colton, Martin}, On the midpath tree conjecture: A counter-example, 207 [Zbl 0987.68019]NEWLINENEWLINE\textit{Brown, Daniel G.}, A probabilistic analysis of a greedy algorithm arising from computational biology., 208-209 [Zbl 1106.92300]NEWLINENEWLINE\textit{Gavoille, Cyril; Peleg, David; Pérennes, Stéphane; Raz, Ran}, Distance labeling in graphs (extended abstract), 210-219 [Zbl 0987.05083]NEWLINENEWLINE\textit{Gupta, Anupam}, Steiner points in tree metrics don't (really) help, 220-227 [Zbl 0990.05033]NEWLINENEWLINE\textit{Eppstein, David; Wang, Joseph}, Fast approximation of centrality, 228-229 [Zbl 0999.91072]NEWLINENEWLINE\textit{Chen, Guangting; Xue, Guoliang}, \(k\)-pair delay constrained minimum cost routing in undirected networks, 230-231 [Zbl 1018.90006]NEWLINENEWLINE\textit{Chekuri, Chandra; Khanna, Sanjeev; Naor, Joseph}, A deterministic algorithm for the cost-distance problem, 232-233 [Zbl 1015.90009]NEWLINENEWLINE\textit{Zhou, Yunhong; Suri, Subhash}, Shape sensitive geometric permutations, 234-243 [Zbl 0990.65030]NEWLINENEWLINE\textit{Huang, Yingping; Xu, Jinhui; Chen, Danny Z.}, Geometric permutations of high dimensional spheres., 244-245 [Zbl 1113.52300]NEWLINENEWLINE\textit{Gutwenger, Carsten; Mutzel, Petra; Weiskircher, René}, Inserting an edge into a planar graph, 246-255 [Zbl 1006.68104]NEWLINENEWLINE\textit{Arya, Sunil; Malamatos, Theocharis; Mount, David M.}, Entropy-preserving cuttings and space-efficient planar point location, 256-261 [Zbl 0987.68082]NEWLINENEWLINE\textit{Arya, Sunil; Malamatos, Theocharis; Mount, David M.}, A simple entropy-based algorithm for planar point location, 262-268 [Zbl 0987.68083]NEWLINENEWLINE\textit{Ferragina, Paolo; Manzini, Giovanni}, An experimental study of an opportunistic index, 269-278 [Zbl 1002.68519]NEWLINENEWLINE\textit{Amir, Amihood; Cole, Richard; Hariharan, Ramesh; Lewenstein, Moshe; Porat, Ely}, Overlap matching, 279-288 [Zbl 0987.68020]NEWLINENEWLINE\textit{Demaine, Erik D.; López-Ortiz, Alejandro}, A linear lower bound on index size for text retrieval, 289-294 [Zbl 0987.68033]NEWLINENEWLINE\textit{Efrat, Alon; Indyk, Piotr; Venkatasubramanian, Suresh}, Pattern matching for sets of segments, 295-304 [Zbl 0992.68184]NEWLINENEWLINE\textit{Amir, Amihood; Lewenstein, Moshe; Porat, Ely}, Approximate subset matching with don't cares, 305-306 [Zbl 0987.68021]NEWLINENEWLINE\textit{Andersson, Arne; Thorup, Mikkel}, Dynamic string searching, 307-308 [Zbl 0987.68022]NEWLINENEWLINE\textit{Kortsarz, Guy; Krauthgamer, Robert}, On approximating the achromatic number (preliminary version), 309-318 [Zbl 0987.05054]NEWLINENEWLINE\textit{Halperin, Eran; Nathaniel, Ram; Zwick, Uri}, Coloring \(k\)-colorable graphs using smaller palettes, 319-326 [Zbl 0995.05061]NEWLINENEWLINE\textit{Krivelevich, Michael; Nathaniel, Ram; Sudakov, Benny}, Approximating coloring and maximum independent sets in 3-uniform hypergraphs, 327-328 [Zbl 0999.05039]NEWLINENEWLINE\textit{Eppstein, David}, Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction., 329-337 [Zbl 1113.68416]NEWLINENEWLINE\textit{Damian-Iordache, Mirela; Pemmaraju, Sriram V.}, Computing optimal \(\alpha\)-fat and \(\alpha\)-small decompositions, 338-339 [Zbl 0991.90551]NEWLINENEWLINE\textit{Iacono, John}, Optimal planar point location, 340-341 [Zbl 0987.68084]NEWLINENEWLINE\textit{Chen, Danny Z.; Daescu, Ovidiu; Hershberger, John; Kogge, Peter M.; Snoeyink, Jack}, Polygonal path approximation with angle constraints, 342-343 [Zbl 0987.68085]NEWLINENEWLINE\textit{Funke, Stefan; Ramos, Edgar A.}, Reconstructing a collection of curves with corners and endpoints, 344-353 [Zbl 0988.65019]NEWLINENEWLINE\textit{Meyerson, Adam; Munagala, Kamesh; Plotkin, Serge}, Web caching using access statistics, 354-363 [Zbl 1006.68006]NEWLINENEWLINE\textit{Bar-Noy, Amotz; Ladner, Richard E.}, Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract), 364-373 [Zbl 0987.68088]NEWLINENEWLINE\textit{Brehob, Mark; Enbody, Richard; Torng, Eric; Wagner, Stephen}, On-line restricted caching, 374-383 [Zbl 0987.68089]NEWLINENEWLINE\textit{Goel, Ashish; Meyerson, Adam; Plotkin, Serge}, Approximate majorization and fair online load balancing, 384-390 [Zbl 0988.91048]NEWLINENEWLINE\textit{Karger, David; Srebro, Nathan}, Learning Markov networks: Maximum bounded tree-width graphs, 392-401 [Zbl 0987.68067]NEWLINENEWLINE\textit{Rautenbach, Dieter; Reed, Bruce}, Approximately covering by cycles in planar graphs., 402-406 [Zbl 1113.68428]NEWLINENEWLINE\textit{Zelikovsky, Alexander Z.; Măndoiu, Ion I.}, Practical approximation algorithms for zero- and bounded-skew trees, 407-416 [Zbl 0987.05091]NEWLINENEWLINE\textit{Vetta, Adrian}, Approximating the minimum strongly connected subgraph via a matching lower bound, 417-426 [Zbl 0987.05090]NEWLINENEWLINE\textit{Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta}, Improved approximation algorithms for rectangle tiling and packing., 427-436 [Zbl 1113.68635]NEWLINENEWLINE\textit{Ruhl, Matthias; Bern, Marshall; Goldberg, David}, Secure notarization of paper text documents, 437-438 [Zbl 0987.68087]NEWLINENEWLINE\textit{Mishra, Nina; Oblinger, Dan; Pitt, Leonard}, Sublinear time approximate clustering, 439-447 [Zbl 0987.68068]NEWLINENEWLINE\textit{Naor, Moni; Pinkas, Benny}, Efficient oblivious transfer protocols, 448-457 [Zbl 0991.94045]NEWLINENEWLINE\textit{Naor, Moni; Reingold, Omer}, Constructing pseudo-random permutations with a prescribed structure, 458-459 [Zbl 0988.65003]NEWLINENEWLINE\textit{Raghavan, Vijay; Spinrad, Jeremy}, Robust algorithms for restricted domains, 460-467 [Zbl 0987.68090]NEWLINENEWLINE\textit{Kobler, Daniel; Rotics, Udi}, Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract), 468-476 [Zbl 0999.05092]NEWLINENEWLINE\textit{Johnson, Julie L.; Spinrad, Jeremy P.}, A polynomial time recognition algorithm for probe interval graphs, 477-486 [Zbl 0988.05086]NEWLINENEWLINE\textit{Makowsky, J. A.}, Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width, 487-495 [Zbl 0988.05087]NEWLINENEWLINE\textit{Li, Chen; Yap, Chee}, A new constructive root bound for algebraic expressions. (Extended abstract), 496-505 [Zbl 0988.65037]NEWLINENEWLINE\textit{Chiang, Yi-Ting; Lin, Ching-Chi; Lu, Hsueh-I}, Orderly spanning trees with applications to graph encoding and graph drawing, 506-515 [Zbl 0988.05029]NEWLINENEWLINE\textit{Iacono, John}, Alternatives to splay trees with \(O(\log n)\) worst-case access times, 516-522 [Zbl 0987.68023]NEWLINENEWLINE\textit{Brodnik, Andrej; Carlsson, Svante; Karlsson, Johan; Munro, J. Ian}, Worst case constant time priority queue, 523-528 [Zbl 0987.68016]NEWLINENEWLINE\textit{Munro, J. Ian; Raman, Venkatesh; Storm, Adam J.}, Representing dynamic binary trees succinctly, 529-536 [Zbl 0987.68054]NEWLINENEWLINE\textit{Fiat, Amos; Kaplan, Haim}, Making data structures confluently persistent. (Extended abstract), 537-546 [Zbl 0992.68036]NEWLINENEWLINE\textit{Abiteboul, Serge; Kaplan, Haim; Milo, Tova}, Compact labeling schemes for ancestor queries. (Extended abstract), 547-556 [Zbl 1012.90046]NEWLINENEWLINE\textit{Csirik, Janos; Johnson, David S.; Kenyon, Claire}, Better approximation algorithms for bin covering, 557-566 [Zbl 1018.90037]NEWLINENEWLINE\textit{Srinivasan, Aravind}, New approaches to covering and packing problems, 567-576 [Zbl 1012.90053]NEWLINENEWLINE\textit{Engels, Daniel W.; Feldman, Jon; Karger, David R.; Ruhl, Matthias}, Parallel processor scheduling with delay constraints, 577-585 [Zbl 1018.90014]NEWLINENEWLINE\textit{Coffman, E. G. jun.; Lueker, George S.}, Approximation algorithms for extensible bin packing, 586-588 [Zbl 1012.90049]NEWLINENEWLINE\textit{Skutella, Martin; Uetz, Marc}, Scheduling precedence-constrained jobs with stochastic processing times on parallel machines, 589-590 [Zbl 1018.90016]NEWLINENEWLINE\textit{Kesselman, Alexander; Mansour, Yishay}, Loss-bounded analysis for differentiated services, 591-600 [Zbl 1015.90011]NEWLINENEWLINE\textit{Borodin, Allan; Ostrovsky, Rafail; Rabani, Yuval}, Stability preserving transformations: Packet routing networks with edge capacities and speeds, 601-610 [Zbl 1027.90006]NEWLINENEWLINE\textit{Goel, Ashish; Meyerson, Adam; Plotkin, Serge}, Distributed admission control, scheduling, and routing with stale information, 611-619 [Zbl 0989.90071]NEWLINENEWLINE\textit{Hall, Joseph; Hartline, Jason; Karlin, Anna R.; Saia, Jared; Wilkes, John}, On algorithms for efficient data migration, 620-629 [Zbl 0987.68006]NEWLINENEWLINE\textit{De Marco, Gianluca; Pelc, Andrzej}, Fast distributed graph coloring with \(O(\Delta)\) colors, 630-635 [Zbl 0984.05033]NEWLINENEWLINE\textit{Guha, Sudipto; Meyerson, Adam; Munagala, Kamesh}, Improved algorithms for fault tolerant facility location, 636-641 [Zbl 1027.90053]NEWLINENEWLINE\textit{Charikar, Moses; Khuller, Samir; Mount, David M.; Narasimhan, Giri}, Algorithms for facility location problems with outliers. (Extended abstract), 642-651 [Zbl 1012.90026]NEWLINENEWLINE\textit{Frieze, Alan; Sorkin, Gregory B.}, The probabilistic relationship between the assignment and asymmetric traveling salesman problems., 652-660 [Zbl 1041.90044]NEWLINENEWLINE\textit{Baev, Ivan D.; Rajaraman, Rajmohan}, Approximation algorithms for data placement in arbitrary networks, 661-670 [Zbl 0987.68091]NEWLINENEWLINE\textit{Erlebach, Thomas; Jansen, Klaus; Seidel, Eike}, Polynomial-time approximation schemes for geometric graphs, 671-679 [Zbl 0988.65020]NEWLINENEWLINE\textit{Efrat, Alon; Har-Peled, Sariel; Guibas, Leonidas J.; Murali, T. M.}, Morphing between polylines, 680-689 [Zbl 0988.65021]NEWLINENEWLINE\textit{Miller, Kim; Ramaswami, Suneeta; Rousseeuw, Peter; Sellarès, Toni; Souvaine, Diane; Streinu, Ileana; Struyf, Anja}, Fast implementation of depth contours using topological sweep, 690-699 [Zbl 0988.65005]NEWLINENEWLINE\textit{Bern, Marshall; Eppstein, David}, Computing the depth of a flat, 700-701 [Zbl 0988.65006]NEWLINENEWLINE\textit{Chockler, Hana; Zwick, Uri}, Which formulae shrink under random restrictions?, 702-708 [Zbl 1007.68212]NEWLINENEWLINE\textit{Clementi, Andrea E. F.; Monti, Angelo; Silvestri, Riccardo}, Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract), 709-718 [Zbl 0989.94041]NEWLINENEWLINE\textit{Istrate, G.; Marathe, M. V.; Ravi, S. S.}, Adversarial models in evolutionary game dynamics, 719-720 [Zbl 0989.91503]NEWLINENEWLINE\textit{Achlioptas, Dimitris; Chtcherba, Arthur; Istrate, Gabriel; Moore, Cristopher}, The phase transition in 1-in-\(k\) SAT and NAE 3-SAT, 721-722 [Zbl 0991.68032]NEWLINENEWLINE\textit{Chung, Fan; Graham, Ronald; Leighton, Tom}, Guessing secrets. (Extended abstract), 723-726 [Zbl 0987.68092]NEWLINENEWLINE\textit{Pandurangan, Gopal; Upfal, Eli}, Can entropy characterize performance of online algorithms?, 727-734 [Zbl 1006.68167]NEWLINENEWLINE\textit{Goldberg, Andrew V.; Hartline, Jason D.; Wright, Andrew}, Competitive auctions and digital goods, 735-744 [Zbl 0988.91024]NEWLINENEWLINE\textit{Aspnes, James; Fischer, David F.; Fischer, Michael J.; Kao, Ming-Yang; Kumar, Alok}, Towards understanding the predictability of stock markets from the perspective of computational complexity, 745-754 [Zbl 0988.91025]NEWLINENEWLINE\textit{Lam, Tak-Wah; To, Kar-Keung}, Performance guarantee for online deadline scheduling in the presence of overload, 755-764 [Zbl 1015.90040]NEWLINENEWLINE\textit{Woeginger, Gerhard J.}, Assigning chain-like tasks to a chain-like network, 765-766 [Zbl 0988.68798]NEWLINENEWLINE\textit{Anderson, Richard; Tjaden, Brian}, The inverse nearest neighbor problem with astrophysical applications, 767-768 [Zbl 1006.65021]NEWLINENEWLINE\textit{Goel, Ashish; Indyk, Piotr; Varadarajan, Kasturi}, Reductions among high dimensional proximity problems, 769-778 [Zbl 0988.65022]NEWLINENEWLINE\textit{Alstrup, Stephen; Husfeldt, Thore; Rauhe, Theis}, A cell probe lower bound for dynamic nearest-neighbour searching, 779-780 [Zbl 0987.68024]NEWLINENEWLINE\textit{Klein, Philip N.; Sebastian, Thomas B.; Kimia, Benjamin B.}, Shape matching using edit-distance: An implementation, 781-790 [Zbl 0988.65023]NEWLINENEWLINE\textit{Dujmović, Vida; Whitesides, Sue}, On validating planar worlds, 791-792 [Zbl 0988.05085]NEWLINENEWLINE\textit{Han, Yijie}, Improved fast integer sorting in linear space, 793-796 [Zbl 0992.68042]NEWLINENEWLINE\textit{Meyer, Ulrich}, Single-source shortest-paths on arbitrary directed graphs in linear average-case time, 797-806 [Zbl 0988.05088]NEWLINENEWLINE\textit{Duncan, Christian A.; Kobourov, Stephen G.; Anil Kumar, V. S.}, Optimal constrained graph exploration, 807-814 [Zbl 0992.68160]NEWLINENEWLINE\textit{Althaus, Ernst; Duchier, Denys; Koller, Alexander; Mehlhorn, Kurt; Niehren, Joachim; Thiel, Sven}, An efficient algorithm for the configuration problem of dominance graphs, 815-824 [Zbl 0988.68139]NEWLINENEWLINE\textit{Biedl, Therese}, Linear reductions of maximum matching, 825-826 [Zbl 0983.05066]NEWLINENEWLINE\textit{Eppstein, David; Muthukrishnan, S.}, Internet packet filter management and rectangle geometry, 827-835 [Zbl 1020.90013]NEWLINENEWLINE\textit{Kaplan, Haim; Tarjan, Robert E.; Tsioutsiouliklis, Kostas}, Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract), 836-844 [Zbl 1027.90037]NEWLINENEWLINE\textit{Bender, Michael A.; Pemmasani, Giridhar; Skiena, Steven; Sumazin, Pavel}, Finding least common ancestors in directed acyclic graphs, 845-854 [Zbl 0984.05041]NEWLINENEWLINE\textit{Laber, Eduardo S.; Milidiú, Ruy L.; Pessoa, Artur A.}, On binary searching with non-uniform costs, 855-864 [Zbl 0987.68025]NEWLINENEWLINE\textit{Czumaj, Artur; Sohler, Christian}, Soft kinetic data structures, 865-872 [Zbl 0987.68017]NEWLINENEWLINE\textit{Fischer, Eldar}, Testing graphs for colorability properties, 873-882 [Zbl 1022.05026]NEWLINENEWLINE\textit{Amit, Alon; Linial, Nathan; Matoušek, Jiří; Rozenman, Eyal}, Random lifts of graphs, 883-894 [Zbl 0986.05090]NEWLINENEWLINE\textit{Boyan, Justin; Mitzenmacher, Michael}, Improved results for route planning in stochastic transportation networks, 895-902 [Zbl 1015.90003]NEWLINENEWLINE\textit{Carson, Ted; Impagliazzo, Russell}, Hill-climbing finds random planted bisections, 903-909 [Zbl 1014.05059]NEWLINENEWLINE\textit{Demaine, Erik D.; López-Ortiz, Alejandro; Munro, J. Ian}, On universally easy classes for NP-complete problems, 910-911 [Zbl 0987.68037]NEWLINENEWLINE\textit{Lu, Linyuan}, The diameter of random massive graphs, 912-921 [Zbl 0988.05082]NEWLINENEWLINE\textit{Srinivasan, Aravind}, Domatic partitions and the Lovász local lemma, 922-923 [Zbl 0988.05071]NEWLINENEWLINE\textit{Pemmaraju, Sriram V.}, Equitable colorings extend Chernoff-Hoeffding bounds, 924-925 [Zbl 1014.05025]NEWLINENEWLINE\textit{Dodis, Yevgeniy; Winkler, Peter}, Universal configurations in light-flipping games, 926-927 [Zbl 1004.91015]NEWLINENEWLINE\textit{Barbay, Jérémy; Kenyon, Claire}, On the discrete Bak-Sneppen model of self-organized criticality, 928-933 [Zbl 1007.92004]