default search action
Peter Winkler 0001
Peter M. Winkler
Person information
- affiliation: Dartmouth College, Hanover, USA
Other persons with the same name
- Peter Winkler — disambiguation page
- Peter Winkler 0002 — PSI Gesellschaft für Prozeßsteuerungs- und Informationssysteme, Berlin, Deutschland
- Peter Winkler 0003 — University Hospital Graz, Institute for Technical Physics, Department of Radiology, Austria
- Peter Winkler 0004 — Radiological Institute, Olgahospital Stuttgart, Germany
- Peter Winkler 0005 — TU Dresden, Center for Information Services and High Performance Computing, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j118]Marc Berger
, Peter Winkler
An Ancient Combinatorial Problem. Am. Math. Mon. 129(6): 566-575 (2022) - 2020
- [j117]Richard W. Kenyon, Daniel Král'
Permutations with fixed pattern densities. Random Struct. Algorithms 56(1): 220-250 (2020)
2010 – 2019
- 2019
- [j116]Alexander E. Holroyd, Lionel Levine
Abelian Logic Gates. Comb. Probab. Comput. 28(3): 388-422 (2019) - [j115]Shahrzad Haddadan
Mixing of Permutations by Biased Transpositions. Theory Comput. Syst. 63(5): 1068-1088 (2019) - 2017
- [j114]Amir Barghi, Peter Winkler:
Firefighting on Geometric Graphs with Density Bounds. Ars Comb. 131: 63-86 (2017) - [j113]Peter Winkler:
The Sleeping Beauty Controversy. Am. Math. Mon. 124(7): 579-587 (2017) - [c28]Shahrzad Haddadan
Mixing of Permutations by Biased Transposition. STACS 2017: 41:1-41:13 - 2016
- [j112]Natasha Komarov, Peter Winkler
Cop vs. Gambler. Discret. Math. 339(6): 1677-1681 (2016) - [i7]Shahrzad Haddadan, Peter Winkler:
Mixing of Permutations by Biased Transposition. CoRR abs/1604.00870 (2016) - 2015
- [j111]Amir Barghi, Peter Winkler
Firefighting on a random geometric graph. Random Struct. Algorithms 46(3): 466-477 (2015) - [i6]Alexander E. Holroyd, Lionel Levine, Peter Winkler:
Abelian logic gates. CoRR abs/1511.00422 (2015) - 2014
- [j110]Peter Winkler:
Puzzled: Lowest Number Wins. Commun. ACM 57(2): 120 (2014) - [j109]Peter Winkler:
Puzzled: Solutions and sources. Commun. ACM 57(3): 109 (2014) - [j108]Peter Winkler:
Puzzled: A Sort, of Sorts. Commun. ACM 57(5): 120 (2014) - [j107]Peter Winkler:
Puzzled: Solutions and sources. Commun. ACM 57(6): 110 (2014) - [j106]Peter Winkler:
Puzzled: Paths and Matchings. Commun. ACM 57(8): 104 (2014) - [j105]Peter Winkler
Puzzled: Solutions and sources. Commun. ACM 57(9): 102 (2014) - [j104]Natasha Komarov, Peter Winkler:
Capturing the Drunk Robber on a Graph. Electron. J. Comb. 21(3): 3 (2014) - [j103]Perla Sousi, Peter Winkler
Mixing Times and Moving Targets. Comb. Probab. Comput. 23(3): 460-476 (2014) - [j102]Agelos Georgakopoulos, Peter Winkler
New Bounds for Edge-Cover by Random Walk. Comb. Probab. Comput. 23(4): 571-584 (2014) - [j101]Ed Coffman, Robert Margolies, Peter Winkler
Performance evaluation of fragmented structures: A theoretical study. Perform. Evaluation 79: 273-286 (2014) - [c27]Joshua Brody, Sune K. Jakobsen, Dominik Scheder
Cryptogenography. ITCS 2014: 13-22 - 2013
- [j100]Peter Winkler:
Puzzled. Commun. ACM 56(2): 112 (2013) - [j99]Peter Winkler
Puzzled. Commun. ACM 56(3): 102 (2013) - [j98]Peter Winkler
Puzzled. Commun. ACM 56(5): 104 (2013) - [j97]Peter Winkler
Puzzled answers. Commun. ACM 56(6): 117 (2013) - [j96]Peter Winkler
Puzzled. Commun. ACM 56(8): 96 (2013) - [j95]Peter Winkler
Puzzled. Commun. ACM 56(9): 110 (2013) - [j94]Peter Winkler:
Puzzled: Coin flipping. Commun. ACM 56(11): 120 (2013) - [j93]Peter Winkler:
Puzzled: Solutions and sources. Commun. ACM 56(12): 126 (2013) - [c26]Matthias Kirchner, Peter Winkler
Impeding forgers at photo inception. Media Watermarking, Security, and Forensics 2013: 866504 - [p1]Donald Beaver, Stuart Haber, Peter Winkler
On the Isolation of a Common Secret. The Mathematics of Paul Erdős II 2013: 21-38 - [i5]Natasha Komarov, Peter Winkler:
Cops vs. Gambler. CoRR abs/1308.4715 (2013) - 2012
- [j92]Peter Winkler
Puzzled. Commun. ACM 55(2): 128 (2012) - [j91]Peter Winkler
Puzzled. Commun. ACM 55(3): 118 (2012) - [j90]Peter Winkler:
Puzzled. Commun. ACM 55(5): 120 (2012) - [j89]Peter Winkler
Puzzled. Commun. ACM 55(6): 133 (2012) - [j88]Peter Winkler:
Puzzled. Commun. ACM 55(8): 120 (2012) - [j87]Peter Winkler
Puzzled. Commun. ACM 55(9): 117 (2012) - [j86]Peter Winkler:
Puzzled. Commun. ACM 55(11): 120 (2012) - [j85]Peter Winkler
Puzzled. Commun. ACM 55(12): 126 (2012) - [j84]Agelos Georgakopoulos, Peter Winkler:
Two-Color Babylon. Integers 12: G1 (2012) - 2011
- [j83]Peter Winkler
Puzzled. Commun. ACM 54(2): 112 (2011) - [j82]Peter Winkler
Puzzled. Commun. ACM 54(3): 109 (2011) - [j81]Peter Winkler:
Puzzled. Commun. ACM 54(5): 120 (2011) - [j80]Peter Winkler
Puzzled. Commun. ACM 54(6): 126 (2011) - [j79]Peter Winkler
Puzzled. Commun. ACM 54(8): 120 (2011) - [j78]Peter Winkler
Puzzled. Commun. ACM 54(9): 110 (2011) - [j77]Peter Winkler:
Puzzled. Commun. ACM 54(11): 120 (2011) - [j76]Peter Winkler
Puzzled. Commun. ACM 54(12): 142 (2011) - [j75]Peter Winkler:
Review: Famous Puzzles of Great Mathematicians. American Mathematical Society, Providence, RI, 2009, xviii + 325 pp., ISBN 978-0-8218-4814-2, $36. by Miodrag S. Petkovič. Am. Math. Mon. 118(7): 661-664 (2011) - [i4]Agelos Georgakopoulos, Peter Winkler:
New Bounds for Edge-Cover by Random Walk. CoRR abs/1109.6619 (2011) - [i3]Agelos Georgakopoulos, Peter Winkler:
Two-Color Babylon. CoRR abs/1111.4189 (2011) - 2010
- [j74]Peter Winkler:
Breaking chocolate bars. Commun. ACM 53(2): 120 (2010) - [j73]Peter Winkler
Puzzled. Commun. ACM 53(3): 118 (2010) - [j72]Peter Winkler:
Puzzled. Commun. ACM 53(5): 120 (2010) - [j71]Peter Winkler:
Puzzled. Commun. ACM 53(6): 118 (2010) - [j70]Peter Winkler:
Puzzled. Commun. ACM 53(8): 128 (2010) - [j69]Peter Winkler
Puzzled. Commun. ACM 53(9): 110 (2010) - [j68]Peter Winkler
Puzzled. Commun. ACM 53(11): 112 (2010) - [j67]Peter Winkler
Puzzled: Solutions and sources. Commun. ACM 53(12): 126 (2010) - [j66]Rachel M. Esselstein, Peter Winkler:
Building Graphs from Colored Trees. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j65]Peter Winkler:
Puzzled - Will my algorithm terminate? Commun. ACM 52(2): 104 (2009) - [j64]Peter Winkler
Puzzled - Solutions and sources. Commun. ACM 52(3): 111 (2009) - [j63]Peter Winkler:
Puzzled - Understanding relationships among numbers. Commun. ACM 52(5): 112 (2009) - [j62]Peter Winkler
Puzzled - Solutions and sources. Commun. ACM 52(6): 103 (2009) - [j61]Peter Winkler:
Puzzled - Probability and intuition. Commun. ACM 52(8): 104 (2009) - [j60]Peter Winkler:
Puzzled - Solutions and sources. Commun. ACM 52(9): 110 (2009) - [j59]Peter Winkler:
Puzzled - Covering the plane. Commun. ACM 52(11): 112 (2009) - [j58]Peter Winkler:
Puzzled - Solutions and sources. Commun. ACM 52(12): 111 (2009) - [j57]Graham R. Brightwell, Peter Winkler
Submodular Percolation. SIAM J. Discret. Math. 23(3): 1149-1178 (2009) - [j56]Richard W. Kenyon, Peter Winkler:
Branched Polymers. Am. Math. Mon. 116(7): 612-628 (2009) - [j55]Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum Overhang. Am. Math. Mon. 116(9): 763-787 (2009) - [c25]Sergi Elizalde, Peter Winkler:
Sorting by placement and shift. SODA 2009: 68-75 - 2008
- [j54]Peter Winkler:
Puzzled: Circular food. Commun. ACM 51(11): 112 (2008) - [j53]Peter Winkler:
Puzzled - Solutions and sources. Commun. ACM 51(12): 118 (2008) - [j52]Elizabeth R. Moseman, Peter Winkler
On a Form of Coordinate Percolation. Comb. Probab. Comput. 17(6): 837-845 (2008) - [c24]Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum overhang. SODA 2008: 756-765 - [i2]Sergi Elizalde, Peter Winkler:
Sorting by Placement and Shift. CoRR abs/0809.2957 (2008) - 2007
- [c23]Peter Winkler:
Luck vs. Skill. CAAN 2007: 1 - 2006
- [j51]Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
Dominating sets in k-majority tournaments. J. Comb. Theory B 96(3): 374-387 (2006) - [j50]Lewis Bowen, R. Lyons, Charles Radin, Peter Winkler
A Solidification Phenomenon in Random Packings. SIAM J. Math. Anal. 38(4): 1075-1089 (2006) - [c22]David J. Houck, Kin K. Leung, Peter Winkler
Data Synchronization Methods Based on ShuffleNet and Hypercube for Networked Information Systems. INFOCOM 2006 - 2005
- [c21]Dana Randall, Peter Winkler:
Mixing Points on an Interval. ALENEX/ANALCO 2005: 218-221 - [c20]Graham R. Brightwell, Peter Winkler:
Counting Eulerian Circuits is #P-Complete. ALENEX/ANALCO 2005: 259-262 - [c19]Dana Randall, Peter Winkler:
Mixing Points on a Circle. APPROX-RANDOM 2005: 426-435 - 2004
- [j49]Graham R. Brightwell, Peter Winkler
A second threshold for the hard-core model on a Bethe lattice. Random Struct. Algorithms 24(3): 303-314 (2004) - [j48]Malwina J. Luczak
Building uniformly random subtrees. Random Struct. Algorithms 24(4): 420-443 (2004) - [c18]Peter Winkler:
How random is the human genome? SODA 2004: 879 - [e1]Jaroslav Nesetril, Peter Winkler:
Graphs, Morphisms and Statistical Physics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 63, DIMACS/AMS 2004, ISBN 978-0-8218-3551-7 [contents] - [i1]Graham R. Brightwell, Peter Winkler:
Note on Counting Eulerian Circuits. CoRR cs.CC/0405067 (2004) - 2003
- [j47]Ioana Dumitriu, Prasad Tetali, Peter Winkler
On Playing Golf with Two Balls. SIAM J. Discret. Math. 16(4): 604-615 (2003) - [c17]Peter Winkler, Lisa Zhang:
Wavelength assignment and generalized interval graph coloring. SODA 2003: 830-831 - 2002
- [j46]Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler:
Packing rectangles in a strip. Acta Informatica 38(10): 673-693 (2002) - [c16]Peter Winkler:
Rapid Mixing. CCC 2002: 125 - [c15]Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler:
Wide-Sense Nonblocking WDM Cross-Connects. ESA 2002: 538-549 - [c14]Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane:
Clustering and Server Selection using Passive Monitoring. INFOCOM 2002: 1717-1725 - 2001
- [j45]Peter Winkler
Optimality and Greed in Dynamic Allocation. J. Algorithms 41(2): 244-261 (2001) - [j44]Sem C. Borst, Edward G. Coffman Jr., Edgar N. Gilbert, Philip A. Whiting, Peter M. Winkler:
Optimal Carrier Sharing in Wireless TDMA. J. Interconnect. Networks 2(2): 189-211 (2001) - [c13]Graham R. Brightwell, Peter Winkler:
Graph Homomorphisms and Long Range Action. Graphs, Morphisms and Statistical Physics 2001: 29-47 - [c12]Yevgeniy Dodis, Peter Winkler:
Universal configurations in light-flipping games. SODA 2001: 926-927 - 2000
- [j43]Peter C. Fishburn, Prasad Tetali, Peter Winkler:
Optimal linear arrangement of a rectangular grid. Discret. Math. 213(1-3): 123-139 (2000) - [j42]Graham R. Brightwell, Peter Winkler
Gibbs Measures and Dismantlable Graphs. J. Comb. Theory B 78(1): 141-166 (2000) - [j41]Peter Winkler:
Dependent percolation and colliding random walks. Random Struct. Algorithms 16(1): 58-84 (2000) - [c11]Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler
Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297
1990 – 1999
- 1999
- [j40]Graham R. Brightwell, Peter Winkler
Graph Homomorphisms and Phase Transitions. J. Comb. Theory B 77(2): 221-262 (1999) - [j39]Mekkia Kouider, Peter Winkler:
Erratum: Mean distance and minimum degree. J. Graph Theory 30(3): 243 (1999) - [j38]Alexander Schrijver, Paul D. Seymour, Peter Winkler:
The Ring Loading Problem. SIAM Rev. 41(4): 777-791 (1999) - 1998
- [j37]László Lovász, Peter Winkler:
Reversal of Markov Chains and the Forget Time. Comb. Probab. Comput. 7(2): 189-204 (1998) - [j36]William T. Trotter, Peter Winkler:
Ramsey Theory and Sequences of Random Variables. Comb. Probab. Comput. 7(2): 221-238 (1998) - [j35]Alexander Schrijver, Paul D. Seymour
The Ring Loading Problem. SIAM J. Discret. Math. 11(1): 1-14 (1998) - [c10]Gordon T. Wilfong, Peter Winkler:
Ring Routing and Wavelength Translation. SODA 1998: 333-341 - 1997
- [j34]Shimon Even, Ami Litman, Peter Winkler:
Computing with Snakes in Directed Networks of Automata. J. Algorithms 24(1): 158-170 (1997) - [j33]Mekkia Kouider, Peter Winkler:
Mean distance and minimum degree. J. Graph Theory 25(1): 95-99 (1997) - [c9]László Lovász, Peter Winkler:
Mixing times. Microsurveys in Discrete Probability 1997: 85-133 - 1996
- [j32]Milena Mihail, Peter Winkler:
On the Number of Eulerian Orientations of a Graph. Algorithmica 16(4/5): 402-414 (1996) - [j31]Ronald Fagin, Moni Naor, Peter Winkler:
Comparing Information Without Leaking It. Commun. ACM 39(5): 77-85 (1996) - [j30]Denise B. Kandel, Yossi Matias, Ron Unger, Peter Winkler:
Shuffling Biological Sequences. Discret. Appl. Math. 71(1-3): 171-185 (1996) - [j29]Peter Winkler, David Zuckerman:
Multiple cover time. Random Struct. Algorithms 9(4): 403-411 (1996) - 1995
- [j28]László Lovász, Peter Winkler:
Exact Mixing in an Unknown Markov Chain. Electron. J. Comb. 2 (1995) - [j27]Carla D. Savage, Peter Winkler:
Monotone Gray Codes and the Middle Levels Problem. J. Comb. Theory A 70(2): 230-248 (1995) - [j26]Paul Erdös, Stephen Suen, Peter Winkler:
On the Size of a Random Maximal Graph. Random Struct. Algorithms 6(2/3): 309-318 (1995) - [c8]Arjen K. Lenstra, Peter Winkler
A Key Escrow System with Warrant Bounds. CRYPTO 1995: 197-207 - [c7]László Lovász, Peter Winkler:
Efficient stopping rules for Markov chains. STOC 1995: 76-82 - 1994
- [j25]Guoli Ding, Paul D. Seymour
Bounding the Vertex Cover Number of a Hypergraph. Comb. 14(1): 23-34 (1994) - 1993
- [j24]Vaidy S. Sunderam, Peter Winkler
Fast Information Sharing in a Complete Network. Discret. Appl. Math. 42(1): 75-86 (1993) - [j23]László Lovász, Peter Winkler:
A note on the last new vertex visited by a random walk. J. Graph Theory 17(5): 593-596 (1993) - [j22]Don Coppersmith, Prasad Tetali, Peter Winkler:
Collisions Among Random Walks on a Graph. SIAM J. Discret. Math. 6(3): 363-374 (1993) - 1992
- [j21]Joel Spencer, Peter Winkler
Three Thresholds for a Liar. Comb. Probab. Comput. 1: 81-93 (1992) - [c6]Aditi Dhagat, Péter Gács, Peter Winkler:
On Playing "Twenty Questions" with a Liar. SODA 1992: 16-22 - [c5]Milena Mihail, Peter Winkler:
On the Number of Eularian Orientations of a Graph. SODA 1992: 138-145 - [c4]Graham R. Brightwell, Teunis J. Ott, Peter Winkler:
Target Shooting with Programmed Random Variables. STOC 1992: 691-698 - 1991
- [j20]Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler
The number of t-wise balance designs. Comb. 11(3): 207-218 (1991) - [c3]Prasad Tetali, Peter Winkler:
On a Random Walk Problem Arising in Self-Stabilizing Token Management. PODC 1991: 273-280 - [c2]Graham R. Brightwell, Peter Winkler:
Counting Linear Extensions is #P-Complete. STOC 1991: 175-181 - 1990
- [j19]Peter Winkler
Mean distance in a tree. Discret. Appl. Math. 27(1-2): 179-185 (1990) - [j18]Graham R. Brightwell, Peter Winkler:
Extremal cover times for random walks on trees. J. Graph Theory 14(5): 547-554 (1990) - [j17]Graham R. Brightwell, Peter Winkler:
Maximum itting Time for Random Walks on Graphs. Random Struct. Algorithms 1(3): 263-276 (1990) - [j16]Dwight Duffus, Bill Sands, Peter Winkler:
Maximal Chains and Antichains in Boolean Lattices. SIAM J. Discret. Math. 3(2): 197-205 (1990) - [c1]Shimon Even, Ami Litman, Peter Winkler:
Computing with Snakes in Directed Networks of Automata (Extended Abstract). FOCS 1990: 740-745
1980 – 1989
- 1989
- [j15]Vojtech Rödl, Peter Winkler:
A Ramsey-Type Theorem for Orderings of a Graph. SIAM J. Discret. Math. 2(3): 402-406 (1989) - 1988
- [j14]Peter Winkler:
The Complexity of Metric Realization. SIAM J. Discret. Math. 1(4): 552-559 (1988) - 1987
- [j13]Peter Winkler:
Factoring a Graph in Polynomial Time. Eur. J. Comb. 8(2): 209-212 (1987) - [j12]Peter M. Winkler:
Every connected graph is a query graph. J. Graph Theory 11(2): 231-234 (1987) - 1986
- [j11]R. L. Roth, Peter M. Winkler:
Collapse of the Metric Hierarchy for Bipartite Graphs. Eur. J. Comb. 7(4): 371-375 (1986) - 1985
- [j10]Fan R. K. Chung, Ronald L. Graham, Peter M. Winkler
On the addressing problem for directed graphs. Graphs Comb. 1(1): 41-50 (1985) - 1984
- [j9]Peter M. Winkler
Isometric embedding in products of complete graphs. Discret. Appl. Math. 7(2): 221-225 (1984) - 1983
- [j8]Peter M. Winkler
Proof of the squashed cube conjecture. Comb. 3(1): 135-139 (1983) - [j7]Peter Winkler
The Advent of Cryptology in the Game of Bridge. Cryptologia 7(4): 327-332 (1983) - [j6]Richard J. Nowakowski
Vertex-to-vertex pursuit in a graph. Discret. Math. 43(2-3): 235-239 (1983) - [j5]Chang M. Bang, Henry Sharp Jr., Peter Winkler
On families of finite sets with bounds on unions and intersections. Discret. Math. 45(1): 123-126 (1983) - [j4]Peter M. Winkler
Existence of graphs with a given set of r-neighborhoods. J. Comb. Theory B 34(2): 165-176 (1983) - 1982
- [j3]Peter Winkler
Average height in a partially ordered set. Discret. Math. 39(3): 337-341 (1982) - [j2]Peter M. Winkler
On Computability of the Mean Deviation. Inf. Process. Lett. 15(1): 36-38 (1982) - 1980
- [j1]Peter M. Winkler
On connectivity of triangulations of manifolds. Discret. Math. 32(1): 93-94 (1980)
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-11-25 22:48 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: