Mikkel Thorup 个人学术档案

引用次数

	总计	2019 年至今
引用	19333	4636
h 指数	69	36
i10 指数	167	100

1100

550

275

825

1996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202450 113 91 107 182 195 321 412 604 827 812 1001 891 857 933 884 893 883 816 841 835 860 894 849 839 840 842 857 406

开放获取的出版物数量

查看全部

50 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Nick DuffieldDirector, Texas A&M Institute of Data Science; Royce E. Wisenbaker Professorship I in ECE在 ece.tamu.edu 的电子邮件经过验证
Uri ZwickTel Aviv University在 tau.ac.il 的电子邮件经过验证
Bernard FortzHEC Liége, management school of the University of Liège在 uliege.be 的电子邮件经过验证
Mihai PatrascuAT&T Labs在 alum.mit.edu 的电子邮件经过验证
Stephen AlstrupUniversity of Copenhagen (in start-ups on/off since 2003 )在 di.ku.dk 的电子邮件经过验证
Martin Farach-ColtonShustek Professor of Computer Science, New York University在 nyu.edu 的电子邮件经过验证
Jacob HolmAssistant Professor, University of Copenhagen在 di.ku.dk 的电子邮件经过验证
Haim KaplanSchool of Computer Science, Tel Aviv University在 post.tau.ac.il 的电子邮件经过验证
Edith CohenGoogle, Tel Aviv University在 alumni.stanford.edu 的电子邮件经过验证
Luciana Salete BuriolComputer Science, UFRGS and Amazon在 amazon.com 的电子邮件经过验证
Ken-ichi KawarabayashiNational Institute of Informatics, The University of Tokyo在 nii.ac.jp 的电子邮件经过验证
Mauricio G. C. ResendeUniversity of Washington在 uw.edu 的电子邮件经过验证
Yin Zhang (章寅)The University of Texas at Austin在 cs.utexas.edu 的电子邮件经过验证
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus University在 cs.au.dk 的电子邮件经过验证
Mathias Bæk Tejs KnudsenCo-Founder of SupWiz在 tejs.dk 的电子邮件经过验证
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)在 ist.ac.at 的电子邮件经过验证
Teresa PrzytyckaNCBI / NLM / NIH在 ncbi.nlm.nih.gov 的电子邮件经过验证
Søren DahlgaardCo-founder of AI start-up SupWiz在 supwiz.com 的电子邮件经过验证
Mike PatersonEmeritus Professor of Computer Science, University of Warwick在 warwick.ac.uk 的电子邮件经过验证
Soren RiisQueen Mary University of London在 qmul.ac.uk 的电子邮件经过验证

关注

Mikkel Thorup

University of Copenhagen

在 diku.dk 的电子邮件经过验证

Algorithms and data structures


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Internet traffic engineering by optimizing OSPF weights B Fortz, M Thorup Proceedings IEEE INFOCOM 2000. conference on computer communications …, 2000	1748	2000
Approximate distance oracles M Thorup, U Zwick Journal of the ACM (JACM) 52 (1), 1-24, 2005	922	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	895	2002
Traffic engineering with traditional IP routing protocols B Fortz, J Rexford, M Thorup IEEE communications Magazine 40 (10), 118-124, 2002	700	2002
Compact routing schemes M Thorup, U Zwick Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001	699	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	676	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	604	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	386	2004
Increasing internet capacity using local search B Fortz, M Thorup Computational Optimization and Applications 29, 13-48, 2004	351	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	327	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	281*	2007
String matching in Lempel-Ziv compressed strings M Farach, M Thorup Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995	281	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	266	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	244	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	236	2006
Near-optimal fully-dynamic graph connectivity M Thorup Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	229	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	218	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	216	2005
All structured programs have small tree width and good register allocation M Thorup Information and Computation 142 (2), 159-181, 1998	216	1998

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用