Mikkel Thorup

Citace

	Všechny	Od 2020
Citace	19869	4296
h-index	69	35
i10-index	167	96

1100

550

275

825

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202550 113 91 107 182 195 324 410 606 826 812 1001 891 865 935 883 891 889 815 843 838 858 899 856 843 844 858 831 761 155

Veřejný přístup

Zobrazit všechny

52 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Nick DuffieldDirector, Texas A&M Institute of Data Science; Royce E. Wisenbaker Professorship I in ECEE-mailová adresa ověřena na: ece.tamu.edu
Uri ZwickTel Aviv UniversityE-mailová adresa ověřena na: tau.ac.il
Bernard FortzHEC Liége, management school of the University of LiègeE-mailová adresa ověřena na: uliege.be
Mihai PatrascuAT&T LabsE-mailová adresa ověřena na: alum.mit.edu
Stephen AlstrupUniversity of Copenhagen (in start-ups on/off since 2003 )E-mailová adresa ověřena na: di.ku.dk
Martin Farach-ColtonShustek Professor of Computer Science, New York UniversityE-mailová adresa ověřena na: nyu.edu
Jacob HolmAssistant Professor, University of CopenhagenE-mailová adresa ověřena na: di.ku.dk
Haim KaplanSchool of Computer Science, Tel Aviv UniversityE-mailová adresa ověřena na: post.tau.ac.il
Edith CohenGoogle, Tel Aviv UniversityE-mailová adresa ověřena na: alumni.stanford.edu
Luciana Salete BuriolComputer Science, UFRGS and AmazonE-mailová adresa ověřena na: amazon.com
Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoE-mailová adresa ověřena na: nii.ac.jp
Mauricio G. C. ResendeUniversity of WashingtonE-mailová adresa ověřena na: uw.edu
Yin Zhang (章寅)The University of Texas at AustinE-mailová adresa ověřena na: cs.utexas.edu
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityE-mailová adresa ověřena na: cs.au.dk
Mathias Bæk Tejs KnudsenCo-Founder of SupWizE-mailová adresa ověřena na: tejs.dk
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)E-mailová adresa ověřena na: ist.ac.at
Søren DahlgaardCo-founder of AI start-up SupWizE-mailová adresa ověřena na: supwiz.com
Teresa PrzytyckaNCBI / NLM / NIHE-mailová adresa ověřena na: ncbi.nlm.nih.gov
Mike PatersonEmeritus Professor of Computer Science, University of WarwickE-mailová adresa ověřena na: warwick.ac.uk
Soren RiisQueen Mary University of LondonE-mailová adresa ověřena na: qmul.ac.uk

Sledovat

Mikkel Thorup

University of Copenhagen

E-mailová adresa ověřena na: diku.dk

Algorithms and data structures


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Internet traffic engineering by optimizing OSPF weights B Fortz, M Thorup Proceedings IEEE INFOCOM 2000. conference on computer communications …, 2000	1787	2000
Approximate distance oracles M Thorup, U Zwick Journal of the ACM (JACM) 52 (1), 1-24, 2005	951	2005
Optimizing OSPF/IS-IS weights in a changing world B Fortz, M Thorup IEEE journal on selected areas in communications 20 (4), 756-767, 2002	909	2002
Traffic engineering with traditional IP routing protocols B Fortz, J Rexford, M Thorup IEEE communications Magazine 40 (10), 118-124, 2002	717	2002
Compact routing schemes M Thorup, U Zwick Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001	703	2001
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity J Holm, K De Lichtenberg, M Thorup Journal of the ACM (JACM) 48 (4), 723-760, 2001	700	2001
Undirected single-source shortest paths with positive integer weights in linear time M Thorup Journal of the ACM (JACM) 46 (3), 362-394, 1999	616	1999
Estimating flow distributions from sampled flow statistics N Duffield, C Lund, M Thorup Proceedings of the 2003 conference on Applications, technologies …, 2003	418	2003
Compact oracles for reachability and approximate distances in planar digraphs M Thorup Journal of the ACM (JACM) 51 (6), 993-1024, 2004	400	2004
Increasing internet capacity using local search B Fortz, M Thorup Computational Optimization and Applications 29, 13-48, 2004	355	2004
Properties and prediction of flow statistics from sampled packet streams N Duffield, C Lund, M Thorup Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, 159-171, 2002	328	2002
Priority sampling for estimation of arbitrary subset sums N Duffield, C Lund, M Thorup Journal of the ACM (JACM) 54 (6), 32-es, 2007	289*	2007
String matching in Lempel-Ziv compressed strings M Farach, M Thorup Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995	283	1995
Charging from sampled network usage N Duffield, C Lund, M Thorup Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement, 245-256, 2001	270	2001
On the approximability of numerical taxonomy (fitting distances by tree metrics) R Agarwala, V Bafna, M Farach, M Paterson, M Thorup SIAM Journal on Computing 28 (3), 1073-1085, 1998	247	1998
Time-space trade-offs for predecessor search M Pătraşcu, M Thorup Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006	244	2006
Near-optimal fully-dynamic graph connectivity M Thorup Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	236	2000
Integer priority queues with decrease key in constant time and the single source shortest paths problem M Thorup Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003	227	2003
A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing LS Buriol, MGC Resende, CC Ribeiro, M Thorup Networks: An International Journal 46 (1), 36-56, 2005	223	2005
On RAM priority queues M Thorup SIAM Journal on Computing 30 (1), 86-109, 2000	223	2000

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři