default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEduardo Sany Laber
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j41]Matheus Werner
, Eduardo Sany Laber:
Extracting section structure from resumes in Brazilian Portuguese. Expert Syst. Appl. 242: 122495 (2024)- [j40]Eduardo Sany Laber:
The computational complexity of some explainable clustering problems. Inf. Process. Lett. 184: 106437 (2024) - [c53]Sanjoy Dasgupta, Eduardo Sany Laber:
New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering. ICML 2024 - [i16]Eduardo Sany Laber, Lucas Murtinho:
Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints. CoRR abs/2401.07091 (2024) - [i15]Sanjoy Dasgupta, Eduardo Sany Laber:
New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering. CoRR abs/2405.00937 (2024) - 2023
- [j39]Eduardo Sany Laber, Lucas Murtinho, Felipe Oliveira:
Shallow decision trees for explainable k-means clustering. Pattern Recognit. 137: 109239 (2023) - [j38]Sérgio Freitas, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro:
Time-constrained learning. Pattern Recognit. 142: 109672 (2023) - [j37]Eduardo Sany Laber, Lucas Murtinho:
Nearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problems. Theor. Comput. Sci. 949: 113744 (2023) - [c52]Lucas Pavanelli, Yohan Bonescki Gumiel, Thiago Castro Ferreira, Adriana S. Pagano, Eduardo Sany Laber:
Bete: A Brazilian Portuguese Dataset for Named Entity Recognition and Relation Extraction in the Diabetes Healthcare Domain. BRACIS (3) 2023: 256-267 - [c51]Eduardo Sany Laber, Lucas Murtinho:
Optimization of Inter-group criteria for clustering with minimum size constraints. NeurIPS 2023 - 2022
- [c50]Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
Decision Trees with Short Explainable Rules. NeurIPS 2022 - [i14]Sergio Filho, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro:
Time-Constrained Learning. CoRR abs/2202.01913 (2022) - [i13]Eduardo Sany Laber:
The computational complexity of some explainable clustering problems. CoRR abs/2208.09643 (2022) - 2021
- [j36]Ferdinando Cicalese, Eduardo Sany Laber:
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem. Discret. Appl. Math. 289: 503-515 (2021) - [j35]Ferdinando Cicalese, Eduardo Sany Laber:
Information Theoretical Clustering Is Hard to Approximate. IEEE Trans. Inf. Theory 67(1): 586-597 (2021) - [c49]Eduardo Sany Laber, Lucas Murtinho:
On the price of explainability for some clustering problems. ICML 2021: 5915-5925 - [i12]Eduardo Sany Laber, Lucas Murtinho:
On the price of explainability for some clustering problems. CoRR abs/2101.01576 (2021) - [i11]Eduardo Sany Laber, Lucas Murtinho, Felipe Oliveira:
Shallow decision trees for explainable k-means clustering. CoRR abs/2112.14718 (2021) - 2020
- [c48]Matheus Werner, Eduardo Sany Laber:
Speeding up Word Mover's Distance and Its Variants via Properties of Distances Between Embeddings. ECAI 2020: 2204-2211 - [c47]Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro:
Teaching with Limited Information on the Learner's Behaviour. ICML 2020: 2016-2026
2010 – 2019
- 2019
- [c46]Ferdinando Cicalese, Eduardo Sany Laber, Lucas Murtinho:
New results on information theoretic clustering. ICML 2019: 1242-1251 - [c45]Eduardo Sany Laber, Lucas Murtinho:
Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem. LAGOS 2019: 567-576 - [i10]Matheus Werner, Eduardo Sany Laber:
Speeding up Word Mover's Distance and its variants via properties of distances between embeddings. CoRR abs/1912.00509 (2019) - 2018
- [j34]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems. Algorithmica 80(11): 3431-3436 (2018) - [j33]Eduardo Sany Laber, Felipe de A. Mello Pereira:
Splitting criteria for classification problems with multi-valued attributes and large number of classes. Pattern Recognit. Lett. 111: 58-63 (2018) - [c44]Eduardo Sany Laber, Marco Molinaro, Felipe de A. Mello Pereira:
Binary Partitions with Approximate Minimum Impurity. ICML 2018: 2860-2868 - [i9]Ferdinando Cicalese, Eduardo Sany Laber:
Approximation Algorithms for Clustering via Weighted Impurity Measures. CoRR abs/1807.05241 (2018) - [i8]Eduardo Sany Laber, Lucas Murtinho:
Minimization of Gini impurity via connections with the k-means problem. CoRR abs/1810.00029 (2018) - [i7]Ferdinando Cicalese, Eduardo Sany Laber:
Information theoretical clustering is hard to approximate. CoRR abs/1812.07075 (2018) - 2017
- [j32]Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost. Algorithmica 79(3): 763-796 (2017) - [j31]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Trading Off Worst and Expected Cost in Decision Tree Problems. Algorithmica 79(3): 886-908 (2017) - [j30]Pedro Moura, Eduardo Sany Laber, Hélio Lopes, Daniel Mesejo, Lucas Pavanelli, João Jardim, Francisco Thiesen, Gabriel Pujol:
LSHSIM: A Locality Sensitive Hashing based method for multiple-point geostatistics. Comput. Geosci. 107: 49-60 (2017) - [j29]Aline Medeiros Saettler, Eduardo Sany Laber, Felipe de A. Mello Pereira:
Decision tree classification with bounded number of errors. Inf. Process. Lett. 127: 27-31 (2017) - 2016
- [c43]Eduardo Sany Laber, Pedro Moura, Lucas Pavanelli:
On Compression Techniques for Computing Convolutions. DCC 2016: 359-368 - 2015
- [j28]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Approximating decision trees with value dependent testing costs. Inf. Process. Lett. 115(6-8): 594-599 (2015) - [c42]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Trading off Worst and Expected Cost in Decision Tree Problems. ISAAC 2015: 223-234 - [i6]Wilfredo Bardales Roncalla, Eduardo Sany Laber, Ferdinando Cicalese:
Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. CoRR abs/1509.05445 (2015) - 2014
- [j27]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Algorithmica 68(4): 1045-1074 (2014) - [j26]Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster:
Approximating the maximum consecutive subsums of a sequence. Theor. Comput. Sci. 525: 130-137 (2014) - [c41]Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost. ICML 2014: 414-422 - [c40]Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. ISAIM 2014 - [c39]Eduardo Sany Laber, Wilfredo Bardales Roncalla, Ferdinando Cicalese:
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. ISIT 2014: 1807-1811 - [i5]Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model. CoRR abs/1406.3655 (2014) - 2013
- [c38]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE 2013: 56-63 - [i4]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. CoRR abs/1304.5560 (2013) - [i3]Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Decision Trees for the efficient evaluation of discrete functions: worst case and expected case analysis. CoRR abs/1309.2796 (2013) - 2012
- [j25]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim:
The binary identification problem for weighted trees. Theor. Comput. Sci. 459: 100-112 (2012) - [c37]Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster:
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence. CPM 2012: 149-158 - [c36]Caio Dias Valentim, Eduardo Sany Laber, David Sotelo:
Data Structures for Detecting Rare Variations in Time Series. ECML/PKDD (2) 2012: 709-724 - 2011
- [j24]Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes:
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). Algorithmica 59(1): 1-2 (2011) - [j23]Eduardo Sany Laber, Marco Molinaro:
An Approximation Algorithm for Binary Searching in Trees. Algorithmica 59(4): 601-620 (2011) - [j22]Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic:
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. Discret. Appl. Math. 159(11): 1070-1078 (2011) - [j21]Ferdinando Cicalese, Eduardo Sany Laber:
On the competitive ratio of evaluating priced functions. J. ACM 58(3): 9:1-9:40 (2011) - [j20]Eduardo Sany Laber, Marco Molinaro:
Improved approximations for the hotlink assignment problem. ACM Trans. Algorithms 7(3): 39:1-39:34 (2011) - [j19]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. 412(50): 6879-6896 (2011) - [c35]Eduardo Teixeira Cardoso, Iam Vita Jabour, Eduardo Sany Laber, Rogério Rodrigues, Pedro Cardoso:
An efficient language-independent method to extract content from news webpages. ACM Symposium on Document Engineering 2011: 121-128 - [c34]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim:
Binary Identification Problems for Weighted Trees. WADS 2011: 255-266 - 2010
- [c33]Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) 2010: 527-539 - [c32]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On Greedy Algorithms for Decision Trees. ISAAC (2) 2010: 206-217 - [i2]Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic:
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case. CoRR abs/1006.4136 (2010)
2000 – 2009
- 2009
- [c31]Eduardo Sany Laber, Críston Pereira de Souza, Iam Vita Jabour, Evelin Carvalho Freire de Amorim, Eduardo Teixeira Cardoso, Raúl P. Rentería, Lúcio Cunha Tinoco, Caio Dias Valentim:
A fast and simple method for extracting relevant content from news webpages. CIKM 2009: 1685-1688 - [c30]Bruno Tenório Ávila, Eduardo Sany Laber:
Merge source coding. ISIT 2009: 214-218 - [i1]Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
On the Complexity of Searching in Trees: Average-case Minimization. CoRR abs/0904.3503 (2009) - 2008
- [j18]Eduardo Sany Laber:
A randomized competitive algorithm for evaluating priced AND/OR trees. Theor. Comput. Sci. 401(1-3): 120-130 (2008) - [c29]Ferdinando Cicalese, Eduardo Sany Laber:
Function Evaluation Via Linear Programming in the Priced Information Model. ICALP (1) 2008: 173-185 - [c28]Eduardo Sany Laber, Marco Molinaro:
An Approximation Algorithm for Binary Searching in Trees. ICALP (1) 2008: 459-471 - [e1]Eduardo Sany Laber, Claudson F. Bornstein, Loana Tito Nogueira, Luérbio Faria:
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings. Lecture Notes in Computer Science 4957, Springer 2008, ISBN 978-3-540-78772-3 [contents] - 2007
- [j17]Vaston G. Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira:
A note on the size of minimal covers. Inf. Process. Lett. 102(2-3): 124-126 (2007) - [j16]Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas:
Querying priced information in databases: The conjunctive case. ACM Trans. Algorithms 3(1): 9:1-9:22 (2007) - [j15]Ornan Ori Gerstel, Shay Kutten, Eduardo Sany Laber, Rachel Matichin, David Peleg, Artur Alves Pessoa, Críston P. de Souza:
Reducing human interactions in Web directory searches. ACM Trans. Inf. Syst. 25(4): 20 (2007) - [c27]Críston P. de Souza, Eduardo Sany Laber, Caio Dias Valentim, Eduardo Teixeira Cardoso:
A Polite Policy for Revisiting Web Pages. LA-WEB 2007: 128-135 - 2006
- [c26]Eduardo Sany Laber:
Hotlink Assignment on the Web. GTIT-C 2006: 1088-1092 - [c25]Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Mas:
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions. LATIN 2006: 211-223 - [c24]Ferdinando Cicalese, Eduardo Sany Laber:
On the competitive ratio of evaluating priced functions. SODA 2006: 944-953 - 2005
- [j14]Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más:
Randomized mechanisms for limited supply multi-item auctions. Electron. Notes Discret. Math. 19: 141-147 (2005) - [c23]Ferdinando Cicalese, Eduardo Sany Laber:
An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees. ESA 2005: 664-676 - [c22]Ferdinando Cicalese, Eduardo Sany Laber:
A new strategy for querying priced information. STOC 2005: 674-683 - 2004
- [j13]Eduardo Sany Laber, Loana Tito Nogueira:
On the hardness of the minimum height decision tree problem. Discret. Appl. Math. 144(1-2): 209-212 (2004) - [j12]Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber:
Searching in random partially ordered sets. Theor. Comput. Sci. 321(1): 41-57 (2004) - [c21]Artur Alves Pessoa, Eduardo Sany Laber, Críston P. de Souza:
Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. ALENEX/ANALC 2004: 79-87 - [c20]Artur Alves Pessoa, Eduardo Sany Laber, Críston P. de Souza:
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. ISAAC 2004: 778-792 - [c19]Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa:
Querying Priced Information in Databases: The Conjunctive Case. LATIN 2004: 6-15 - [c18]Eduardo Sany Laber:
A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees. STACS 2004: 501-512 - 2003
- [j11]Eduardo Sany Laber, Emerson L. Monte Carmelo:
A Note on multicolor bipartite Ramsey numbers for K_{2, n}. Ars Comb. 69 (2003) - [j10]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
The complexity of makespan minimization for pipeline transportation. Theor. Comput. Sci. 306(1-3): 339-351 (2003) - [c17]Ruy Luiz Milidiú, Eduardo Sany Laber, Lorenza O. Moreno, Julio C. Duarte:
A fast decoding method for prefix codes. DCC 2003: 438 - [c16]Fábio Porto, Eduardo Sany Laber, Patrick Valduriez:
Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates. SBBD 2003: 356-370 - 2002
- [j9]Eduardo Sany Laber, Leonardo Gomes Holanda:
Improved bounds for asymmetric communication protocols. Inf. Process. Lett. 83(4): 205-209 (2002) - [j8]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
On Binary Searching with Nonuniform Costs. SIAM J. Comput. 31(4): 1022-1047 (2002) - [j7]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
A strategy for searching with different access costs. Theor. Comput. Sci. 287(2): 571-584 (2002) - [c15]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. APPROX 2002: 243-255 - [c14]Eduardo Sany Laber, Ojas Parekh, R. Ravi:
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. ESA 2002: 649-661 - [c13]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Pipeline Transportation of Petroleum Products with No Due Dates. LATIN 2002: 248-262 - [c12]Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber:
Searching in Random Partially Ordered Sets. LATIN 2002: 278-292 - 2001
- [j6]Ruy Luiz Milidiú, Eduardo Sany Laber:
Bounding the Inefficiency of Length-Restricted Prefix Codes. Algorithmica 31(4): 513-529 (2001) - [j5]Eduardo Sany Laber, Leonardo Gomes Holanda:
On asymmetric communication protocols. Electron. Notes Discret. Math. 7: 6-9 (2001) - [j4]Eduardo Sany Laber, Loana Tito Nogueira:
Fast Searching in Trees. Electron. Notes Discret. Math. 7: 90-93 (2001) - [j3]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Three space-economical algorithms for calculating minimum-redundancy prefix codes. IEEE Trans. Inf. Theory 47(6): 2185-2198 (2001) - [c11]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
On binary searching with non-uniform costs. SODA 2001: 855-864 - 2000
- [j2]Ruy Luiz Milidiú, Eduardo Sany Laber:
The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes. SIAM J. Comput. 30(5): 1405-1426 (2000) - [c10]Ruy Luiz Milidiú, Eduardo Sany Laber:
Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract). LATIN 2000: 227-236 - [c9]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber, Raúl P. Rentería:
Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs. SPIRE 2000: 229-235
1990 – 1999
- 1999
- [b1]Eduardo Sany Laber:
CóDigos de Prefixo: Algoritmos E Cotas. Pontifical Catholic University of Rio de Janeiro, Brazil, 1999 - [j1]Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa:
Bounding the Compression Loss of the FGK Algorithm. J. Algorithms 32(2): 195-211 (1999) - [c8]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. ALENEX 1999: 1-17 - [c7]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. Data Compression Conference 1999: 267-276 - [c6]Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa:
A Work Efficient Parallel Algorithm for Constructing Huffman Codes. Data Compression Conference 1999: 277-286 - [c5]Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa:
Bounding the Compression Loss of the FGK Algorithm. Data Compression Conference 1999: 539 - [c4]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
Strategies for Searching with Different Access Costs. ESA 1999: 236-247 - [c3]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
Practical Constructions of L-restricted Alphabetic Prefix Codes. SPIRE/CRIWG 1999: 115-119 - [c2]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. SPIRE/CRIWG 1999: 128-134 - 1998
- [c1]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
In-Place Length-Restricted Prefix Coding. SPIRE 1998: 50-59
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-09-04 00:30 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:
