Mikkel Thorup

Citada per

	Totes	Des de 2020
Citacions	19869	4296
Índex h	69	35
Índex i10	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

Accés públic

Mostra-ho tot

52 articles

0 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Nick DuffieldDirector, Texas A&M Institute of Data Science; Royce E. Wisenbaker Professorship I in ECECorreu electrònic verificat a ece.tamu.edu
Uri ZwickTel Aviv UniversityCorreu electrònic verificat a tau.ac.il
Bernard FortzHEC Liége, management school of the University of LiègeCorreu electrònic verificat a uliege.be
Mihai PatrascuAT&T LabsCorreu electrònic verificat a alum.mit.edu
Stephen AlstrupUniversity of Copenhagen (in start-ups on/off since 2003 )Correu electrònic verificat a di.ku.dk
Martin Farach-ColtonShustek Professor of Computer Science, New York UniversityCorreu electrònic verificat a nyu.edu
Jacob HolmAssistant Professor, University of CopenhagenCorreu electrònic verificat a di.ku.dk
Haim KaplanSchool of Computer Science, Tel Aviv UniversityCorreu electrònic verificat a post.tau.ac.il
Edith CohenGoogle, Tel Aviv UniversityCorreu electrònic verificat a alumni.stanford.edu
Luciana Salete BuriolComputer Science, UFRGS and AmazonCorreu electrònic verificat a amazon.com
Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoCorreu electrònic verificat a nii.ac.jp
Mauricio G. C. ResendeUniversity of WashingtonCorreu electrònic verificat a uw.edu
Yin Zhang (章寅)The University of Texas at AustinCorreu electrònic verificat a cs.utexas.edu
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityCorreu electrònic verificat a cs.au.dk
Mathias Bæk Tejs KnudsenCo-Founder of SupWizCorreu electrònic verificat a tejs.dk
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Correu electrònic verificat a ist.ac.at
Søren DahlgaardCo-founder of AI start-up SupWizCorreu electrònic verificat a supwiz.com
Teresa PrzytyckaNCBI / NLM / NIHCorreu electrònic verificat a ncbi.nlm.nih.gov
Mike PatersonEmeritus Professor of Computer Science, University of WarwickCorreu electrònic verificat a warwick.ac.uk
Soren RiisQueen Mary University of LondonCorreu electrònic verificat a qmul.ac.uk

Segueix

Mikkel Thorup

University of Copenhagen

Correu electrònic verificat a diku.dk

Algorithms and data structures


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
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

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors