Mikkel Thorup

Navedeno

	Vse	Od leta 2020
Navedbe	19943	4339
indeks h	69	35
indeks i10	168	100

1100

550

275

825

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202552 114 89 104 180 197 317 418 606 835 800 1005 897 846 933 887 898 893 814 843 848 863 902 860 841 839 834 820 785 217

Javni dostop

Prikaži vse

52 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Nick DuffieldDirector, Texas A&M Institute of Data Science; Royce E. Wisenbaker Professorship I in ECEPreverjeni e-poštni naslov na ece.tamu.edu
Uri ZwickTel Aviv UniversityPreverjeni e-poštni naslov na tau.ac.il
Bernard FortzHEC Liége, management school of the University of LiègePreverjeni e-poštni naslov na uliege.be
Mihai PatrascuAT&T LabsPreverjeni e-poštni naslov na alum.mit.edu
Stephen AlstrupUniversity of Copenhagen (in start-ups on/off since 2003 )Preverjeni e-poštni naslov na di.ku.dk
Martin Farach-ColtonShustek Professor of Computer Science, New York UniversityPreverjeni e-poštni naslov na nyu.edu
Jacob HolmAssistant Professor, University of CopenhagenPreverjeni e-poštni naslov na di.ku.dk
Haim KaplanSchool of Computer Science, Tel Aviv UniversityPreverjeni e-poštni naslov na post.tau.ac.il
Edith CohenGoogle, Tel Aviv UniversityPreverjeni e-poštni naslov na alumni.stanford.edu
Luciana Salete BuriolComputer Science, UFRGS and AmazonPreverjeni e-poštni naslov na amazon.com
Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoPreverjeni e-poštni naslov na nii.ac.jp
Mauricio G. C. ResendeUniversity of WashingtonPreverjeni e-poštni naslov na uw.edu
Yin Zhang (章寅)The University of Texas at AustinPreverjeni e-poštni naslov na cs.utexas.edu
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityPreverjeni e-poštni naslov na cs.au.dk
Mathias Bæk Tejs KnudsenCo-Founder of SupWizPreverjeni e-poštni naslov na tejs.dk
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Preverjeni e-poštni naslov na ist.ac.at
Søren DahlgaardCo-founder of AI start-up SupWizPreverjeni e-poštni naslov na supwiz.com
Teresa PrzytyckaNCBI / NLM / NIHPreverjeni e-poštni naslov na ncbi.nlm.nih.gov
Mike PatersonEmeritus Professor of Computer Science, University of WarwickPreverjeni e-poštni naslov na warwick.ac.uk
Soren RiisQueen Mary University of LondonPreverjeni e-poštni naslov na qmul.ac.uk

Spremljaj

Mikkel Thorup

University of Copenhagen

Preverjeni e-poštni naslov na diku.dk

Algorithms and data structures


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Internet traffic engineering by optimizing OSPF weights B Fortz, M Thorup Proceedings IEEE INFOCOM 2000. conference on computer communications …, 2000	1774	2000
Approximate distance oracles M Thorup, U Zwick Journal of the ACM (JACM) 52 (1), 1-24, 2005	966	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	915	2002
Traffic engineering with traditional IP routing protocols B Fortz, J Rexford, M Thorup IEEE communications Magazine 40 (10), 118-124, 2002	720	2002
Compact routing schemes M Thorup, U Zwick Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001	709	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	618	1999
Estimating flow distributions from sampled flow statistics N Duffield, C Lund, M Thorup Proceedings of the 2003 conference on Applications, technologies …, 2003	412	2003
Compact oracles for reachability and approximate distances in planar digraphs M Thorup Journal of the ACM (JACM) 51 (6), 993-1024, 2004	403	2004
Increasing internet capacity using local search B Fortz, M Thorup Computational Optimization and Applications 29, 13-48, 2004	356	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	330	2002
String matching in Lempel-Ziv compressed strings M Farach, M Thorup Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995	291	1995
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
Charging from sampled network usage N Duffield, C Lund, M Thorup Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement, 245-256, 2001	268	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	245	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	240	2006
Near-optimal fully-dynamic graph connectivity M Thorup Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	238	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
On RAM priority queues M Thorup SIAM Journal on Computing 30 (1), 86-109, 2000	226	2000
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	222	2005

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji