default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Lennart Johnsson
Person information
- affiliation: University of Houston, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c54]Suyash Bakshi, S. Lennart Johnsson:
Analysis of Factors Affecting Power Consumption and Energy Efficiency of SGEMM on the Low-Power Myriad-2 VPU. ISPASS 2021: 76-78- [i2]Nazanin Beheshti, S. Lennart Johnsson:
Using CNNs for AD classification based on spatial correlation of BOLD signals during the observation. CoRR abs/2104.10596 (2021) - 2020
- [c53]Nazanin Beheshti, S. Lennart Johnsson:
Squeeze U-Net: A Memory and Energy Efficient Image Segmentation Network. CVPR Workshops 2020: 1495-1504 - [c52]Ünal Sakoglu, Lohit Bhupati, Nazanin Beheshti, Nikolaos Tsekos, S. Lennart Johnsson:
An Adaptive Space-Filling Curve Trajectory for Ordering 3D Datasets to 1D: Application to Brain Magnetic Resonance Imaging Data for Classification. ICCS (3) 2020: 635-646 - [c51]Suyash Bakshi, S. Lennart Johnsson:
A Highly Efficient SGEMM Implementation using DMA on the Intel/Movidius Myriad-2. SBAC-PAD 2020: 321-328
2010 – 2019
- 2019
- [j41]Carlos Ordonez, Yiqun Zhang, S. Lennart Johnsson:
Scalable machine learning computing a data summarization matrix with a parallel array DBMS. Distributed Parallel Databases 37(3): 329-350 (2019) - 2018
- [j40]Justin Chang
, K. B. Nakshatrala, Matthew G. Knepley, S. Lennart Johnsson:
A performance spectrum for parallel computational frameworks that solve PDEs. Concurr. Comput. Pract. Exp. 30(11) (2018) - 2017
- [c50]Yiqun Zhang, Carlos Ordonez, S. Lennart Johnsson:
A Cloud System for Machine Learning Exploiting a Parallel Array DBMS. DEXA Workshops 2017: 22-26 - [i1]Justin Chang, K. B. Nakshatrala, Matthew G. Knepley, S. Lennart Johnsson:
A performance spectrum for parallel computational frameworks that solve PDEs. CoRR abs/1705.03625 (2017) - 2016
- [c49]Yan Liu, Yun Li, S. Lennart Johnsson, Andrew A. Chien:
Lifetime and Deployment Limits for Mobile, 3D-Perceptual Applications. HCI (10) 2016: 319-329 - 2014
- [c48]Gilbert Netzer, S. Lennart Johnsson, Daniel Ahlin, Eric Stotzer, Pekka Varis, Erwin Laure:
Exploiting DMA for Performance and Energy Optimized STREAM on a DSP. IPDPS Workshops 2014: 805-814 - [c47]Gilbert Netzer, S. Lennart Johnsson, Daniel Ahlin, Erwin Laure:
Instrumentation for accurate energy-to-solution measurements of a texas instruments TMS320C6678 digital signal processor and its DDR3 memory. E2SC@SC 2014: 89-98 - 2012
- [r1]S. Lennart Johnsson:
Overview of Data Centers Energy Efficiency Evolution. Handbook of Energy-Aware and Green Computing 2012: 983-1028 - 2010
- [c46]S. Lennart Johnsson, Daniel Ahlin, John Wang:
The SNIC/KTH PRACE prototype: Achieving high energy efficiency with commodity technology without acceleration. Green Computing Conference 2010: 87-95
2000 – 2009
- 2008
- [j39]Peter Gardfjäll, Erik Elmroth, S. Lennart Johnsson, Olle Mulmo, Thomas Sandholm:
Scalable Grid-wide capacity allocation with the SweGrid Accounting System (SGAS). Concurr. Comput. Pract. Exp. 20(18): 2089-2122 (2008) - [j38]Jakub Kurzak, Dragan Mirkovic, B. Montgomery Pettitt, S. Lennart Johnsson:
Automatic Generation of FFT for Translations of Multipole Expansions in Spherical Harmonics. Int. J. High Perform. Comput. Appl. 22(2): 219-230 (2008) - 2007
- [c45]Chen Feng, Catherine Putonti, Michael Quance, Stephen Huff, Andrey Belokrylov, S. Lennart Johnsson, Krishna Jayaraman, Michael Hogan, Yuriy Fofanov:
Developing Assays for the Detection of Influenza in Human Samples. BIOCOMP 2007: 781- - [c44]Mehran Ahsant, Jim Basney, S. Lennart Johnsson:
Dynamic, context-aware, least-privilege grid delegation. GRID 2007: 209-216 - [c43]Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok:
Adaptive Computation of Self Sorting In-Place FFTs on Hierarchical Memory Architectures. HPCC 2007: 372-383 - [c42]Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok:
Scheduling FFT computation on SMP and multicore systems. ICS 2007: 293-301 - 2006
- [j37]Thomas Sandholm, Peter Gardfjäll, Erik Elmroth, Olle Mulmo, S. Lennart Johnsson:
A Service-Oriented Approach to Enforce Grid Resource Allocations. Int. J. Cooperative Inf. Syst. 15(3): 439-459 (2006) - [c41]Catherine Putonti, Meizhuo Zhang, S. Lennart Johnsson, Yuriy Fofanov:
Two Challenges in Genomics That Can Benefit from Petascale Platforms. Euro-Par Workshops 2006: 313-322 - [c40]Mehran Ahsant, Jim Basney, Olle Mulmo, Adam J. Lee, S. Lennart Johnsson:
Toward an On-Demand Restricted Delegation Mechanism for Grids. GRID 2006: 152-159 - 2005
- [j36]Francine Berman, Henri Casanova, Andrew A. Chien, Keith D. Cooper, Holly Dail, Anshuman Dasgupta, W. Deng, Jack J. Dongarra, S. Lennart Johnsson, Ken Kennedy, Charles Koelbel, Bo Liu, Xin Liu, Anirban Mandal, Gabriel Marin, Mark Mazina, John M. Mellor-Crummey, Celso L. Mendes, Alex Olugbile, M. Patel, Daniel A. Reed, Zhiao Shi, Otto Sievert, Huaxia Xia, Asim YarKhan:
New Grid Scheduling and Rescheduling Methods in the GrADS Project. Int. J. Parallel Program. 33(2-3): 209-229 (2005) - [c39]Anirban Mandal, Ken Kennedy, Charles Koelbel, Gabriel Marin, John M. Mellor-Crummey, Bo Liu, S. Lennart Johnsson:
Scheduling strategies for mapping application workflows onto the grid. HPDC 2005: 125-134 - 2004
- [j35]Dragan Mirkovic, S. Lennart Johnsson:
Automatic Performance Tuning for Fast Fourier Transforms. Int. J. High Perform. Comput. Appl. 18(1): 47-64 (2004) - [c38]Anirban Mandal, Anshuman Dasgupta, Ken Kennedy, Mark Mazina, Charles Koelbel, Gabriel Marin, Keith D. Cooper, John M. Mellor-Crummey, Bo Liu, S. Lennart Johnsson:
Scheduling workflow applications in GrADS. CCGRID 2004: 790-797 - [c37]Thomas Sandholm, Peter Gardfjäll, Erik Elmroth, S. Lennart Johnsson, Olle Mulmo:
An OGSA-based accounting system for allocation enforcement across HPC centers. ICSOC 2004: 279-288 - [c36]Keith D. Cooper, Anshuman Dasgupta, Ken Kennedy, Charles Koelbel, Anirban Mandal, Gabriel Marin, Mark Mazina, John M. Mellor-Crummey, Francine Berman, Henri Casanova, Andrew A. Chien, Holly Dail, Xin Liu, Alex Olugbile, Otto Sievert, Huaxia Xia, S. Lennart Johnsson, Bo Liu, M. Patel, Daniel A. Reed, W. Deng, Celso L. Mendes, Zhiao Shi, Asim YarKhan, Jack J. Dongarra:
New Grid Scheduling and Rescheduling Methods in the GrADS Project. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004 - 2003
- [c35]Dragan Mirkovic, S. Lennart Johnsson:
CODELAB: A Developers' Tool for Efficient Code Generation and Optimization. International Conference on Computational Science 2003: 729-738 - 2002
- [c34]Ken Kennedy, Mark Mazina, John M. Mellor-Crummey, Keith D. Cooper, Linda Torczon, Francine Berman, Andrew A. Chien, Holly Dail, Otto Sievert, Dave Angulo, Ian T. Foster, Ruth A. Aydt, Daniel A. Reed, Dennis Gannon, S. Lennart Johnsson, Carl Kesselman, Jack J. Dongarra, Sathish S. Vadhiyar, Richard Wolski:
Toward a Framework for Preparing and Executing Adaptive Grid Programs. IPDPS 2002 - 2001
- [j34]Francine Berman, Andrew A. Chien, Keith D. Cooper, Jack J. Dongarra, Ian T. Foster, Dennis Gannon, S. Lennart Johnsson, Ken Kennedy, Carl Kesselman, John M. Mellor-Crummey, Daniel A. Reed, Linda Torczon, Richard Wolski:
The GrADS Project: Software Support for High-Level Grid Application Development. Int. J. High Perform. Comput. Appl. 15(4): 327-344 (2001) - [j33]Ken Kennedy, Bradley Broom, Keith D. Cooper, Jack J. Dongarra, Robert J. Fowler, Dennis Gannon, S. Lennart Johnsson, John M. Mellor-Crummey, Linda Torczon:
Telescoping Languages: A Strategy for Automatic Generation of Scientific Problem-Solving Systems from Annotated Libraries. J. Parallel Distributed Comput. 61(12): 1803-1826 (2001) - 2000
- [j32]Y. Charlie Hu, Guohua Jin, S. Lennart Johnsson, Dimitris Kehagias, Nadia Shalaby:
HPFBench: a high performance Fortran benchmark suite. ACM Trans. Math. Softw. 26(1): 99-149 (2000) - [c33]Dragan Mirkovic, Rishad Mahasoom, S. Lennart Johnsson:
An adaptive software library for fast Fourier transforms. ICS 2000: 215-224
1990 – 1999
- 1999
- [j31]Michael Feig, Matin Abdullah, S. Lennart Johnsson, B. Montgomery Pettitt:
Large scale distributed data repository: design of a molecular dynamics trajectory database. Future Gener. Comput. Syst. 16(1): 101-110 (1999) - [j30]Olle Larsson, Michael Feig, S. Lennart Johnsson:
Some Metacomputing Experiences for Scientific Applications. Parallel Process. Lett. 9(2): 243-252 (1999) - 1997
- [c32]Y. Charlie Hu, S. Lennart Johnsson, Dimitris Kehagias, Nadia Shalaby:
DPF: A Data Parallel Fortran Benchmark Suite. IPPS 1997: 219-226 - [c31]Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng:
High Performance FORTRAN for Highly Unstructured Problems. PPoPP 1997: 13-24 - [c30]Y. Charlie Hu, S. Lennart Johnsson:
On the Accuracy of Anderson's Fast N-body Algorithm. PP 1997 - [c29]Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng:
A Data-Parallel Adaptive N-body Method. PP 1997 - [c28]Y. Charlie Hu, Shang-Hua Teng, S. Lennart Johnsson:
A Data-Parallel Implementation of the Geometric Partitioning Algorithm. PP 1997 - [c27]Nadia Shalaby, S. Lennart Johnsson:
Hierarchical Load Balancing for Parallel Fast Legendre Transforms. PP 1997 - 1996
- [j29]Yu Hu, S. Lennart Johnsson:
A Data-Parallel Implementation of Hierarchical N-Body Methods. Int. J. High Perform. Comput. Appl. 10(1): 3-40 (1996) - [j28]David Kramer, S. Lennart Johnsson, Yu Hu:
Local Basic Linear Algebra Subroutines (LBLAS) for the CM-5/5E. Int. J. High Perform. Comput. Appl. 10(4): 300-335 (1996) - [j27]Yu Hu, S. Lennart Johnsson:
Implementing O(N) N-Body Algorithms Efficiently in Data-Parallel Languages. Sci. Program. 5(4): 337-364 (1996) - [c26]Yu Hu, S. Lennart Johnsson:
A Data-Parallel Implementation of O(N) Hierarchical N-Body Methods. SC 1996: 2 - 1995
- [j26]Kapil K. Mathur, S. Lennart Johnsson:
All-to-All Communication on the Connection Machine CM-200. Sci. Program. 4(4): 251-273 (1995) - [j25]S. Lennart Johnsson, Ching-Tien Ho:
On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes. IEEE Trans. Computers 44(1): 47-53 (1995) - [c25]Ted Nesson, S. Lennart Johnsson:
ROMM Routing on Mesh and Torus Networks. SPAA 1995: 275-287 - 1994
- [j24]S. Lennart Johnsson, Ching-Tien Ho:
Optimal communication channel utilization for matrix transposition and related permutations on binary cubes. Discret. Appl. Math. 53(1-3): 251-274 (1994) - [j23]Ching-Tien Ho, S. Lennart Johnsson:
Embedding hyperpyramids into hypercubes. IBM J. Res. Dev. 38(1): 31-46 (1994) - [j22]Ching-Tien Ho, M. T. Raghunath, S. Lennart Johnsson:
An Efficient Algorithms for Gray-to-Binary Permutation on Hypercubes. J. Parallel Distributed Comput. 20(1): 114-120 (1994) - [j21]S. Lennart Johnsson, Ching-Tien Ho:
Binary Cube Emulation of Butterfly Networks Encoded by Grad Code. J. Parallel Distributed Comput. 20(3): 261-279 (1994) - [j20]Kapil K. Mathur, S. Lennart Johnsson:
Multiplication of Matrices of Arbitrary Shape on a Data Parallel Computer. Parallel Comput. 20(7): 919-951 (1994) - [j19]William George, Ralph G. Brickner, S. Lennart Johnsson:
POLYSHIFT Communications Software for the Connection Machine System CM-200. Sci. Program. 3(1): 83-99 (1994) - [j18]Alan Edelman, Steve Heller, S. Lennart Johnsson:
Index Transformation Algorithms in a Linear Algebra Framework. IEEE Trans. Parallel Distributed Syst. 5(12): 1302-1309 (1994) - [c24]Zdenek Johan, Kapil K. Mathur, S. Lennart Johnsson, Thomas J. R. Hughes:
Mesh Decomposition and Communication Procedures for Finite Element Applications on the Connection Machine CM-5 System. HPCN 1994: 233-240 - [c23]S. Lennart Johnsson, Kapil K. Mathur:
Scientific Software Libraries for Scalable. PARA 1994: 318-332 - [c22]Ted Nesson, S. Lennart Johnsson:
ROMM Routing: A Class of Efficient Minimal Routing Algorithms. PCRCW 1994: 185-199 - 1993
- [j17]S. Lennart Johnsson:
Minimizing the Communication Time for Matrix Multiplication on Multiprocessors. Parallel Comput. 19(11): 1235-1257 (1993) - [j16]Woody Lichtenstein, S. Lennart Johnsson:
Block-Cyclic Dense Linear Algebra. SIAM J. Sci. Comput. 14(6): 1259-1288 (1993) - [c21]S. Lennart Johnsson:
The Connection Machine Systems CM-5. SPAA 1993: 365-366 - 1992
- [j15]Jean-Philippe Brunet, S. Lennart Johnsson:
All-To-All Broadcast and Applications On the Connection Machine. Int. J. High Perform. Comput. Appl. 6(3): 241-256 (1992) - [j14]S. Lennart Johnsson, Luis F. Ortiz:
Local Basic Linear Algebra Subroutines (Lblas) for Distributed Memory Architectures and Languages With Array Syntax. Int. J. High Perform. Comput. Appl. 6(4): 322-350 (1992) - [j13]S. Lennart Johnsson, Ching-Tien Ho:
Generalized Shuffle Permutations on Boolean Cubes. J. Parallel Distributed Comput. 16(1): 1-14 (1992) - [j12]S. Lennart Johnsson, Robert L. Krawitz:
Cooley-Tukey FFT on the Connection Machine. Parallel Comput. 18(11): 1201-1221 (1992) - [c20]S. Lennart Johnsson:
Massively Parallel Computing: Data Distribution and Communication. Heinz Nixdorf Symposium 1992: 68-92 - 1991
- [j11]S. Lennart Johnsson:
Performance Modeling of Distributed Memory Architectures. J. Parallel Distributed Comput. 12(4): 300-312 (1991) - [j10]Feng Zhao, S. Lennart Johnsson:
The Parallel Multipole Method on the Connection Machine. SIAM J. Sci. Comput. 12(6): 1420-1437 (1991) - 1990
- [j9]Ching-Tien Ho, S. Lennart Johnsson:
Embedding Meshes in Boolean Cubes by Graph Decomposition. J. Parallel Distributed Comput. 8(4): 325-339 (1990) - [j8]Pelle Olsson, S. Lennart Johnsson:
A dataparallel implementation of an explicit method for the three-dimensional compressible Navier-Stokes equations. Parallel Comput. 14(1): 1-30 (1990) - [j7]Ching-Tien Ho, S. Lennart Johnsson:
Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors. SIAM J. Sci. Comput. 11(3): 563-592 (1990) - [c19]Ching-Tien Ho, S. Lennart Johnsson:
Embedding Three-Dimensional Meshes in Boolean Cubes by Graph Decomposition. ICPP (3) 1990: 319-326
1980 – 1989
- 1989
- [j6]Dimitris C. Gerogiannis, Stelios C. Orphanoudakis, S. Lennart Johnsson:
Histogram Computation on Distributed Memory Architectures. Concurr. Pract. Exp. 1(2): 219-238 (1989) - [j5]Kapil K. Mathur, S. Lennart Johnsson:
The Finite Element Method on a Data Parallel Computing System. Int. J. High Speed Comput. 1(1): 29-44 (1989) - [j4]S. Lennart Johnsson, Ching-Tien Ho:
Optimum Broadcasting and Personalized Communication in Hypercubes. IEEE Trans. Computers 38(9): 1249-1268 (1989) - [c18]Ching-Tien Ho, S. Lennart Johnsson:
Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors. PP 1989: 96-98 - [c17]Kapil K. Mathur, S. Lennart Johnsson:
Data Parallel Algorithms for the Finite Element Method. PP 1989: 257-267 - [c16]Clive F. Baillie, Ralph G. Brickner, Rajan Gupta, S. Lennart Johnsson:
QCD with dynamical fermions on the connection machine. SC 1989: 2-9 - [c15]Pelle Olsson, S. Lennart Johnsson:
A study of dissipation operators for the euler equations and a three- dimensional channel flow. SC 1989: 141-151 - [c14]Ching-Tien Ho, S. Lennart Johnsson:
Dilation d embedding of a hyper-pyramid into a hypercube. SC 1989: 294-303 - [c13]S. Lennart Johnsson, Tim Harris, Kapil K. Mathur:
Matrix multiplication on the connection machine. SC 1989: 326-332 - [c12]Kapil K. Mathur, S. Lennart Johnsson:
Element order and convergence rate of the conjugate gradient method for data parallel stress analysis. SC 1989: 337-343 - [c11]S. Lennart Johnsson, Robert L. Krawitz, Roger Frye, Douglas MacDonald:
A radix-2 FFT on connection machine. SC 1989: 809-819 - 1988
- [c10]Ching-Tien Ho, S. Lennart Johnsson:
Optimal algorithms for stable dimension permutations on Boolean cubes. C³P 1988: 725-736 - [c9]Clive F. Baillie, S. Lennart Johnsson, Luis F. Ortiz, G. Stuart Pawley:
QED on the connection machine. C³P 1988: 1288-1295 - [c8]S. Lennart Johnsson, Ching-Tien Ho:
Expressing Boolean cube matrix algorithms in shared memory primitives. C³P 1988: 1599-1609 - 1987
- [j3]S. Lennart Johnsson:
Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures. J. Parallel Distributed Comput. 4(2): 133-172 (1987) - [j2]Jack J. Dongarra, S. Lennart Johnsson:
Solving banded systems on a parallel processor. Parallel Comput. 5(1-2): 219-246 (1987) - [c7]Ching-Tien Ho, S. Lennart Johnsson:
On the Embedding of Arbitrary Meshes in Boolean Cubes With Expansion Two Dilation Two. ICPP 1987: 188-191 - [c6]Abhiram G. Ranade, S. Lennart Johnsson:
The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton. ICPP 1987: 479-482 - [c5]S. Lennart Johnsson, Ching-Tien Ho:
Algorithms for Matrix Transposition on Boolean n-Cube Configured Ensemble Architectures. ICPP 1987: 621-629 - 1986
- [c4]Ching-Tien Ho, S. Lennart Johnsson:
Distributed Routing Algorithms for Broadcasting and Personalized Communication in Hypercubes. ICPP 1986: 640-648 - 1985
- [j1]S. Lennart Johnsson:
Solving Narrow Banded Systems on Ensemble Architectures. ACM Trans. Math. Softw. 11(3): 271-288 (1985) - [c3]Tak-Kwong Ng, S. Lennart Johnsson:
Generation of layouts from MOS circuit schematics: a graph theoretic approach. DAC 1985: 39-45 - 1983
- [c2]Peyyun Peggy Li, S. Lennart Johnsson:
The Tree Machine: An Evaluation of Strategies for Reducing Program Loading Time. ICPP 1983: 202-205 - 1981
- [c1]Danny Cohen, S. Lennart Johnsson:
A Mathematical Approach to the Design of VLSI Networks for Real-Time Computation Problems. RTSS 1981: 32-40
Coauthor Index
C. T. Howard Ho
aka: Ching-Tien Ho
aka: Ching-Tien Ho
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 2025-01-21 00:14 CET 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:
