default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Gilbert 0001
Anna C. Gilbert
Person information
- affiliation: Yale University, Department of Statistics & Data Science, New Haven, CT, USA
- affiliation: University of Michigan, Department of Mathematics, Ann Arbor, MI, USA
Other persons with the same name
- Anna Gilbert 0002
![[0000-0002-9627-9274]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9627-9274")
— Taylor & Francis Group, Abingdon, UK
SPARQL queries 
🛈 Please note that only 64% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2020 – today
- 2026
[j29]Isay Katsman, Ethan Lou, Anna Gilbert:
Revisiting Graph Learning Benchmarks: When is the Graph Actually Necessary? Neural Process. Lett. 58(2): 24 (2026)- 2025
- [j28]Anna C. Gilbert, Kevin O'Neill:
CA-PCA: Manifold Dimension Estimation, Adapted for Curvature. SIAM J. Math. Data Sci. 7(1): 355-383 (2025) - [j27]Isay Katsman, Anna Gilbert:
Shedding Light on Problems with Hyperbolic Graph Learning. Trans. Mach. Learn. Res. 2025 (2025) - 2024
- [c55]Doron Haviv, Russell Zhang Kunes, Thomas Dougherty, Cassandra Burdziak, Tal Nawy, Anna Gilbert, Dana Pe'er:
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformer. ICML 2024: 17697-17718 - [i33]Anna C. Gilbert, Kevin O'Neill:
Sketching the Heat Kernel: Using Gaussian Processes to Embed Data. CoRR abs/2403.07929 (2024) - [i32]Doron Haviv, Russell Zhang Kunes, Thomas Dougherty, Cassandra Burdziak, Tal Nawy, Anna Gilbert, Dana Pe'er:
Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformers. CoRR abs/2404.09411 (2024) - [i31]Joon-Hyeok Yim, Anna C. Gilbert:
Fitting trees to ℓ1-hyperbolic distances. CoRR abs/2409.01010 (2024) - [i30]Isay Katsman, Anna Gilbert:
Shedding Light on Problems with Hyperbolic Graph Learning. CoRR abs/2411.06688 (2024) - [i29]Isay Katsman, Ethan Lou, Anna Gilbert:
Revisiting the Necessity of Graph Learning and Common Graph Benchmarks. CoRR abs/2412.06173 (2024) - 2023
- [c54]Joon-Hyeok Yim, Anna C. Gilbert:
Fitting trees to 𝓁1-hyperbolic distances. NeurIPS 2023 - [i28]Anna C. Gilbert, Kevin O'Neill:
CA-PCA: Manifold Dimension Estimation, Adapted for Curvature. CoRR abs/2309.13478 (2023) - 2022
- [j26]Rishi Sonthalia, Anna C. Gilbert:
Project and Forget: Solving Large-Scale Metric Constrained Problems. J. Mach. Learn. Res. 23: 326:1-326:54 (2022) - [c53]Yulan Zhang, Anna C. Gilbert, Stefan Steinerberger:
May the force be with you. Allerton 2022: 1-8 - [c52]Rishi Sonthalia, Anna C. Gilbert, Matthew Durham:
CubeRep: Learning Relations Between Different Views of Data. TAG-ML 2022: 298-303 - [i27]Yulan Zhang, Anna C. Gilbert, Stefan Steinerberger:
May the force be with you. CoRR abs/2208.06676 (2022) - 2021
- [c51]Rishi Sonthalia, Greg Van Buskirk, Benjamin Raichel, Anna C. Gilbert:
How can classical multidimensional scaling go wrong? NeurIPS 2021: 12304-12315 - [i26]Rishi Sonthalia, Gregory Van Buskirk, Benjamin Raichel, Anna C. Gilbert:
How can classical multidimensional scaling go wrong? CoRR abs/2110.11430 (2021) - 2020
- [j25]Alexander H. S. Vargo, Anna C. Gilbert:
A rank-based marker selection method for high throughput scRNA-seq data. BMC Bioinform. 21(1): 477 (2020) - [j24]Anna C. Gilbert, Howard W. Levinson, John C. Schotland:
Nonlinear Iterative Hard Thresholding for Inverse Scattering. SIAM J. Imaging Sci. 13(1): 108-140 (2020) - [c50]Anna C. Gilbert, Albert Gu, Christopher Ré, Atri Rudra, Mary Wootters:
Sparse Recovery for Orthogonal Polynomial Transforms. ICALP 2020: 58:1-58:16 - [c49]Rishi Sonthalia, Anna C. Gilbert:
Tree! I am no Tree! I am a low dimensional Hyperbolic Embedding. NeurIPS 2020 - [c48]Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk:
Generalized Metric Repair on Graphs. SWAT 2020: 25:1-25:22 - [c47]Lalit Jain, Anna C. Gilbert, Umang Varma:
Spectral Methods for Ranking with Scarce Data. UAI 2020: 609-618 - [i25]Rishi Sonthalia, Anna C. Gilbert:
Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding. CoRR abs/2005.03847 (2020) - [i24]Rishi Sonthalia, Anna C. Gilbert:
Project and Forget: Solving Large-Scale Metric Constrained Problems. CoRR abs/2005.03853 (2020) - [i23]Umang Varma, Lalit Jain, Anna C. Gilbert:
Spectral Methods for Ranking with Scarce Data. CoRR abs/2007.01346 (2020) - [i22]Rishi Sonthalia, Anna C. Gilbert:
Dual Regularized Optimal Transport. CoRR abs/2012.03126 (2020)
2010 – 2019
- 2019
- [i21]Anna C. Gilbert, Albert Gu, Christopher Ré, Atri Rudra, Mary Wootters:
Sparse Recovery for Orthogonal Polynomial Transforms. CoRR abs/1907.08362 (2019) - [i20]Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk:
Generalized Metric Repair on Graphs. CoRR abs/1908.08411 (2019) - 2018
- [c46]Anna C. Gilbert, Audra McMillan:
Property Testing For Differential Privacy. Allerton 2018: 249-258 - [c45]Anna C. Gilbert, Rishi Sonthalia:
Unsupervised Metric Learning in Presence of Missing Data. Allerton 2018: 313-321 - [c44]Audra McMillan, Anna C. Gilbert:
Local differential privacy for physical sensor data and sparse recovery. CISS 2018: 1-6 - [c43]Yitong Sun, Anna C. Gilbert, Ambuj Tewari:
But How Does It Work in Theory? Linear SVM with Random Features. NeurIPS 2018: 3383-3392 - [i19]Anna C. Gilbert, Audra McMillan:
Property Testing for Differential Privacy. CoRR abs/1806.06427 (2018) - [i18]Anna C. Gilbert, Rishi Sonthalia:
Unrolling Swiss Cheese: Metric repair on manifolds with holes. CoRR abs/1807.07610 (2018) - [i17]Anna C. Gilbert, Rishi Sonthalia:
Generalized Metric Repair on Graphs. CoRR abs/1807.07619 (2018) - [i16]Anna C. Gilbert, Ambuj Tewari, Yitong Sun:
But How Does It Work in Theory? Linear SVM with Random Features. CoRR abs/1809.04481 (2018) - [i15]Yitong Sun, Anna C. Gilbert, Ambuj Tewari:
Random ReLU Features: Universality, Approximation, and Composition. CoRR abs/1810.04374 (2018) - 2017
- [j23]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-All Sparse Recovery in Near-Optimal Time. ACM Trans. Algorithms 13(3): 32:1-32:26 (2017) - [c42]Anna C. Gilbert, Lalit Jain:
If it ain't broke, don't fix it: Sparse metric repair. Allerton 2017: 612-619 - [c41]Anna C. Gilbert, Yi Zhang, Kibok Lee, Yuting Zhang, Honglak Lee:
Towards Understanding the Invertibility of Convolutional Neural Networks. IJCAI 2017: 1703-1710 - [i14]Anna C. Gilbert, Yi Zhang, Kibok Lee, Yuting Zhang, Honglak Lee:
Towards Understanding the Invertibility of Convolutional Neural Networks. CoRR abs/1705.08664 (2017) - [i13]Anna C. Gilbert, Audra McMillan:
Local Differential Privacy for Physical Sensor Data and Sparse Recovery. CoRR abs/1706.05916 (2017) - [i12]Anna C. Gilbert, Lalit Jain:
If it ain't broke, don't fix it: Sparse metric repair. CoRR abs/1710.10655 (2017) - 2016
- [c40]Wenling Shang, Kihyuk Sohn, Honglak Lee, Anna C. Gilbert:
Discriminative Training of Structured Dictionaries via Block Orthogonal Matching Pursuit. SDM 2016: 243-251 - 2015
- [j22]Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss:
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. Algorithmica 73(2): 261-288 (2015) - 2014
- [j21]Anna C. Gilbert, Piotr Indyk, Mark A. Iwen, Ludwig Schmidt:
Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data. IEEE Signal Process. Mag. 31(5): 91-100 (2014) - [j20]Jae Young Park, Michael B. Wakin, Anna C. Gilbert:
Modal Analysis With Compressive Measurements. IEEE Trans. Signal Process. 62(7): 1655-1670 (2014) - [c39]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-All Sparse Recovery in Near-Optimal Time. ICALP (1) 2014: 538-550 - [i11]Anna C. Gilbert, Jeremy G. Hoskins, John C. Schotland:
Diffuse Scattering on Graphs. CoRR abs/1401.4428 (2014) - [i10]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-all Sparse Recovery in Near-Optimal Time. CoRR abs/1402.1726 (2014) - [i9]Mahmoud Abo Khamis, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra:
Sparse Approximation, List Decoding, and Uncertainty Principles. CoRR abs/1404.5190 (2014) - 2013
- [j19]Byung-soo Kim, Jae Young Park, Anna C. Gilbert, Silvio Savarese:
Hierarchical classification of images by sparse approximation. Image Vis. Comput. 31(12): 982-991 (2013) - [c38]Chun Lo, Mingyan Liu, Jerome P. Lynch, Anna C. Gilbert:
Efficient Sensor Fault Detection Using Combinatorial Group Testing. DCOSS 2013: 199-206 - [c37]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. ICALP (1) 2013: 461-472 - [c36]Paul Shearer, Anna C. Gilbert, Alfred O. Hero III:
Correcting camera shake by incremental sparse approximation. ICIP 2013: 572-576 - [c35]Denisa Duma, Mary Wootters, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra, Matthew Alpert, Timothy J. Close, Gianfranco Ciardo, Stefano Lonardi:
Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing. WABI 2013: 70-84 - [i8]Paul Shearer, Anna C. Gilbert, Alfred O. Hero III:
Correcting Camera Shake by Incremental Sparse Approximation. CoRR abs/1302.0439 (2013) - [i7]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
L2/L2-foreach sparse recovery with low risk. CoRR abs/1304.6232 (2013) - [i6]Jae Young Park, Michael B. Wakin, Anna C. Gilbert:
Modal Analysis with Compressive Measurements. CoRR abs/1307.1960 (2013) - 2012
- [j18]Praveen K. Yenduri, Aaron Z. Rocca, Aswin S. Rao, Shahrzad Naraghi, Michael P. Flynn, Anna C. Gilbert:
A Low-Power Compressive Sampling Time-Based Analog-to-Digital Converter. IEEE J. Emerg. Sel. Topics Circuits Syst. 2(3): 502-515 (2012) - [j17]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate Sparse Recovery: Optimizing Time and Measurements. SIAM J. Comput. 41(2): 436-453 (2012) - [j16]Vishal M. Patel, Ray Maleh, Anna C. Gilbert, Rama Chellappa:
Gradient-Based Image Recovery Methods From Incomplete Fourier Measurements. IEEE Trans. Image Process. 21(1): 94-105 (2012) - [c34]Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss:
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid. APPROX-RANDOM 2012: 61-72 - [c33]Praveen K. Yenduri, Anna C. Gilbert:
Compressive, collaborative spectrum sensing for wideband Cognitive Radios. ISWCS 2012: 531-535 - [c32]Anna C. Gilbert, Brett Hemenway, Atri Rudra, Martin J. Strauss, Mary Wootters:
Recovering simple signals. ITA 2012: 382-391 - [c31]Anna C. Gilbert, Brett Hemenway, Martin J. Strauss, David P. Woodruff, Mary Wootters:
Reusable low-error compressive sampling schemes through privacy. SSP 2012: 536-539 - [i5]Anna C. Gilbert, Jae Young Park, Michael B. Wakin:
Sketched SVD: Recovering Spectral Features from Compressive Measurements. CoRR abs/1211.0361 (2012) - 2011
- [j15]Melina Demertzi, Pedro C. Diniz, Mary W. Hall, Anna C. Gilbert, Yi Wang:
Domain-Specific Optimization of Signal Recognition Targeting FPGAs. ACM Trans. Reconfigurable Technol. Syst. 4(2): 17:1-17:26 (2011) - [c30]Byung-soo Kim, Jae Young Park, Anush Mohan, Anna C. Gilbert, Silvio Savarese:
Hierarchical Classification of Images by Sparse Approximation. BMVC 2011: 1-11 - [c29]Praveen K. Yenduri, Anna C. Gilbert, Michael P. Flynn, Shahrzad Naraghi:
Rand PPM: A lowpower compressive sampling analog to digital converter. ICASSP 2011: 5980-5983 - 2010
- [j14]Raghunandan M. Kainkaryam, Angela Bruex, Anna C. Gilbert, John Schiefelbein, Peter J. Woolf:
poolMC: Smart pooling of mRNA samples in microarray experiments. BMC Bioinform. 11: 299 (2010) - [j13]Anna C. Gilbert, Piotr Indyk:
Sparse Recovery Using Sparse Matrices. Proc. IEEE 98(6): 937-947 (2010) - [c28]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate sparse recovery: optimizing time and measurements. STOC 2010: 475-484
2000 – 2009
- 2009
- [j12]Xiaolin Shi, Matthew Bonner, Lada A. Adamic, Anna C. Gilbert:
The very small world of the well-connected. SIGWEB Newsl. 2009(Winter): 4:1-4:10 (2009) - [c27]Melina Demertzi, Pedro C. Diniz, Mary W. Hall, Anna C. Gilbert, Yi Wang:
Computation reuse in domain-specific optimization of signal recognition. FPGA 2009: 281 - [c26]Volkan Cevher, Petros Boufounos, Richard G. Baraniuk, Anna C. Gilbert, Martin J. Strauss:
Near-optimal Bayesian localization via incoherence and sparsity. IPSN 2009: 205-216 - [i4]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate Sparse Recovery: Optimizing Time and Measurements. CoRR abs/0912.0229 (2009) - 2008
- [j11]Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp:
A Tutorial on Fast Fourier Sampling. IEEE Signal Process. Mag. 25(2): 57-66 (2008) - [c25]Anna C. Gilbert, Mark A. Iwen, Martin J. Strauss:
Group testing and sparse signal recovery. ACSCC 2008: 1059-1063 - [c24]Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss:
Combining geometry and combinatorics: A unified approach to sparse signal recovery. Allerton 2008: 798-805 - [c23]Ray Maleh, Anna C. Gilbert:
Sublinear Recovery of Sparse Wavelet Signals. DCC 2008: 342-351 - [c22]Xiaolin Shi, Matthew Bonner, Lada A. Adamic, Anna C. Gilbert:
The very small world of the well-connected. Hypertext 2008: 61-70 - [c21]Anna C. Gilbert, Martin J. Strauss:
Fundamental performance bounds for a compressive sampling system. ICASSP 2008: 3841-3844 - [c20]Melina Demertzi, Pedro C. Diniz, Mary W. Hall, Anna C. Gilbert, Yi Wang:
The potential of computation reuse in high-level optimization of a signal recognition system. IPDPS 2008: 1-5 - [c19]Stephen Pfetsch, Tamer Ragheb, Jason N. Laska, Hamid Nejati, Anna C. Gilbert, Martin Strauss, Richard G. Baraniuk, Yehia Massoud:
On the feasibility of hardware implementation of sub-Nyquist random-sampling based analog-to-information conversion. ISCAS 2008: 1480-1483 - [i3]Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss:
Combining geometry and combinatorics: A unified approach to sparse signal recovery. CoRR abs/0804.4666 (2008) - 2007
- [j10]Anna C. Gilbert, Martin J. Strauss:
Analysis of Data Streams: Computational and Algorithmic Challenges. Technometrics 49(3): 346-356 (2007) - [j9]Joel A. Tropp, Anna C. Gilbert:
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit. IEEE Trans. Inf. Theory 53(12): 4655-4666 (2007) - [c18]Melina Demertzi, Pedro C. Diniz, Mary W. Hall, Anna C. Gilbert, Yi Wang:
A Combined Hardware/Software Optimization Framework for Signal Representation and Recognition. International Conference on Computational Science (1) 2007: 1230-1237 - [c17]Ray Maleh, Anna C. Gilbert, Martin J. Strauss:
Sparse Gradient Image Reconstruction Done Faster. ICIP (2) 2007: II:77-80 - [c16]Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin:
One sketch for all: fast algorithms for compressed sensing. STOC 2007: 237-246 - 2006
- [j8]Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss:
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit. Signal Process. 86(3): 572-588 (2006) - [c15]Kyle Herrity, Anna C. Gilbert, Joel A. Tropp:
Sparse Approximation Via Iterative Thresholding. ICASSP (3) 2006: 624-627 - [i2]A. Robert Calderbank, Anna C. Gilbert, Martin J. Strauss:
List decoding of noisy Reed-Muller-like codes. CoRR abs/cs/0607098 (2006) - [i1]Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin:
Algorithmic linear dimension reduction in the l_1 norm for sparse vectors. CoRR abs/cs/0608079 (2006) - 2005
- [j7]Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, Martin J. Strauss:
Better Alternatives to OSPF Routing. Algorithmica 43(1-2): 113-131 (2005) - [j6]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Domain-Driven Data Synopses for Dynamic Quantiles. IEEE Trans. Knowl. Data Eng. 17(7): 927-938 (2005) - [c14]Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss:
Simultaneous sparse approximation via greedy pursuit. ICASSP (5) 2005: 721-724 - [c13]William Aiello, Anna C. Gilbert, Brian Rexroad, Vyas Sekar:
Sparse Approximations for High Fidelity Compression of Network Traffic Data. Internet Measurement Conference 2005: 253-266 - [c12]Anna C. Gilbert, Joel A. Tropp:
Applications of sparse approximation in communications. ISIT 2005: 1000-1004 - [c11]A. Robert Calderbank, Anna C. Gilbert, Kirill Levchenko, S. Muthukrishnan, Martin Strauss:
Improved range-summable random variable construction algorithms. SODA 2005: 840-849 - 2004
- [j5]Donald F. Caldwell, Anna C. Gilbert, Joel Gottlieb, Albert G. Greenberg, Gísli Hjálmtýsson, Jennifer Rexford:
The cutting EDGE of IP router configuration. Comput. Commun. Rev. 34(1): 21-26 (2004) - 2003
- [j4]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
One-Pass Wavelet Decompositions of Data Streams. IEEE Trans. Knowl. Data Eng. 15(3): 541-554 (2003) - [c10]Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Martin Strauss:
Improved sparse approximation over quasiincoherent dictionaries. ICIP (1) 2003: I:37-40 - [c9]Anna C. Gilbert, S. Muthukrishnan, Martin Strauss:
Approximation of functions over redundant dictionaries using coherence. SODA 2003: 243-252 - [c8]Anna C. Gilbert, Howard J. Karloff:
On the fractal behavior of TCP. STOC 2003: 297-306 - 2002
- [c7]Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss:
Near-optimal sparse fourier representations via sampling. STOC 2002: 152-161 - [c6]Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Fast, small-space algorithms for approximate histogram maintenance. STOC 2002: 389-398 - [c5]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
How to Summarize the Universe: Dynamic Maintenance of Quantiles. VLDB 2002: 454-465 - 2001
- [j3]Youngmi Joo, Vinay J. Ribeiro, Anja Feldmann, Anna C. Gilbert, Walter Willinger:
TCP/IP traffic dynamics and network performance: a lesson in workload modeling, flow control, and trace-driven simulations. Comput. Commun. Rev. 31(2): 25-37 (2001) - [c4]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Optimal and Approximate Computation of Summary Statistics for Range Aggregates. PODS 2001 - [c3]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. VLDB 2001: 79-88
1990 – 1999
- 1999
- [j2]Anna C. Gilbert, Walter Willinger, Anja Feldmann:
Scaling Analysis of Conservative Cascades, with Applications to Network Traffic. IEEE Trans. Inf. Theory 45(3): 971-991 (1999) - [c2]Anja Feldmann, Anna C. Gilbert, Polly Huang, Walter Willinger:
Dynamics of IP Traffic: A Study of the Role of Variability and the Impact of Control. SIGCOMM 1999: 301-313 - 1998
- [j1]Anja Feldmann, Anna C. Gilbert, Walter Willinger, Thomas G. Kurtz:
The changing nature of network traffic: scaling phenomena. Comput. Commun. Rev. 28(2): 5-29 (1998) - [c1]Anja Feldmann, Anna C. Gilbert, Walter Willinger:
Data Networks as Cascades: Investigating the Multifractal Nature of Internet WAN Traffic. SIGCOMM 1998: 42-55
Coauthor Index
Martin Strauss 0001
aka: Martin J. Strauss
aka: Martin J. Strauss
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-28 01:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
