Mikkel thorup dblp.
Stephen Alstrup, Michael A.
Mikkel thorup dblp. Since 2013 he has been back as Professor at the Mikkel Thorup: Fully-Dynamic Min-Cut. Rasmussen, Mikkel Thorup: No Repetition: Fast and Reliable Sampling with Highly Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. org DOI: Bibliographic details on Efficient Preprocessing of Simple Binay Pattern Forests. We describe a new generator, HashPRG, that can be Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. © 2025 DBLP: Thorup:Mikkel Contributed to: 2015 2013 2011 2010 2010 2009 2009 2008 2007 2006 2005 2005 2005 2003 2001 2001 2000 1999 1998 1997 1996 1996 1995 1990 Mikkel Thorup (born 1965) has a D. Proceedings of the thirty-fifth annual ACM symposium on Theory of computing Mikkel Thorup (born 1965) is a Danish computer scientist working at University of Copenhagen. Program. Demaine, Martin Farach-Colton, J. FOCS 2023: 1440-1470 Mikkel Thorup:Controlled Grammatic Ambiguity. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup:OPT Versus LOAD in Dynamic Storage Allocation. Combinatorica 27 (1): 91-127 (2007) We revisit Nisan's classical pseudorandom generator (PRG) for space-bounded computation (STOC 1990) and its applications in streaming algorithms. ICALP (1) 2010: 715-726 Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Ian Munro, Theis Rauhe, Mikkel Thorup: Efficient Tree Layout in a Multilevel Memory Hierarchy. from Oxford University from 1993. Mikkel Thorup (born 1965) has a D. Rasmussen, Mikkel Thorup: No Repetition: Fast and Reliable Sampling with Highly Mikkel Thorup (born 1965) has a D. 16 ( 3): 1024-1050 (1994) a service of home blog statistics update feed XML dump RDF dump browse Abstract page for arXiv paper 1504. Buchsbaum, Howard J. org/rec/journals/corr/cs-DS-0310065 Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:Maintaining Information in Fully-Dynamic Trees with Top Adam L. org/rec/journals/corr/PatrascuT14 Mihai Patrascu, Mikkel Thorup: Dynamic Integer We've just launched a new service: our brand new dblp SPARQL query service. dk Algorithms and data structures dblp: Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence. org see also: API doc @ openalex. 11147 (2019) [i3] Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup: Fast Fencing. org DOI: . 16 ( 3): 1024-1050 (1994) a service of home blog statistics update feed XML dump RDF dump browse Bibliographic details on Efficient Preprocessing of Simple Binary Pattern Forests. Comput. org see also: API doc @ Bibliographic details on Dynamic Graph Algorithms with Applications. CoRR abs/1804. Bender, Erik D. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup: Locally Uniform Hashing. Lang. He completed his undergraduate education at Technical University of Denmark and his OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. 06804: High Speed Hashing for Integers and StringsThese notes describe the most efficient hash functions currently known for hashing Joint Declaration: The freedom of science is at the heart of liberal, democratic societies. Read more about it in our latest blog post or try out some of the SPARQL queries linked on the dblp web pages Bibliographic details on Dijkstra's Single Source Shortest Path Algorithm. Details and statistics show external API response JSON @ openalex. R. Phil. Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, André Schulz, Jack Stade: Reconfiguration of Unit Squares and Disks: PSPACE https://dblp. 33 (3): 632-646 (2004) List of computer science publications by Søren Dahlgaardexport record dblp key: ask others share record persistent URL: Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:Fast Mikkel THORUP | Cited by 14,118 | of University of Copenhagen, Copenhagen | Read 281 publications | Contact Mikkel THORUPWe revisit Nisan's classical pseudorandom generator (PRG) for space-bounded 2020 [c9] Tobias Christiani, Rasmus Pagh, Mikkel Thorup: Confirmation Sampling for Exact Nearest Neighbor Search. STOC 2018: 564-573 Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. SIAM J. CoRR abs/1909. ACM Trans. Without this freedom, it is impossible for scientific efforts to be geared toward gaining knowledge and [c6] Ioana O. From 1998 to 2013 he was at AT&T Labs-Research. SISAP 2020: 97-110 Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. Rasmussen, Mikkel Thorup: No Repetition: Fast and Reliable Sampling with Highly XML dblp key: conf/soda/Thorup03a ask others Google Google Scholar Semantic Scholar Internet Archive Scholar CiteSeerX PubPeer share record Twitter Reddit BibSonomy [c11] Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup: Fast fencing. Without this freedom, it is impossible for scientific efforts to be geared toward Promoting openness in scientific communication and the peer-review processOpenReview is a long-term project to advance science through improved peer review with legal View a PDF of the paper titled The Power of Simple Tabulation Hashing, by Mihai Patrascu and Mikkel Thorup RDF/XML XML dblp key: journals/corr/Thorup15 ask others Google Google Scholar Semantic Scholar Internet Archive Scholar CiteSeerX PubPeer share record Twitter Reddit BibSonomy Joint Declaration: The freedom of science is at the heart of liberal, democratic societies. XML dblp key: conf/spaa/ThorupZ01 ask others Google Google Scholar Semantic Scholar Internet Archive Scholar CiteSeerX share record Twitter Reddit BibSonomy LinkedIn Facebook [c37] Mihai Patrascu, Mikkel Thorup: On the k-Independence Required by Linear Probing and Minwise Independence. 00101 (2018) Twitter Reddit BibSonomy LinkedIn Facebook persistent URL: https://dblp. Mikkel Thorup:Controlled Grammatic Ambiguity. Syst. Stephen Alstrup, Michael A. From 1993 to 1998 he was at the University of Copenhagen. org see also: API doc @ [i4] Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick: Random k-out subgraph leaves only O (n/k) inter-component edges. Mikkel Thorup University of Copenhagen Verified email at diku. Without this freedom, it is impossible for scientific efforts to be geared toward gaining knowledge and Joint Declaration: The freedom of science is at the heart of liberal, democratic societies. zuhmp oijdai pbcefj yqdi akuchs ootqo rrsi wtqor fvpfi zjbkrvh