| New strategies for assigning real-time tasks to multiprocessor systems A Burchard, J Liebeherr, Y Oh, SH Son IEEE Transactions on Computers 44 (12), 1429-1442, 1995 | 428* | 1995 |
| A network calculus with effective bandwidth C Li, A Burchard, J Liebeherr IEEE/ACM Transactions on Networking 15 (6), 1442-1453, 2007 | 265 | 2007 |
| Hölder regularity and dimension bounds for random curves M Aizenman, A Burchard Duke Mathematical Journal 99 (3), 419-454, 1999 | 226 | 1999 |
| A min-plus calculus for end-to-end statistical service guarantees A Burchard, J Liebeherr, SD Patek IEEE Transactions on Information Theory 52 (9), 4105-4114, 2006 | 224* | 2006 |
| Statistical service assurances for traffic scheduling algorithms RR Boorstyn, A Burchard, J Liebeherr, C Oottamakorn IEEE Journal on Selected Areas in Communications 18 (12), 2651-2664, 2000 | 213 | 2000 |
| A network service curve approach for the stochastic analysis of networks F Ciucu, A Burchard, J Liebeherr ACM Sigmetrics 2005, Proceedings, 279-290, 2005 | 157 | 2005 |
| Scaling properties of statistical end-to-end bounds in the network calculus F Ciucu, A Burchard, J Liebeherr IEEE Transactions on Information Theory 52 (6), 2300-2312, 2006 | 152 | 2006 |
| Confocal FRET microscopy to measure clustering of ligand-receptor complexes in endocytic membranes H Wallrabe, M Elangovan, A Burchard, A Periasamy, M Barroso Biophysical Journal 85 (1), 559-571, 2003 | 140 | 2003 |
| A short course on rearrangement inequalities A Burchard Lecture notes, 47 pages, 2009 | 134 | 2009 |
| Network-layer performance analysis of multi-hop fading channels H Al-Zubaidy, J Liebeherr, A Burchard IEEE/ACM Transactions on Networking 24 (1), 204-217, 2016 | 133 | 2016 |
| Cases of equality in the Riesz rearrangement inequality A Burchard Annals of Mathematics 143, 499-527, 1996 | 122 | 1996 |
| Delay bounds in communication networks with heavy-tailed and self-similar traffic J Liebeherr, A Burchard, F Ciucu IEEE Transactions on Information Theory 58 (2), 1010-1024, 2012 | 119 | 2012 |
| Scaling limits for minimal and random spanning trees in two dimensions M Aizenman, A Burchard, CM Newman, DB Wilson Random Structures and Algorithms 15 (3-4), 319-467, 1999 | 95 | 1999 |
| Rearrangement inequalities for functionals with monotone integrands A Burchard, H Hajaiej Journal of Functional Analysis 233 (2), 561-582, 2006 | 94 | 2006 |
| Steiner symmetrization is continuous in W(1,p) A Burchard Geometric and Functional Analysis 7 (5), 823-860, 1997 | 87 | 1997 |
| Effective envelopes: Statistical bounds on multiplexed traffic in packet networks R Boorstyn, A Burchard, J Liebeherr, C Oottamakorn IEEE Infocom 2000, Proceedings, 1223-1232, 2000 | 67 | 2000 |
| Comparison theorems for exit times A Burchard, M Schmuckenschläger Geometric and Functional Analysis 11 (4), 651-692, 2001 | 66 | 2001 |
| Nonlocal shape optimization via interactions of attractive and repulsive potentials A Burchard, R Choksi, I Topaloglu Indiana University Mathematical Journal 67 (1), 375-395, 2018 | 57 | 2018 |
| A (min,×) network calculus for multi-hop fading channels H Al-Zubaidy, J Liebeherr, A Burchard IEEE Infocom 2013, Proceedings, 1833-1841, 2013 | 54 | 2013 |
| Compactness via symmetrization A Burchard, Y Guo Journal of Functional Analysis 214 (1), 40-73, 2004 | 49 | 2004 |
Jorg LiebeherrUniversity of Toronto, Department of ECEVerified email at comm.utoronto.ca
