default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalaji Prabhakar
Person information
- affiliation: Stanford University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j29]Jinkun Geng
, Anirudh Sivaraman, Balaji Prabhakar, Mendel Rosenblum:
Nezha: Deployable and High-Performance Consensus Using Synchronized Clocks. Proc. VLDB Endow. 16(4): 629-642 (2022)- [i8]Jinkun Geng, Anirudh Sivaraman, Balaji Prabhakar, Mendel Rosenblum:
Nezha: Deployable and High-Performance Consensus Using Synchronized Clocks. CoRR abs/2206.03285 (2022) - 2021
- [c68]Ahmad Ghalayini, Jinkun Geng, Vighnesh Sachidananda, Vinay Sriram, Yilong Geng, Balaji Prabhakar, Mendel Rosenblum, Anirudh Sivaraman:
CloudEx: a fair-access financial exchange in the cloud. HotOS 2021: 96-103 - [c67]Shiyu Liu, Ahmad Ghalayini, Mohammad Alizadeh, Balaji Prabhakar, Mendel Rosenblum, Anirudh Sivaraman:
Breaking the Transience-Equilibrium Nexus: A New Approach to Datacenter Packet Transport. NSDI 2021: 47-63 - 2020
- [c66]Sean Choi, Muhammad Shahbaz, Balaji Prabhakar, Mendel Rosenblum:
λ-NIC: Interactive Serverless Compute on Programmable SmartNICs. ICDCS 2020: 67-77
2010 – 2019
- 2019
- [c65]Sean Choi, Seo Jin Park, Muhammad Shahbaz, Balaji Prabhakar, Mendel Rosenblum:
Toward Scalable Replication Systems with Predictable Tails Using Programmable Data Planes. APNet 2019: 78-84 - [c64]Yilong Geng, Shiyu Liu, Zi Yin, Ashish Naik, Balaji Prabhakar, Mendel Rosenblum, Amin Vahdat:
SIMON: A Simple and Scalable Method for Sensing, Inference and Measurement in Data Center Networks. NSDI 2019: 549-564 - [c63]Sean Choi, Muhammad Shahbaz, Balaji Prabhakar, Mendel Rosenblum:
λ-NIC: Interactive Serverless Compute on SmartNICs. SIGCOMM Posters and Demos 2019: 151-152 - [i7]Sean Choi, Muhammad Shahbaz, Balaji Prabhakar, Mendel Rosenblum:
λ-NIC: Interactive Serverless Compute on Programmable SmartNICs. CoRR abs/1909.11958 (2019) - 2018
- [c62]Zi Yin, Vin Sachidananda, Balaji Prabhakar:
The Global Anchor Method for Quantifying Linguistic Shifts and Domain Adaptation. NeurIPS 2018: 9434-9445 - [c61]Yilong Geng, Shiyu Liu, Zi Yin, Ashish Naik, Balaji Prabhakar, Mendel Rosenblum, Amin Vahdat:
Exploiting a Natural Network Effect for Scalable, Fine-grained Clock Synchronization. NSDI 2018: 81-94 - [i6]Zi Yin, Vin Sachidananda, Balaji Prabhakar:
The Global Anchor Method for Quantifying Linguistic Shifts and Domain Adaptation. CoRR abs/1812.10382 (2018) - 2017
- [c60]Yilong Geng, Shiyu Liu, Feiran Wang, Zi Yin, Balaji Prabhakar, Mendel Rosenblum:
Self-programming networks: Architecture and algorithms. Allerton 2017: 745-752 - [c59]Chenguang Zhu, Balaji Prabhakar:
Reducing inefficiencies in taxi systems. CDC 2017: 6301-6306 - [i5]Hossein Karkeh Abadi, Balaji Prabhakar:
Stable Matchings in Metric Spaces: Modeling Real-World Preferences using Proximity. CoRR abs/1710.05262 (2017) - 2015
- [c58]Chenguang Zhu, Hossein Karkeh Abadi, Balaji Prabhakar:
Polling one's friends: A graph theoretic view. Allerton 2015: 43-50 - [c57]Balaji Prabhakar:
A Big Data System for the Internet of Moving Things. FCRC 2015: 7 - [c56]Balaji Prabhakar:
A Big Data Dashboard for Urban Mobility. SCSE 2015: 7-8 - 2014
- [c55]Chinmoy Mandayam, Balaji Prabhakar:
Traffic congestion: models, costs and optimal transport. SIGMETRICS 2014: 553-554 - 2013
- [c54]Chinmoy Mandayam, Balaji Prabhakar:
Road traffic networks: Optimal transport and incentives. Allerton 2013: 1090-1097 - [c53]Vimalkumar Jeyakumar, Mohammad Alizadeh, David Mazières, Balaji Prabhakar, Albert G. Greenberg, Changhoon Kim:
EyeQ: Practical Network Performance Isolation at the Edge. NSDI 2013: 297-311 - [c52]Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, Scott Shenker:
pFabric: minimal near-optimal datacenter transport. SIGCOMM 2013: 435-446 - [c51]Balaji Prabhakar:
Designing large-scale nudge engines. SIGMETRICS 2013: 1-2 - 2012
- [j28]Balaji Prabhakar, Katherine N. Dektar, Deborah M. Gordon:
The Regulation of Ant Colony Foraging Activity without Spatial Information. PLoS Comput. Biol. 8(8) (2012) - [j27]Maury Bramson, Yi Lu, Balaji Prabhakar:
Asymptotic independence of queues under randomized load balancing. Queueing Syst. Theory Appl. 71(3): 247-292 (2012) - [c50]Balaji Prabhakar, Katherine N. Dektar, Deborah M. Gordon:
Anternet: The regulation of harvester ant foraging and Internet congestion control. Allerton Conference 2012: 1355-1359 - [c49]Mohammad Al-Fares, Rishi Kapoor, George Porter, Sambit Das, Hakim Weatherspoon, Balaji Prabhakar, Amin Vahdat:
NetBump: user-extensible active queue management with bumps on the wire. ANCS 2012: 61-72 - [c48]Naini Gomes, Deepak Merugu, Gearóid O'Brien, Chinmoy Mandayam, Jia Shuo Yue, Berk Atikoglu, Adrian Albert, Norihiro Fukumoto, Huan Liu, Balaji Prabhakar, Damon Wischik:
Steptacular: An incentive mechanism for promoting wellness. COMSNETS 2012: 1-6 - [c47]Vimalkumar Jeyakumar, Mohammad Alizadeh, David Mazières, Balaji Prabhakar, Changhoon Kim:
EyeQ: Practical Network Performance Isolation for the Multi-tenant Cloud. HotCloud 2012 - [c46]Mohammad Alizadeh, Shuang Yang, Sachin Katti, Nick McKeown, Balaji Prabhakar, Scott Shenker:
Deconstructing datacenter packet transport. HotNets 2012: 133-138 - [c45]Mohammad Alizadeh, Abdul Kabbani, Tom Edsall, Balaji Prabhakar, Amin Vahdat, Masato Yasuda:
Less Is More: Trading a Little Bandwidth for Ultra-Low Latency in the Data Center. NSDI 2012: 253-266 - 2011
- [c44]Mohammad Alizadeh, Abdul Kabbani, Berk Atikoglu, Balaji Prabhakar:
Stability analysis of QCN: the averaging principle. SIGMETRICS 2011: 49-60 - [c43]Mohammad Alizadeh, Adel Javanmard, Balaji Prabhakar:
Analysis of DCTCP: stability, convergence, and fairness. SIGMETRICS 2011: 73-84 - [i4]Maury Bramson, Yi Lu, Balaji Prabhakar:
Decay of Tails at Equilibrium for FIFO Join the Shortest Queue Networks. CoRR abs/1106.4582 (2011) - 2010
- [c42]Abdul Kabbani, Mohammad Alizadeh, Masato Yasuda, Rong Pan, Balaji Prabhakar:
AF-QCN: Approximate Fairness with Quantized Congestion Notification for Multi-tenanted Data Centers. Hot Interconnects 2010: 58-65 - [c41]Mohammad Alizadeh, Albert G. Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, Murari Sridharan:
Data center TCP (DCTCP). SIGCOMM 2010: 63-74 - [c40]Maury Bramson, Yi Lu, Balaji Prabhakar:
Randomized load balancing with general service time distributions. SIGMETRICS 2010: 275-286
2000 – 2009
- 2009
- [c39]Yi Lu, Balaji Prabhakar:
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture. INFOCOM 2009: 522-530 - 2008
- [c38]Yi Lu, Andrea Montanari, Balaji Prabhakar:
Counter Braids: Asymptotic optimality of the message passing decoding algorithm. Allerton 2008: 209-216 - [c37]Rong Pan, Balaji Prabhakar, Flavio Bonomi, Bob Olsen:
Approximate fair bandwidth allocation: A method for simple and flexible traffic management. Allerton 2008: 1081-1085 - [c36]Mohammad Alizadeh, Berk Atikoglu, Abdul Kabbani, Ashvin Lakshmikantha, Rong Pan, Balaji Prabhakar, Mick Seaman:
Data center transport mechanisms: Congestion control theory and IEEE standardization. Allerton 2008: 1270-1277 - [c35]Yi Lu, Andrea Montanari, Balaji Prabhakar:
Counter Braids. ITW 2008: 220-221 - [c34]Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang Dharmapurikar, Abdul Kabbani:
Counter braids: a novel counter architecture for per-flow measurement. SIGMETRICS 2008: 121-132 - 2007
- [c33]Yi Lu, Mei Wang, Balaji Prabhakar, Flavio Bonomi:
ElephantTrap: A low cost device for identifying large flows. Hot Interconnects 2007: 99-108 - [c32]Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma:
Iterative Scheduling Algorithms. INFOCOM 2007: 445-453 - [c31]Amin Firoozshahian, Vahideh H. Manshadi, Ashish Goel, Balaji Prabhakar:
Efficient, Fully Local Algorithms for CIOQ Switches. INFOCOM 2007: 2491-2495 - [i3]Yi Lu, Andrea Montanari, Balaji Prabhakar:
Detailed Network Measurements Using Sparse Graph Counters: The Theory. CoRR abs/0710.0658 (2007) - 2006
- [j26]Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, R. Srikant, Donald F. Towsley, Raymond W. Yeung:
Introduction to the special issue on networking and information theory. IEEE Trans. Inf. Theory 52(6): 2285-2288 (2006) - [j25]Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah:
Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6): 2508-2530 (2006) - [j24]Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah:
Optimal throughput-delay scaling in wireless networks: part I: the fluid model. IEEE Trans. Inf. Theory 52(6): 2568-2592 (2006) - [j23]Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah:
Optimal Throughput-Delay Scaling in Wireless Networks - Part II: Constant-Size Packets. IEEE Trans. Inf. Theory 52(11): 5111-5116 (2006) - [j22]Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, R. Srikant, Donald F. Towsley, Raymond W. Yeung:
Introduction to the special issue on networking and information theory. IEEE/ACM Trans. Netw. 14(4): 674 (2006) - [c30]Yi Lu, Balaji Prabhakar, Flavio Bonomi:
Perfect Hashing for Network Applications. ISIT 2006: 2774-2778 - [i2]Chandra Nair, Balaji Prabhakar, Devavrat Shah:
On entropy for mixtures of discrete and continuous variables. CoRR abs/cs/0607075 (2006) - 2005
- [j21]Konstantinos Psounis, Pablo Molinero-Fernández, Balaji Prabhakar, Fragkiskos Papadopoulos:
Systems with multiple servers under heavy-tailed workloads. Perform. Evaluation 62(1-4): 456-474 (2005) - [j20]Rong Pan, Balaji Prabhakar, Konstantinos Psounis, Damon Wischik:
SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation. IEEE/ACM Trans. Netw. 13(5): 975-988 (2005) - [c29]Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah:
Mixing Times for Random Walks on Geometric Random Graphs. ALENEX/ANALCO 2005: 240-249 - [c28]Balaji Prabhakar:
Network Hardware Algorithms (Keynote). CollaborateCom 2005 - [c27]Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah:
Gossip algorithms: design, analysis and applications. INFOCOM 2005: 1653-1664 - [c26]Vivek F. Farias, Ciamac C. Moallemi, Balaji Prabhakar:
Load balancing with migration penalties. ISIT 2005: 558-562 - [c25]Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah:
Throughput-delay scaling in wireless networks with constant-size packets. ISIT 2005: 1329-1333 - [i1]Andrea Montanari, Balaji Prabhakar, David Tse:
Belief Propagation Based Multi--User Detection. CoRR abs/cs/0510044 (2005) - 2004
- [j19]Konstantinos Psounis, An Zhu, Balaji Prabhakar, Rajeev Motwani:
Modeling correlations in web traces and implications for designing replacement policies. Comput. Networks 45(4): 379-398 (2004) - [j18]Paolo Giaccone, Emilio Leonardi, Balaji Prabhakar, Devavrat Shah:
Delay bounds for combined input-output switches with low speedup. Perform. Evaluation 55(1-2): 113-128 (2004) - [j17]Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd:
Near-optimal depth-constrained codes. IEEE Trans. Inf. Theory 50(12): 3294-3298 (2004) - [c24]Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah:
Analysis and optimization of randomized gossip algorithms. CDC 2004: 5310-5315 - [c23]Mayank Sharma, Dina Katabi, Rong Pan, Balaji Prabhakar:
An in-band easy-to-deploy mechanism for network-to-transport signaling. GLOBECOM 2004: 1278-1283 - [c22]Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah:
Throughput-Delay Trade-off in Wireless Networks. INFOCOM 2004 - [c21]Chandra Nair, Balaji Prabhakar, Mayank Sharma:
A new proof of Parisi's conjecture for the finite random assignment problem. ISIT 2004: 61 - [c20]Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah:
Throughput-delay trade-off in energy constrained wireless networks. ISIT 2004: 439 - 2003
- [j16]Konstantinos Psounis, Rong Pan, Balaji Prabhakar, Damon Wischik:
The scaling hypothesis: simplifying the prediction of network performance using scaled-down simulations. Comput. Commun. Rev. 33(1): 35-40 (2003) - [j15]Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker:
Approximate fairness through differential dropping. Comput. Commun. Rev. 33(2): 23-39 (2003) - [j14]Kevin Leyton-Brown, Ryan Porter, Balaji Prabhakar, Yoav Shoham, Shobha Venkataraman:
Incentive mechanisms for smoothing out a focused demand for network resources. Comput. Commun. 26(3): 237-250 (2003) - [j13]Paolo Giaccone, Balaji Prabhakar, Devavrat Shah:
Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE J. Sel. Areas Commun. 21(4): 546-559 (2003) - [j12]Rong Pan, Balaji Prabhakar, Lee Breslau, Scott Shenker:
Approximate Fair Allocation of Link Bandwidth. IEEE Micro 23(1): 36-43 (2003) - [j11]Balaji Prabhakar, Robert G. Gallager:
Entropy and the timing capacity of discrete queues. IEEE Trans. Inf. Theory 49(2): 357-370 (2003) - [c19]Chandra Nair, Balaji Prabhakar, Mayank Sharma:
Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem. FOCS 2003: 168-178 - [c18]Rong Pan, Balaji Prabhakar, Konstantinos Psounis, Damon Wischik:
SHRiNK: A method for scaleable performance prediction and efficient network simulation. INFOCOM 2003: 1943-1953 - 2002
- [j10]Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker:
Approximate fairness through differential dropping (summary). Comput. Commun. Rev. 32(1): 72 (2002) - [j9]Devavrat Shah, Paolo Giaccone, Balaji Prabhakar:
Efficient Randomized Algorithms for Input-Queued Switch Scheduling. IEEE Micro 22(1): 10-18 (2002) - [j8]Paolo Giaccone, Devavrat Shah, Balaji Prabhakar:
An Implementable Parallel Scheduler for Input-Queued Switches. IEEE Micro 22(1): 19-25 (2002) - [j7]Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown:
Maintaining Statistics Counters in Router Line Cards. IEEE Micro 22(1): 76-81 (2002) - [j6]Konstantinos Psounis, Balaji Prabhakar:
Efficient randomized web-cache replacement schemes using samples from past eviction times. IEEE/ACM Trans. Netw. 10(4): 441-455 (2002) - [j5]Elif Uysal-Biyikoglu, Balaji Prabhakar, Abbas El Gamal:
Energy-eficient packet transmission over a wireless link. IEEE/ACM Trans. Netw. 10(4): 487-499 (2002) - [c17]Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah:
Load Balancing with Memory. FOCS 2002: 799-808 - [c16]Elif Uysal-Biyikoglu, Abbas El Gamal, Balaji Prabhakar:
Adaptive transmission of variable-rate data over a fading channel for energy-efficiency. GLOBECOM 2002: 97-101 - [c15]Paolo Giaccone, Emilio Leonardi, Balaji Prabhakar, Devavrat Shah:
Delay performance of high-speed packet switches with low speedup. GLOBECOM 2002: 2629-2633 - [c14]Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker:
A Flow Table-Based Design to Approximate Fairness. Hot Interconnects 2002: 37-42 - [c13]Paolo Giaccone, Balaji Prabhakar, Devavrat Shah:
Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches. INFOCOM 2002: 1160-1169 - [c12]Chandra Nair, Abbas El Gamal, Balaji Prabhakar, Elif Uysal-Biyikoglu, Sina Zahedi:
Energy-efficient Scheduling of Packet Transmissions over Wireless Networks. INFOCOM 2002: 1773-1782 - 2001
- [j4]Konstantinos Psounis, Rong Pan, Balaji Prabhakar:
Approximate Fair Dropping for Variable-Length Packets. IEEE Micro 21(1): 48-56 (2001) - [c11]Devavrat Shah, Paolo Giaccone, Balaji Prabhakar:
An efficient randomized algorithm for input-queued switch scheduling. Hot Interconnects 2001: 3-8 - [c10]Paolo Giaccone, Devavrat Shah, Balaji Prabhakar:
An implementable parallel scheduler for input-queued switches. Hot Interconnects 2001: 9-14 - [c9]Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown:
Analysis of a statistics counter architecture. Hot Interconnects 2001: 107-111 - [c8]Balaji Prabhakar, Elif Uysal-Biyikoglu, Abbas El Gamal:
Energy-efficient Transmission over a Wireless Link via Lazy Packet Scheduling. INFOCOM 2001: 386-394 - [c7]Konstantinos Psounis, Balaji Prabhakar:
A Randomized Web-Cache Replacement Scheme. INFOCOM 2001: 1407-1415 - [c6]Kevin Leyton-Brown, Ryan Porter, Shobha Venkataraman, Balaji Prabhakar:
Smoothing out focused demand for network resources. EC 2001: 245-248 - 2000
- [c5]Jim G. Dai, Balaji Prabhakar:
The Throughput of Data Switches with and without Speedup. INFOCOM 2000: 556-564 - [c4]Rong Pan, Balaji Prabhakar, Konstantinos Psounis:
CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation. INFOCOM 2000: 942-951 - [c3]Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd:
Near Optimal Routing Lookups with Bounded Worst Case Performance. INFOCOM 2000: 1184-1192
1990 – 1999
- 1999
- [j3]Balaji Prabhakar, Nick McKeown:
On the speedup required for combined input- and output-queued switching. Autom. 35(12): 1909-1920 (1999) - [j2]Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaji Prabhakar:
Matching output queueing with a combined input/output-queued switch. IEEE J. Sel. Areas Commun. 17(6): 1030-1039 (1999) - [c2]Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaji Prabhakar:
Matching Output Queueing with a Combined Input Output Queued Switch. INFOCOM 1999: 1169-1178 - 1997
- [j1]Balaji Prabhakar, Nick McKeown, Ritesh Ahuja:
Multicast Scheduling for Input-Queued Switches. IEEE J. Sel. Areas Commun. 15(5): 855-866 (1997) - 1996
- [c1]Nick McKeown, Balaji Prabhakar:
Scheduling Multicast Cells in an Input-Queued Switch. INFOCOM 1996: 271-278
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-04-24 22:47 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:
