default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRudolf Fleischer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j42]Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot:
Weight balancing on boundaries. J. Comput. Geom. 13(1): 1-12 (2022)
2010 – 2019
- 2019
- [j41]Roberto Solis-Oba, Rudolf Fleischer:
Guest Editorial: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 63(8): 1755-1756 (2019) - 2018
- [e6]Roberto Solis-Oba, Rudolf Fleischer:
Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10787, Springer 2018, ISBN 978-3-319-89440-9 [contents] - 2016
- [c52]Rudolf Fleischer:
Counting Circles Without Computing Them. FUN 2016: 17:1-17:7 - 2015
- [e5]Asma Al-Saidi, Rudolf Fleischer, Zakaria Maamar, Omer F. Rana:
Intelligent Cloud Computing - First International Conference, ICC 2014, Muscat, Oman, February 24-26, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8993, Springer 2015, ISBN 978-3-319-19847-7 [contents] - [i11]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. CoRR abs/1511.04123 (2015) - 2014
- [j40]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi
, Takeshi Tokuyama:
Order-preserving matching. Theor. Comput. Sci. 525: 68-79 (2014) - [c51]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. SoCG 2014: 436 - [c50]Rudolf Fleischer, Tao Zhang:
Competitive Analysis of the Windfall Game. FUN 2014: 183-193 - 2013
- [c49]Rudolf Fleischer, Jiajin Yu:
A Survey of the Game "Lights Out!". Space-Efficient Data Structures, Streams, and Algorithms 2013: 176-198 - [i10]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order Preserving Matching. CoRR abs/1302.4064 (2013) - 2012
- [j39]Rudolf Fleischer, Gerhard J. Woeginger:
An algorithmic analysis of the Honey-Bee game. Theor. Comput. Sci. 452: 75-87 (2012) - [c48]Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond:
Train Marshalling Is Fixed Parameter Tractable. FUN 2012: 51-56 - 2011
- [j38]Rudolf Fleischer, Xiaoming Xu:
Computing minimum diameter color-spanning sets is hard. Inf. Process. Lett. 111(21-22): 1054-1056 (2011) - [i9]Rudolf Fleischer, Gerhard J. Woeginger:
An Algorithmic Analysis of the Honey-Bee Game. CoRR abs/1102.3025 (2011) - 2010
- [j37]Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
The Tourist in the Shopping Arcade. J. Univers. Comput. Sci. 16(5): 676-685 (2010) - [j36]Changyou Chen, Junping Zhang, Rudolf Fleischer:
Distance Approximating Dimension Reduction of Riemannian Manifolds. IEEE Trans. Syst. Man Cybern. Part B 40(1): 208-217 (2010) - [j35]Junping Zhang, Jian Pu, Changyou Chen, Rudolf Fleischer:
Low-Resolution Gait Recognition. IEEE Trans. Syst. Man Cybern. Part B 40(4): 986-996 (2010) - [c47]Rudolf Fleischer, Xiaotian Wu:
Edge Clique Partition of K 4-Free and Planar Graphs. CGGA 2010: 84-95 - [c46]Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu:
Extended Islands of Tractability for Parsimony Haplotyping. CPM 2010: 214-226 - [c45]Rudolf Fleischer, Xiaoming Xu:
Computing Minimum Diameter Color-Spanning Sets. FAW 2010: 285-292 - [c44]Rudolf Fleischer, Gerhard J. Woeginger:
An Algorithmic Analysis of the Honey-Bee Game. FUN 2010: 178-189 - [c43]Danny Z. Chen, Rudolf Fleischer, Jian Li:
Densest k-Subgraph Approximation on Intersection Graphs. WAOA 2010: 83-93
2000 – 2009
- 2009
- [j34]Rudolf Fleischer:
Die Another Day. Theory Comput. Syst. 44(2): 205-214 (2009) - [j33]Rudolf Fleischer, Jinhui Xu:
Foreword. Theor. Comput. Sci. 410(45): 4533 (2009) - [c42]Rudolf Fleischer:
Is the World Linear? Efficient Algorithms 2009: 368-379 - [c41]Rudolf Fleischer, Xi Wu, Liwei Yuan:
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem. ESA 2009: 611-622 - [c40]Changyou Chen, Junping Zhang, Rudolf Fleischer:
Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition. ICB 2009: 1030-1039 - [c39]Rudolf Fleischer, Yihui Wang:
On the Camera Placement Problem. ISAAC 2009: 255-264 - 2008
- [j32]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio. SIAM J. Comput. 38(3): 881-898 (2008) - [e4]Rudolf Fleischer, Jinhui Xu:
Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings. Lecture Notes in Computer Science 5034, Springer 2008, ISBN 978-3-540-68865-5 [contents] - [r1]Rudolf Fleischer:
Robotics. Encyclopedia of Algorithms 2008 - 2007
- [c38]Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu:
Efficient Algorithms for k -Disjoint Paths Problems on DAGs. AAIM 2007: 134-143 - [c37]Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun:
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. COCOON 2007: 439-447 - [c36]Rudolf Fleischer:
Die Another Day. FUN 2007: 146-155 - [c35]Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu:
Approximating the Maximum Sharing Problem. WADS 2007: 52-63 - [e3]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
Robot Navigation, 15.10. - 20.10.2006. Dagstuhl Seminar Proceedings 06421, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2006
- [j31]Rudolf Fleischer, Mordecai J. Golin, Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line. Algorithmica 45(4): 549-567 (2006) - [j30]Rudolf Fleischer:
Foreword. Algorithmica 46(1): 1 (2006) - [j29]Rudolf Fleischer:
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 16(2-3): 95-96 (2006) - [j28]Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu:
Approximating the minimum weight weak vertex cover. Theor. Comput. Sci. 363(1): 99-105 (2006) - [c34]Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu:
Non-metric Multicommodity and Multilevel Facility Location. AAIM 2006: 138-148 - [c33]Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu:
Traversing the Machining Graph. ESA 2006: 220-231 - [c32]Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu:
On Approximating the Maximum Simple Sharing Problem. ISAAC 2006: 547-556 - [i8]Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Searching for a Ray in the Plane. Robot Navigation 2006 - [i7]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
06421 Executive Summary -- Robot Navigation. Robot Navigation 2006 - [i6]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
06421 Abstracts Collection -- Robot Navigation. Robot Navigation 2006 - [i5]Rudolf Fleischer:
Die Another Day. Data Structures 2006 - 2005
- [c31]Rudolf Fleischer, Gerhard Trippen:
On the Effectiveness of Visualizations in a Theory of Computing Course. Cognitive Systems 2005: 15-24 - [c30]Rudolf Fleischer, Gerhard Trippen:
Exploring an Unknown Graph Efficiently. ESA 2005: 11-22 - [c29]Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang:
Approximating Spanning Trees with Inner Nodes Cost. PDCAT 2005: 660-664 - [i4]Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive online searching for a ray in the plane. EuroCG 2005: 107-110 - 2004
- [j27]Rudolf Fleischer, Hisashi Koga:
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness. Algorithmica 38(2): 363-376 (2004) - [j26]Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro:
Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. 144(3): 231-236 (2004) - [j25]Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov:
Tight bounds on maximal and maximum matchings. Discret. Math. 285(1-3): 7-15 (2004) - [j24]Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong:
Finding optimal paths in MREP routing. Inf. Process. Lett. 89(2): 57-63 (2004) - [j23]Rudolf Fleischer, Richard J. Nowakowski:
Preface: Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 313(3): 313 (2004) - [j22]Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer:
Solitaire Clobber. Theor. Comput. Sci. 313(3): 325-338 (2004) - [j21]Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
Traveling salesmen in the presence of competition. Theor. Comput. Sci. 313(3): 377-392 (2004) - [j20]Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski:
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 313(3): 539-543 (2004) - [j19]Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden:
New results for online page replication. Theor. Comput. Sci. 324(2-3): 219-251 (2004) - [c28]Rudolf Fleischer, Gerhard Trippen:
Kayles on the Way to the Stars. Computers and Games 2004: 232-245 - [c27]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio. ESA 2004: 335-346 - [c26]Rudolf Fleischer, Mordecai J. Golin, Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line. SWAT 2004: 102-113 - [e2]Rudolf Fleischer, Gerhard Trippen:
Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings. Lecture Notes in Computer Science 3341, Springer 2004, ISBN 3-540-24131-0 [contents] - 2003
- [j18]Thomas L. Naps, Guido Rößling, Vicki L. Almstrum, Wanda P. Dann, Rudolf Fleischer, Christopher D. Hundhausen, Ari Korhonen, Lauri Malmi, Myles F. McNally, Susan H. Rodger, J. Ángel Velázquez-Iturbide:
Exploring the role of visualization and engagement in computer science education. ACM SIGCSE Bull. 35(2): 131-152 (2003) - [j17]Thomas L. Naps, Stephen Cooper, Boris Koldehofe, Charles Leska, Guido Rößling, Wanda P. Dann, Ari Korhonen, Lauri Malmi, Jarmo Rantakokko, Rockford J. Ross, Jay Anderson, Rudolf Fleischer, Marja Kuittinen, Myles F. McNally:
Evaluating the educational impact of visualization. ACM SIGCSE Bull. 35(4): 124-136 (2003) - [c25]Qiling Xie, Chin-Tau A. Lea, Mordecai J. Golin, Rudolf Fleischer:
Maximum residual energy routing with reverse energy cost. GLOBECOM 2003: 564-569 - [c24]Rudolf Fleischer, Gerhard Trippen:
Experimental Studies of Graph Traversal Algorithms. WEA 2003: 120-133 - 2002
- [j16]Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-colorings. Discret. Math. 254(1-3): 19-32 (2002) - [j15]Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro:
Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 12(4): 283-296 (2002) - [c23]Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer:
Solitaire Clobber. Computers and Games 2002: 188-200 - [e1]Rudolf Fleischer, Bernard M. E. Moret, Erik Meineche Schmidt:
Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000]. Lecture Notes in Computer Science 2547, Springer 2002, ISBN 3-540-00346-0 [contents] - [i3]Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
Traveling Salesmen in the Presence of Competition. CoRR cs.CC/0212001 (2002) - [i2]Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer:
Solitaire Clobber. CoRR cs.DM/0204017 (2002) - 2001
- [j14]Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen:
Optimal Robot Localization in Trees. Inf. Comput. 171(2): 224-247 (2001) - [j13]Rudolf Fleischer:
On the Bahncard problem. Theor. Comput. Sci. 268(1): 161-174 (2001) - [c22]Rudolf Fleischer, Ludek Kucera:
Algorithm Animation for Teaching. Software Visualization 2001: 113-128 - [c21]Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov:
Tight Bounds on Maximal and Maximum Matchings. ISAAC 2001: 308-319 - [i1]Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro:
The Complexity of Clickomania. CoRR cs.CC/0107031 (2001) - 2000
- [j12]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27(1): 87-99 (2000) - [j11]Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore:
Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. 76(4-6): 155-162 (2000) - [c20]Rudolf Fleischer, Steven S. Seiden:
New results for online page replication. APPROX 2000: 144-154 - [c19]Rudolf Fleischer, Gerhard Trippen:
Optimal robot localization in trees. SCG 2000: 373-374 - [c18]Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup:
Using Finite Experiments to Study Asymptotic Performance. Experimental Algorithmics 2000: 93-126 - [c17]Rudolf Fleischer, Michaela Wahl:
Online Scheduling Revisited. ESA 2000: 202-210 - [c16]Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz:
Online Routing in Convex Subdivisions. ISAAC 2000: 47-59 - [c15]Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang:
Balanced k-Colorings. MFCS 2000: 202-211 - [c14]Peter Sanders, Rudolf Fleischer:
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. WAE 2000: 135-146
1990 – 1999
- 1999
- [j10]Rudolf Fleischer:
Decision Trees: Old and New Results. Inf. Comput. 152(1): 44-61 (1999) - [c13]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
Efficient Exact Geometric Computation Made Easy. SCG 1999: 341-350 - [c12]Rudolf Fleischer, Colin Hirsch:
Graph Drawing and Its Applications. Drawing Graphs 1999: 1-22 - 1998
- [c11]Rudolf Fleischer:
On The Bahncard Problem. COCOON 1998: 65-74 - 1997
- [j9]Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid:
More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms 23(2): 386-400 (1997) - [c10]Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen:
Episode Matching. CPM 1997: 12-27 - [c9]Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. SODA 1997: 702-709 - 1996
- [j8]Rudolf Fleischer:
A Simple Balanced Search Tree with O(1) Worst-Case Update Time. Int. J. Found. Comput. Sci. 7(2): 137-150 (1996) - [j7]Noga Alon, Phillip G. Bradford, Rudolf Fleischer:
Matching Nuts and Bolts Faster. Inf. Process. Lett. 59(3): 123-127 (1996) - 1995
- [j6]Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn:
A Communication-Randomness Tradeoff for Two-Processor Systems. Inf. Comput. 116(2): 155-161 (1995) - [c8]Phillip G. Bradford, Rudolf Fleischer:
Matching Nuts and Bolts Faster. ISAAC 1995: 402-408 - 1994
- [j5]Rudolf Fleischer:
A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort. Algorithmica 11(2): 104-115 (1994) - 1993
- [b1]Rudolf Fleischer:
Genaue Analyse einiger kombinatorischer Algorithmen. Saarland University, Saarbrücken, Germany, 1993, pp. 1-99 - [j4]Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig:
A Lower Bound for the Worst Case of Bottom-Up-Heapsort. Inf. Comput. 102(2): 263-279 (1993) - [c7]Rudolf Fleischer:
A Simple Balanced Search Tree with O(1) Worst-Case Update Time. ISAAC 1993: 138-146 - [c6]Rudolf Fleischer:
Decision trees: old and new results. STOC 1993: 468-477 - 1992
- [j3]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992) - [j2]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. Algorithmica 8(5&6): 391-406 (1992) - [c5]Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig:
Selected Topics from Computational Geometry, Data Structures and Motion Planning. Data Structures and Efficient Algorithms 1992: 25-43 - 1991
- [c4]Rudolf Fleischer:
A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort. ISA 1991: 251-262 - 1990
- [c3]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
On Simultaneous Inner and Outer Approximation of Shapes. SCG 1990: 216-224 - [c2]Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig:
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures. SCG 1990: 281-289 - [c1]Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn:
A Time-Randomness Tradeoff for Communication Complexity. WDAG 1990: 390-401
1980 – 1989
- 1989
- [j1]Rudolf Fleischer:
Communication Complexity of Multi-Processor Systems. Inf. Process. Lett. 30(2): 57-65 (1989)
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-07-03 20:44 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:
