Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEndre Szemerédi
Person information
- affiliation: Rutgers University, USA
- award (2012): Abel Prize
- award (2012): Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2017
[j84]Jan Hladký
, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. SIAM J. Discret. Math. 31(2): 945-982 (2017)- [j83]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. SIAM J. Discret. Math. 31(2): 983-1016 (2017) - [j82]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. SIAM J. Discret. Math. 31(2): 1017-1071 (2017) - [j81]Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. SIAM J. Discret. Math. 31(2): 1072-1148 (2017) - 2016
- [j80]Endre Szemerédi:
Structural Approach to Subset Sum Problems. Found. Comput. Math. 16(6): 1737-1749 (2016) - 2011
- [j79]András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. Electron. J. Comb. 18(1) (2011) - 2010
- [j78]Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi:
A fast algorithm for equitable coloring. Comb. 30(2): 217-224 (2010) - [j77]Ian Levitt, Gábor N. Sárközy, Endre Szemerédi:
How to avoid using the Regularity Lemma: Pósa's conjecture revisited. Discret. Math. 310(3): 630-641 (2010) - [j76]András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs. Graphs Comb. 26(1): 71-76 (2010) - [j75]András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. J. Graph Theory 63(4): 288-299 (2010) - 2009
- [j74]András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Stability of the path-path Ramsey number. Discret. Math. 309(13): 4590-4595 (2009) - [j73]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Comb. Theory, Ser. A 116(3): 613-636 (2009) - 2008
- [j72]Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski:
An approximate Dirac-type theorem for k -uniform hypergraphs. Comb. 28(2): 229-260 (2008) - [j71]András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
Three-color Ramsey numbers for paths. Comb. 28(4): 499-502 (2008) - [j70]András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs. Electron. J. Comb. 15(1) (2008) - [j69]Ryan R. Martin, Endre Szemerédi:
Quadripartite version of the Hajnal-Szemerédi theorem. Discret. Math. 308(19): 4337-4360 (2008) - 2007
- [j68]András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
Three-Color Ramsey Numbers For Paths. Comb. 27(1): 35-69 (2007) - [j67]András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
Tripartite Ramsey numbers for paths. J. Graph Theory 55(2): 164-174 (2007) - 2006
- [j66]Ayman Khalfalah, Endre Szemerédi:
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$. Comb. Probab. Comput. 15(1-2): 213-227 (2006) - [j65]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
A Dirac-Type Theorem for 3-Uniform Hypergraphs. Comb. Probab. Comput. 15(1-2): 229-251 (2006) - [j64]János Komlós, Endre Szemerédi:
Limit distribution for the existence of Hamiltonian cycles in a random graph. Discret. Math. 306(10-11): 1032-1038 (2006) - [j63]Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Perfect matchings in uniform hypergraphs with large minimum degree. Eur. J. Comb. 27(8): 1333-1349 (2006) - [j62]Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Short paths in quasi-random triple systems with sparse underlying graphs. J. Comb. Theory, Ser. B 96(4): 584-607 (2006) - [j61]András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
An improved bound for the monochromatic cycle partition number. J. Comb. Theory, Ser. B 96(6): 855-873 (2006) - 2003
- [j60]Béla Csaba, Ali Shokoufandeh, Endre Szemerédi:
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. Comb. 23(1): 35-72 (2003) - [j59]Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi:
On the number of Hamiltonian cycles in Dirac graphs. Discret. Math. 265(1-3): 237-250 (2003) - 2002
- [j58]Ayman Khalfalah, Sachin Lodha, Endre Szemerédi:
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square. Discret. Math. 256(1-2): 243-255 (2002) - [j57]Béla Bollobás, Endre Szemerédi:
Girth of sparse graphs. J. Graph Theory 39(3): 194-200 (2002) - 2001
- [j56]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Spanning Trees In Dense Graphs. Comb. Probab. Comput. 10(5): 397-416 (2001) - [j55]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Proof of the Alon-Yuster conjecture. Discret. Math. 235(1-3): 255-269 (2001) - 2000
- [j54]Vojtech Rödl, Endre Szemerédi:
On Size Ramsey Numbers of Graphs with Bounded Degree. Comb. 20(2): 257-262 (2000) - 1998
- [j53]Tomasz Luczak, Vojtech Rödl, Endre Szemerédi:
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. Comb. Probab. Comput. 7(4): 423-436 (1998) - [j52]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
On the Pósa-Seymour conjecture. J. Graph Theory 29(3): 167-176 (1998) - [j51]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
An algorithmic version of the blow-up lemma. Random Struct. Algorithms 12(3): 297-312 (1998) - [j50]János Komlós, Yuan Ma, Endre Szemerédi:
Matching Nuts and Bolts in O(n log n) Time. SIAM J. Discret. Math. 11(3): 347-372 (1998) - 1997
- [j49]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Blow-Up Lemma. Comb. 17(1): 109-123 (1997) - 1996
- [j48]János Komlós, Endre Szemerédi:
Topological cliques in graphs 2. Comb. Probab. Comput. 5: 79-90 (1996) - [j47]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
On the square of a Hamiltonian cycle in dense graphs. Random Struct. Algorithms 9(1-2): 193-211 (1996) - 1995
- [j46]János Komlós, Gábor N. Sárközy, Endre Szemerédi:
proof of a Packing Conjecture of Bollobás. Comb. Probab. Comput. 4: 241-255 (1995) - [j45]László Pyber, Vojtech Rödl, Endre Szemerédi:
Dense Graphs without 3-Regular Subgraphs. J. Comb. Theory, Ser. B 63(1): 41-54 (1995) - 1994
- [j44]Antal Balog, Endre Szemerédi:
A Statistical Theorem of Set Addition. Comb. 14(3): 263-268 (1994) - [j43]János Komlós, Endre Szemerédi:
Topological Cliques in Graphs. Comb. Probab. Comput. 3: 247-256 (1994) - [j42]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey Theorems and Kp-Independence Numbers. Comb. Probab. Comput. 3: 297-325 (1994) - 1993
- [j41]Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán:
Two Tapes Versus One for Off-Line Turing Machines. Comput. Complex. 3: 392-401 (1993) - [j40]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey theorems and simple asymptotically extremal structures. Comb. 13(1): 31-56 (1993) - [j39]Alexander A. Razborov, Endre Szemerédi, Avi Wigderson:
Constructing Small Sets that are Uniform in Arithmetic Progressions. Comb. Probab. Comput. 2: 513-518 (1993) - 1992
- [j38]Fan R. K. Chung, Endre Szemerédi, William T. Trotter:
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane. Discret. Comput. Geom. 7: 1-11 (1992) - [j37]János Pach, William L. Steiger, Endre Szemerédi:
An Upper Bound on the Number of Planar K-Sets. Discret. Comput. Geom. 7: 109-123 (1992) - 1990
- [j36]Péter Hajnal, Endre Szemerédi:
Brooks Coloring in Parallel. SIAM J. Discret. Math. 3(1): 74-80 (1990) - [j35]László Babai, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi:
Lower Bounds to the Complexity of Symmetric Boolean Functions. Theor. Comput. Sci. 74(3): 313-323 (1990) - 1989
- [j34]Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
Almost Sorting in one Round. Adv. Comput. Res. 5: 117-125 (1989) - [j33]Zvi Galil, Ravi Kannan, Endre Szemerédi:
On 3-pushdown graphs with large separators. Comb. 9(1): 9-19 (1989) - [j32]Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi:
There are no p-Complete Families of Symmetric Boolean Functions. Inf. Process. Lett. 30(1): 47-49 (1989) - [j31]Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
Optimal Parallel Selection has Complexity O(Log Log n). J. Comput. Syst. Sci. 38(1): 125-133 (1989) - [j30]Zvi Galil, Ravi Kannan, Endre Szemerédi:
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. J. Comput. Syst. Sci. 38(1): 134-149 (1989) - [j29]Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi:
An Optimal-Time Algorithm for Slope Selection. SIAM J. Comput. 18(4): 792-810 (1989) - [j28]Miklós Ajtai, D. Karabeg, János Komlós, Endre Szemerédi:
Sorting in Average Time o(log) n. SIAM J. Discret. Math. 2(3): 285-292 (1989) - 1988
- [j27]Vasek Chvátal, Endre Szemerédi:
Many Hard Examples for Resolution. J. ACM 35(4): 759-768 (1988) - [j26]Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson:
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). SIAM J. Discret. Math. 1(3): 399-410 (1988) - 1987
- [j25]László Babai, Péter Hajnal, Endre Szemerédi, György Turán:
A Lower Bound for Read-Once-Only Branching Programs. J. Comput. Syst. Sci. 35(2): 153-162 (1987) - 1985
- [j24]András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt:
On the sum of the reciprocals of cycle lengths in sparse graphs. Comb. 5(1): 41-52 (1985) - 1984
- [j23]Henry A. Kierstead, Endre Szemerédi, William T. Trotter:
On coloring graphs with locally small chromatic number. Comb. 4(2): 183-185 (1984) - [j22]Michael L. Fredman, János Komlós, Endre Szemerédi:
Storing a Sparse Table with 0(1) Worst Case Access Time. J. ACM 31(3): 538-544 (1984) - [j21]András Gyárfás, János Komlós, Endre Szemerédi:
On the distribution of cycle lengths in graphs. J. Graph Theory 8(4): 441-462 (1984) - 1983
- [j20]Miklós Ajtai, János Komlós, Endre Szemerédi:
Sorting in c log n parallel sets. Comb. 3(1): 1-19 (1983) - [j19]Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi:
More results on Ramsey - Turán Type problems. Comb. 3(1): 69-81 (1983) - [j18]Endre Szemerédi, William T. Trotter:
Extremal problems in discrete geometry. Comb. 3(3): 381-392 (1983) - [j17]János Komlós, Endre Szemerédi:
Limit distribution for the existence of hamiltonian cycles in a random graph. Discret. Math. 43(1): 55-63 (1983) - [j16]Endre Szemerédi, William T. Trotter:
A Combinatorial Distinction Between the Euclidean and Projective Planes. Eur. J. Comb. 4(4): 385-394 (1983) - [j15]C. Chvatál, Vojtech Rödl, Endre Szemerédi, William T. Trotter:
The Ramsey number of a graph with bounded maximum degree. J. Comb. Theory, Ser. B 34(3): 239-243 (1983) - [j14]Vasek Chvátal, Endre Szemerédi:
Short cycles in directed graphs. J. Comb. Theory, Ser. B 35(3): 323-327 (1983) - 1982
- [j13]Miklós Ajtai, János Komlós, Endre Szemerédi:
Largest random component of a k-cube. Comb. 2(1): 1-7 (1982) - [j12]Václav Chvátal, Endre Szemerédi:
On an Extremal Problem Concerning Intervals. Eur. J. Comb. 3(3): 215-217 (1982) - [j11]Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi:
Extremal Uncrowded Hypergraphs. J. Comb. Theory, Ser. A 32(3): 321-335 (1982) - 1981
- [j10]Miklós Ajtai, János Komlós, Endre Szemerédi:
The longest path in a random graph. Comb. 1(1): 1-12 (1981) - [j9]Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi:
On Turáns theorem for sparse graphs. Comb. 1(4): 313-317 (1981) - [j8]Miklós Ajtai, János Komlós, Endre Szemerédi:
A Dense Infinite Sidon Sequence. Eur. J. Comb. 2(1): 1-11 (1981) - 1980
- [j7]András Gyárfás, Endre Szemerédi, Zsolt Tuza:
Induced subtrees in graphs of large chromatic number. Discret. Math. 30(3): 235-244 (1980) - [j6]Miklós Ajtai, János Komlós, Endre Szemerédi:
A Note on Ramsey Numbers. J. Comb. Theory, Ser. A 29(3): 354-360 (1980) - 1978
- [j5]Miklós Ajtai, János Komlós, Endre Szemerédi:
There is no Fast Single Hashing Algorithm. Inf. Process. Lett. 7(6): 270-273 (1978) - [j4]Leonidas J. Guibas, Endre Szemerédi:
The Analysis of Double Hashing. J. Comput. Syst. Sci. 16(2): 226-274 (1978) - [j3]Ronald L. Graham, Endre Szemerédi:
On subgraph number independence in trees. J. Comb. Theory, Ser. B 24(2): 213-222 (1978) - [j2]Paul Erdös, Endre Szemerédi:
Combinatorial Properties of Systems of Sets. J. Comb. Theory, Ser. A 24(3): 308-313 (1978) - 1975
- [j1]Béla Bollobás, Paul Erdös, Endre Szemerédi:
On complete subgraphs of r-chromatic graphs. Discret. Math. 13(2): 97-107 (1975)
Conference and Workshop Papers
- 2013
- [c24]Endre Szemerédi:
Various Regularity Lemmas in Graphs and Hypergraphs. CiE 2013: 403 - 2005
- [c23]Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl:
The Generalization of Dirac's Theorem for Hypergraphs. MFCS 2005: 52-56 - 2001
- [c22]Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX 2001: 170-180 - 2000
- [c21]János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi:
The Regularity Lemma and Its Applications in Graph Theory. Theoretical Aspects of Computer Science 2000: 84-112 - [c20]Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Universality and Tolerance. FOCS 2000: 14-21 - 1996
- [c19]János Komlós, Yuan Ma, Endre Szemerédi:
Matching Nuts and Bolts in O(n log n) Time (Extended Abstract). SODA 1996: 232-241 - 1995
- [c18]Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi:
Lower bounds for sorting networks. STOC 1995: 437-446 - 1992
- [c17]Noam Nisan, Endre Szemerédi, Avi Wigderson:
Undirected Connectivity in O(log ^1.5 n) Space. FOCS 1992: 24-29 - [c16]Miklós Ajtai, János Komlós, Endre Szemerédi:
Halvers and Expanders. FOCS 1992: 686-692 - [c15]Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi:
Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths. FOCS 1992: 693-702 - 1989
- [c14]János Pach, William L. Steiger, Endre Szemerédi:
An Upper Bound on the Number of Planar k-Sets. FOCS 1989: 72-79 - [c13]Joel Friedman, Jeff Kahn, Endre Szemerédi:
On the Second Eigenvalue in Random Regular Graphs. STOC 1989: 587-598 - 1988
- [c12]Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi:
Optimal Slope Selection. ICALP 1988: 133-146 - [c11]Janos Pintz, William L. Steiger, Endre Szemerédi:
Two Infinite Sets of Primes with Fast Primality Tests. STOC 1988: 504-509 - 1987
- [c10]Wolfgang Maass, Georg Schnitger, Endre Szemerédi:
Two Tapes Are Better than One for Off-Line Turing Machines. STOC 1987: 94-100 - [c9]Miklós Ajtai, János Komlós, Endre Szemerédi:
Deterministic Simulation in LOGSPACE. STOC 1987: 132-140 - 1986
- [c8]Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán:
Two lower bounds for branching programs. STOC 1986: 30-38 - [c7]Zvi Galil, Ravi Kannan, Endre Szemerédi:
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. STOC 1986: 39-49 - [c6]Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
Deterministic Selection in O(log log N) Parallel Time. STOC 1986: 188-195 - 1984
- [c5]László Babai, Endre Szemerédi:
On the Complexity of Matrix Group Problems I. FOCS 1984: 229-240 - 1983
- [c4]Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter:
On Determinism versus Non-Determinism and Related Problems (Preliminary Version). FOCS 1983: 429-438 - [c3]Miklós Ajtai, János Komlós, Endre Szemerédi:
An O(n log n) Sorting Network. STOC 1983: 1-9 - 1982
- [c2]Michael L. Fredman, János Komlós, Endre Szemerédi:
Storing a Sparse Table with O(1) Worst Case Access Time. FOCS 1982: 165-169 - 1976
- [c1]Leonidas J. Guibas, Endre Szemerédi:
The Analysis of Double Hashing (Extended Abstract). STOC 1976: 187-191
Parts in Books or Collections
- 2016
- [p1]Endre Szemerédi:
Erdős's Unit Distance Problem. Open Problems in Mathematics 2016: 459-477
Informal and Other Publications
- 2012
- [i1]Gábor N. Sárközy, Fei Song, Endre Szemerédi, Shubhendu Trivedi:
A Practical Regularity Partitioning Algorithm and its Applications in Clustering. CoRR abs/1209.6540 (2012)
Coauthor Index
a service of 
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-25 01:58 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:
