default search action
Ran Ben-Basat
Ran Ben Basat
Person information
- affiliation: University College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j18]He Huang
, Shigang Chen
Guest Editorial Introduction to the Special Section on Next-Generation Traffic Measurement With Network-Wide Perspective and Artificial Intelligence. IEEE Trans. Netw. Sci. Eng. 11(3): 2332-2337 (2024) - [j17]Jiaqian Liu
A Generic Framework for Finding Special Quadratic Elements in Data Streams. IEEE/ACM Trans. Netw. 32(4): 3269-3284 (2024) - [c56]Jiaqian Liu, Ran Ben Basat, Louis De Wardt, Haipeng Dai, Guihai Chen:
DISCO: A Dynamically Configurable Sketch Framework in Skewed Data Streams. ICDE 2024: 4801-4814 - [c55]Ran Ben-Basat, Shay Vargaftik, Amit Portnoy, Gil Einziger, Yaniv Ben-Itzhak, Michael Mitzenmacher:
Accelerating Federated Learning with Quick Distributed Mean Estimation. ICML 2024 - [c54]Minghao Li, Ran Ben Basat, Shay Vargaftik, ChonLam Lao, Kevin Xu, Michael Mitzenmacher, Minlan Yu:
THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. NSDI 2024 - [i36]Ran Ben-Basat, Yaniv Ben-Itzhak, Michael Mitzenmacher, Shay Vargaftik:
Optimal and Near-Optimal Adaptive Vector Quantization. CoRR abs/2402.03158 (2024) - [i35]Wenchen Han, Shay Vargaftik, Michael Mitzenmacher, Brad Karp, Ran Ben Basat:
Beyond Throughput and Compression Ratios: Towards High End-to-end Utility of Gradient Compression. CoRR abs/2407.01378 (2024) - 2023
- [j16]Sebastiano Miano
Fast In-kernel Traffic Sketching in eBPF. Comput. Commun. Rev. 53(1): 3-13 (2023) - [j15]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal distributed covering algorithms. Distributed Comput. 36(1): 45-55 (2023) - [j14]Rana Shahout
Together is Better: Heavy Hitters Quantile Estimation. Proc. ACM Manag. Data 1(1): 83:1-83:25 (2023) - [c53]Jonatan Langlet
Direct Telemetry Access. SIGCOMM 2023: 832-849 - [c52]Rong Gu, Simian Li, Haipeng Dai, Hancheng Wang, Yili Luo, Bin Fan, Ran Ben Basat, Ke Wang, Zhenyu Song, Shouwei Chen, Beinan Wang, Yihua Huang, Guihai Chen:
Adaptive Online Cache Capacity Optimization via Lightweight Working Set Size Estimation at Scale. USENIX ATC 2023: 467-484 - [i34]Minghao Li, Ran Ben Basat, Shay Vargaftik, ChonLam Lao, Kevin Xu, Xinran Tang, Michael Mitzenmacher, Minlan Yu:
THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compression. CoRR abs/2302.08545 (2023) - 2022
- [j13]Antonis Manousis, Zhuo Cheng, Ran Ben Basat, Zaoxing Liu, Vyas Sekar:
Enabling Efficient and General Subpopulation Analytics in Multidimensional Data Streams. Proc. VLDB Endow. 15(11): 3249-3262 (2022) - [j12]Ran Ben Basat, Gil Einziger
Memento: Making Sliding Windows Efficient for Heavy Hitters. IEEE/ACM Trans. Netw. 30(4): 1440-1453 (2022) - [c51]Shay Vargaftik, Ran Ben Basat, Amit Portnoy
EDEN: Communication-Efficient and Robust Distributed Mean Estimation for Federated Learning. ICML 2022: 21984-22014 - [c50]Rana Shahout, Roy Friedman, Ran Ben Basat:
SQUAD: combining sketching and sampling is better than either for per-item quantile estimation. SYSTOR 2022: 152 - [c49]Jiaqian Liu, Haipeng Dai, Rui Xia, Meng Li, Ran Ben Basat, Rui Li, Guihai Chen:
DUET: A Generic Framework for Finding Special Quadratic Elements in Data Streams. WWW 2022: 2989-2997 - [i33]Rana Shahout, Roy Friedman, Ran Ben Basat:
SQUAD: Combining Sketching and Sampling Is Better than Either for Per-item Quantile Estimation. CoRR abs/2201.01958 (2022) - [i32]Jonatan Langlet, Ran Ben Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro, Michael Mitzenmacher, Minlan Yu, Gianni Antichi:
Direct Telemetry Access. CoRR abs/2202.02270 (2022) - [i31]Wenchen Han, Vic Feng, Gregory Schwartzman, Michael Mitzenmacher, Minlan Yu, Ran Ben-Basat:
FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches. CoRR abs/2204.14138 (2022) - [i30]Ran Ben Basat, Shay Vargaftik, Amit Portnoy
QUIC-FL: Quick Unbiased Compression for Federated Learning. CoRR abs/2205.13341 (2022) - [i29]Antonis Manousis, Zhuo Cheng, Ran Ben Basat, Zaoxing Liu, Vyas Sekar:
Enabling Efficient and General Subpopulation Analytics in Multidimensional Data Streams. CoRR abs/2208.04927 (2022) - [i28]Ran Ben-Basat, Gil Einziger, Wenchen Han, Bilal Tayh:
SQUID: Faster Analytics via Sampled Quantiles Data-structure. CoRR abs/2211.01726 (2022) - 2021
- [j11]Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti
Approximate query processing over static sets and sliding windows. Theor. Comput. Sci. 885: 1-14 (2021) - [j10]Ran Ben-Basat, Gil Einziger
Routing-Oblivious Network-Wide Measurements. IEEE/ACM Trans. Netw. 29(6): 2386-2398 (2021) - [c48]Jonatan Langlet, Ran Ben-Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro
Zero-CPU Collection with Direct Telemetry Access. HotNets 2021: 108-115 - [c47]Ran Ben Basat, Michael Mitzenmacher, Shay Vargaftik:
How to Send a Real Number Using a Single Bit (And Some Shared Randomness). ICALP 2021: 25:1-25:20 - [c46]Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik:
SALSA: Self-Adjusting Lean Streaming Analytics. ICDE 2021: 864-875 - [c45]Shay Vargaftik, Ran Ben-Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher:
DRIVE: One-bit Distributed Mean Estimation. NeurIPS 2021: 362-377 - [i27]Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik:
SALSA: Self-Adjusting Lean Streaming Analytics. CoRR abs/2102.12531 (2021) - [i26]Shay Vargaftik, Ran Ben Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher:
DRIVE: One-bit Distributed Mean Estimation. CoRR abs/2105.08339 (2021) - [i25]Shay Vargaftik, Ran Ben Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher:
Communication-Efficient Federated Learning via Robust Distributed Mean Estimation. CoRR abs/2108.08842 (2021) - [i24]Jonatan Langlet, Ran Ben Basat, Sivaramakrishnan Ramanathan, Gabriele Oliaro
Zero-CPU Collection with Direct Telemetry Access. CoRR abs/2110.05438 (2021) - 2020
- [j9]Ran Ben Basat
Designing Heavy-Hitter Detection Algorithms for Programmable Switches. IEEE/ACM Trans. Netw. 28(3): 1172-1185 (2020) - [c44]Ran Ben Basat, Maayan Goldstein, Itai Segall:
Learning Software Constraints via Installation Attempts. APOCS 2020: 60-74 - [c43]Jan Kucera
Detecting routing loops in the data plane. CoNEXT 2020: 466-473 - [c42]Valerio Bruschi, Ran Ben Basat, Zaoxing Liu, Gianni Antichi
DISCOvering the heavy hitters with disaggregated sketches. CoNEXT 2020: 536-537 - [c41]Ran Ben Basat, Gil Einziger, Bilal Tayh:
A faster and more efficient q-MAX algorithm. CoNEXT 2020: 538-539 - [c40]Ran Ben Basat, Gil Einziger, Bilal Tayh
Cooperative Network-wide Flow Selection. ICNP 2020: 1-11 - [c39]Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik:
Faster and More Accurate Measurement through Additive-Error Counters. INFOCOM 2020: 1251-1260 - [c38]Ran Ben Basat, Gil Einziger, Bilal Tayh
Near Optimal Network-wide Per-Flow Measurement. INFOCOM Workshops 2020: 1294-1295 - [c37]Ran Ben Basat, Xiaoqi Chen, Gil Einziger, Shir Landau Feibish, Danny Raz, Minlan Yu:
Routing Oblivious Measurement Analytics. Networking 2020: 449-457 - [c36]Ran Ben Basat, Gil Einziger, Maayan Goldstein, Liat Pele, Itai Segall:
Cost Effective Troubleshooting of NFV Infrastructure. Networking 2020: 686-694 - [c35]Ran Ben Basat, Sivaramakrishnan Ramanathan, Yuliang Li, Gianni Antichi
PINT: Probabilistic In-band Network Telemetry. SIGCOMM 2020: 662-680 - [c34]Nikita Ivkin, Ran Ben Basat, Zaoxing Liu, Gil Einziger, Roy Friedman, Vladimir Braverman:
I Know What You Did Last Summer: Network Monitoring using Interval Queries. SIGMETRICS (Abstracts) 2020: 61-62 - [c33]Muhammad Tirmazi, Ran Ben Basat, Jiaqi Gao
Cheetah: Accelerating Database Queries with Switch Pruning. SIGMOD Conference 2020: 2407-2422 - [i23]Muhammad Tirmazi, Ran Ben Basat, Jiaqi Gao, Minlan Yu:
Cheetah: Accelerating Database Queries with Switch Pruning. CoRR abs/2004.05076 (2020) - [i22]Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik:
Faster and More Accurate Measurement through Additive-Error Counters. CoRR abs/2004.10332 (2020) - [i21]Ran Ben Basat, Xiaoqi Chen, Gil Einziger, Shir Landau Feibish, Danny Raz, Minlan Yu:
Routing Oblivious Measurement Analytics. CoRR abs/2005.11542 (2020) - [i20]Ran Ben Basat, Sivaramakrishnan Ramanathan, Yuliang Li, Gianni Antichi, Minlan Yu, Michael Mitzenmacher:
PINT: Probabilistic In-band Network Telemetry. CoRR abs/2007.03731 (2020) - [i19]Ran Ben-Basat, Michael Mitzenmacher, Shay Vargaftik:
How to send a real number using a single bit (and some shared randomness). CoRR abs/2010.02331 (2020)
2010 – 2019
- 2019
- [j8]Ran Ben-Basat, Gil Einziger
Succinct Summing over Sliding Windows. Algorithmica 81(5): 2072-2091 (2019) - [j7]Nikita Ivkin, Ran Ben Basat, Zaoxing Liu, Gil Einziger, Roy Friedman, Vladimir Braverman:
I Know What You Did Last Summer: Network Monitoring using Interval Queries. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 61:1-61:28 (2019) - [j6]Ran Ben Basat, Gil Einziger, Roy Friedman:
Give me some slack: Efficient network measurements. Theor. Comput. Sci. 791: 87-108 (2019) - [j5]Ran Ben Basat, Xiaoqi Chen
Randomized Admission Policy for Efficient Top-k, Frequency, and Volume Estimation. IEEE/ACM Trans. Netw. 27(4): 1432-1445 (2019) - [c32]Ran Ben Basat, Gil Einziger, Junzhi Gong, Jalil Moraney, Danny Raz:
q-MAX: A Unified Scheme for Improving Network Measurement Throughput. Internet Measurement Conference 2019: 322-336 - [c31]Ran Ben Basat, Gil Einziger, Jalil Moraney, Danny Raz:
q-MAX: A Unified Way to Improve Network Measurement Throughput. INFOCOM Workshops 2019: 1011-1012 - [c30]Ran Ben Basat, Gil Einziger, Marcelo Caggiani Luizelli, Erez Waisbard:
A Black-box Method for Accelerating Measurement Algorithms with Accuracy Guarantees. Networking 2019: 1-9 - [c29]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. PODC 2019: 104-106 - [c28]Muhammad Tirmazi, Ran Ben-Basat, Jiaqi Gao, Minlan Yu:
Cheetah: Accelerating Database Queries with Switch Pruning. SIGCOMM Posters and Demos 2019: 72-74 - [c27]Nikita Ivkin, Ran Ben Basat, Zaoxing Liu, Gil Einziger, Roy Friedman, Vladimir Braverman:
Attack Time Localization using Interval Queries. SIGCOMM Posters and Demos 2019: 85-87 - [c26]Zaoxing Liu, Ran Ben-Basat, Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, Vyas Sekar:
Nitrosketch: robust and general sketch-based monitoring in software switches. SIGCOMM 2019: 334-350 - [c25]Ran Ben-Basat
Optimal Distributed Covering Algorithms. DISC 2019: 5:1-5:15 - [c24]Ran Ben-Basat
Parameterized Distributed Algorithms. DISC 2019: 6:1-6:16 - [i18]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. CoRR abs/1902.09377 (2019) - 2018
- [b1]Ran Ben Basat:
Big Data Methods for Efficient Network Monitoring. Technion - Israel Institute of Technology, Israel, 2018 - [j4]Ran Ben-Basat
Fast flow volume estimation. Pervasive Mob. Comput. 48: 101-117 (2018) - [j3]Ran Ben-Basat, Roy Friedman, Rana Shahout:
Stream Frequency Over Interval Queries. Proc. VLDB Endow. 12(4): 433-445 (2018) - [c23]Ran Ben-Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, Danny Raz:
Network-wide routing-oblivious heavy hitters. ANCS 2018: 66-73 - [c22]Ran Ben-Basat, Gil Einziger, Isaac Keslassy
Memento: making sliding windows efficient for heavy hitters. CoNEXT 2018: 254-266 - [c21]Ran Ben-Basat, Gil Einziger, Roy Friedman:
Brief Announcement: Give Me Some Slack: Efficient Network Measurements. ICALP 2018: 163:1-163:5 - [c20]Ran Ben-Basat, Gil Einziger, Roy Friedman:
Fast Flow Volume Estimation. ICDCN 2018: 44:1-44:10 - [c19]Ran Ben-Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich:
Efficient Measurement on Programmable Switches Using Probabilistic Recirculation. ICNP 2018: 313-323 - [c18]Ran Ben-Basat, Gil Einziger, Erez Waisbard:
Line speed heavy hitters on sliding windows. INFOCOM Workshops 2018: 1-2 - [c17]Ran Ben-Basat, Rana Shahout, Roy Friedman:
Frequent elements on query defined ranges. INFOCOM Workshops 2018: 1-2 - [c16]Eran Assaf, Ran Ben-Basat, Gil Einziger, Roy Friedman:
Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free. INFOCOM 2018: 2204-2212 - [c15]Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti
Approximate Query Processing over Static Sets and Sliding Windows. ISAAC 2018: 54:1-54:12 - [c14]Ran Ben-Basat, Gil Einziger, Roy Friedman, Marcelo Caggiani Luizelli, Erez Waisbard:
Volumetric Hierarchical Heavy Hitters. MASCOTS 2018: 381-392 - [c13]Ran Ben-Basat, Gil Einziger, Roy Friedman:
Give Me Some Slack: Efficient Network Measurements. MFCS 2018: 34:1-34:16 - [c12]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds. SIROCCO 2018: 226-236 - [c11]Ran Ben-Basat, Gil Einziger, Roy Friedman:
Space Efficient Elephant Flow Detection. SYSTOR 2018: 115 - [i17]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds. CoRR abs/1804.01308 (2018) - [i16]Ran Ben-Basat, Maayan Goldstein, Itai Segall:
Learning Software Constraints via Installation Attempts. CoRR abs/1804.08902 (2018) - [i15]Ran Ben-Basat, Roy Friedman, Rana Shahout:
Heavy Hitters over Interval Queries. CoRR abs/1804.10740 (2018) - [i14]Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Parameterized Distributed Algorithms. CoRR abs/1807.04900 (2018) - [i13]Ran Ben-Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich:
Efficient Measurement on Programmable Switches Using Probabilistic Recirculation. CoRR abs/1808.03412 (2018) - [i12]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Weighted Set Cover Approximation. CoRR abs/1808.05809 (2018) - [i11]Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate Query Processing over Static Sets and Sliding Windows. CoRR abs/1809.05419 (2018) - [i10]Ran Ben-Basat, Gil Einziger, Isaac Keslassy, Ariel Orda, Shay Vargaftik, Erez Waisbard:
Memento: Making Sliding Windows Efficient for Heavy Hitters. CoRR abs/1810.02899 (2018) - 2017
- [j2]Ran Ben-Basat, Moshe Tennenholtz, Oren Kurland:
A Game Theoretic Analysis of the Adversarial Retrieval Setting. J. Artif. Intell. Res. 60: 1127-1164 (2017) - [c10]Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Randomized admission policy for efficient top-k and frequency estimation. INFOCOM 2017: 1-9 - [c9]Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Optimal elephant flow detection. INFOCOM 2017: 1-9 - [c8]Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Poster abstract: A sliding counting bloom filter. INFOCOM Workshops 2017: 1012-1013 - [c7]Ran Ben-Basat, Gil Einziger, Roy Friedman, Marcelo Caggiani Luizelli, Erez Waisbard:
Constant Time Updates in Hierarchical Heavy Hitters. SIGCOMM 2017: 127-140 - [c6]Eran Assaf, Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Counting distinct elements over sliding windows. SYSTOR 2017: 22:1 - [i9]Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Optimal Elephant Flow Detection. CoRR abs/1701.04021 (2017) - [i8]Ran Ben-Basat, Gil Einziger, Roy Friedman:
Efficient Network Measurements through Approximated Windows. CoRR abs/1703.01166 (2017) - [i7]Ran Ben-Basat:
Succinct Approximate Rank Queries. CoRR abs/1704.07710 (2017) - [i6]Ran Ben-Basat, Gil Einziger, Roy Friedman, Marcelo Caggiani Luizelli, Erez Waisbard:
Constant Time Updates in Hierarchical Heavy Hitters. CoRR abs/1707.06778 (2017) - [i5]Ran Ben-Basat, Gil Einziger, Roy Friedman:
Fast Flow Volume Estimation. CoRR abs/1710.03155 (2017) - [i4]Eran Assaf, Ran Ben-Basat, Gil Einziger, Roy Friedman:
Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free. CoRR abs/1712.01779 (2017) - 2016
- [j1]Ran Ben-Basat
The k-distinct language: Parameterized automata constructions. Theor. Comput. Sci. 622: 1-15 (2016) - [c5]Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Heavy hitters in streams and sliding windows. INFOCOM 2016: 1-9 - [c4]Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Efficient Summing over Sliding Windows. SWAT 2016: 11:1-11:14 - [c3]Ran Ben-Basat, Elad Kravi:
The ranking game. WebDB 2016: 7 - [i3]Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Efficient Summing over Sliding Windows. CoRR abs/1604.02450 (2016) - [i2]Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner:
Randomized Admission Policy for Efficient Top-k and Frequency Estimation. CoRR abs/1612.02962 (2016) - 2015
- [c2]Ran Ben-Basat, Moshe Tennenholtz, Oren Kurland:
The Probability Ranking Principle is Not Optimal in Adversarial Retrieval Settings. ICTIR 2015: 51-60 - 2014
- [c1]Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi
The k -Distinct Language: Parameterized Automata Constructions. IPEC 2014: 85-96 - [i1]Ran Ben-Basat, Ariel Gabizon:
Relations between automata and the simple k-path problem. CoRR abs/1401.5707 (2014)
Coauthor Index
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 2024-10-07 21:20 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 and maintained by:
the dblp computer science bibliography is funded and supported by: