![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Alberto Bertoni
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j51]Jianyi Lin
, Alberto Bertoni, Massimiliano Goldwurm:
Exact algorithms for size constrained 2-clustering in the plane. Theor. Comput. Sci. 629: 80-95 (2016) - 2015
- [j50]Marco Frasca
, Alberto Bertoni, Giorgio Valentini
:
UNIPred: Unbalance-Aware Network Integration and Prediction of Protein Functions. J. Comput. Biol. 22(12): 1057-1074 (2015) - [c55]Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin:
Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane. SOFSEM 2015: 128-139 - 2014
- [j49]Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro:
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages. Int. J. Found. Comput. Sci. 25(8): 1065-1082 (2014) - [c54]Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin, Linda Pini:
Size-constrained 2-clustering in the plane with Manhattan distance. ICTCS 2014: 33-44 - 2013
- [j48]Marco Frasca
, Alberto Bertoni, Matteo Re
, Giorgio Valentini
:
A neural network algorithm for semi-supervised node label learning from unbalanced data. Neural Networks 43: 84-98 (2013) - [c53]Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro:
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. Developments in Language Theory 2013: 82-93 - [i1]Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro:
Quantum finite automata and linear context-free languages: a decidable problem. CoRR abs/1303.2967 (2013) - 2012
- [j47]Alberto Bertoni, Massimiliano Goldwurm, Jianyi Lin
, Francesco Saccà:
Size Constrained Distance Clustering: Separation Properties and Some Complexity Results. Fundam. Informaticae 115(1): 125-139 (2012) - [j46]Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro:
Regularity of languages defined by formal series with isolated cut point. RAIRO Theor. Informatics Appl. 46(4): 479-493 (2012) - [c52]Marco Frasca
, Alberto Bertoni, Andrea Sion:
A Neural Procedure for Gene Function Prediction. WIRN 2012: 179-188 - 2011
- [j45]Alberto Bertoni, Christian Choffrut, Roberto Radicioni:
The Inclusion Problem of Context-Free Languages: Some Tractable Cases. Int. J. Found. Comput. Sci. 22(2): 289-299 (2011) - [j44]Marco Muselli, Alberto Bertoni, Marco Frasca
, Alessandro Beghini
, Francesca Ruffino, Giorgio Valentini
:
A Mathematical Model for the Validation of Gene Selection Methods. IEEE ACM Trans. Comput. Biol. Bioinform. 8(5): 1385-1392 (2011) - [c51]Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro:
Regularity of Languages Defined by Formal Series with Isolated Cut Point. NCMA 2011: 73-87 - [c50]Alberto Bertoni, Marco Frasca
, Giorgio Valentini
:
COSNet: A Cost Sensitive Neural Network for Semi-supervised Learning in Graphs. ECML/PKDD (1) 2011: 219-234 - [c49]Alberto Bertoni, Matteo Re, Francesco Saccà, Giorgio Valentini:
Identification of promoter regions in genomic sequences by 1-dimensional constraint clustering. WIRN 2011: 162-169 - 2010
- [j43]Roberto Radicioni, Alberto Bertoni:
Grammatical compression: compressed equivalence and other problems. Discret. Math. Theor. Comput. Sci. 12(4): 109-126 (2010) - [j42]Alberto Bertoni, Carlo Mereghetti
, Beatrice Palano
:
Trace monoids with idempotent generators and measure-only quantum automata. Nat. Comput. 9(2): 383-395 (2010) - [c48]Alberto Bertoni, Marco Frasca
, Giuliano Grossi
, Giorgio Valentini
:
Learning functional linkage networks with a cost-sensitive approach. WIRN 2010: 52-61
2000 – 2009
- 2009
- [j41]Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati
:
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases. Fundam. Informaticae 91(2): 231-249 (2009) - [c47]Alberto Bertoni, Christian Choffrut, Roberto Radicioni:
The Inclusion Problem of Context-Free Languages: Some Tractable Cases. Developments in Language Theory 2009: 103-112 - 2008
- [j40]Alberto Bertoni, Giorgio Valentini
:
Discovering multi-level structures in bio-molecular data through the Bernstein inequality. BMC Bioinform. 9(S-2) (2008) - [j39]Alberto Bertoni, Roberto Radicioni:
Approximating the Mean Speedup in Trace Monoids. Int. J. Found. Comput. Sci. 19(3): 497-511 (2008) - [c46]Alberto Bertoni, Giorgio Valentini
:
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data. CIBB 2008: 25-43 - [c45]Alberto Bertoni, Christian Choffrut, Roberto Radicioni:
Literal Shuffle of Compressed Words. IFIP TCS 2008: 87-100 - [c44]Alberto Bertoni, Raffaella Folgieri
, Giorgio Valentini
:
Classification of DNA microarray data with Random Projection Ensembles of Polynomial SVMs. WIRN 2008: 60-66 - [c43]Stefano Arca, Alberto Bertoni, Giuseppe Lipori:
Random projections preserving the Hamming distance between words. WIRN 2008: 148-153 - [e2]Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková:
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings. Lecture Notes in Computer Science 4910, Springer 2008, ISBN 978-3-540-77565-2 [contents] - [e1]Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková:
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II - Student Research Forum. Safarik University, Kosice, Slovakia 2008, ISBN 978-80-7097-697-5 [contents] - 2007
- [j38]Alberto Bertoni, Giorgio Valentini
:
Model order selection for bio-molecular data clustering. BMC Bioinform. 8(S-2) (2007) - [c42]Alberto Bertoni, Roberto Radicioni:
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids. Developments in Language Theory 2007: 72-83 - [c41]Alberto Bertoni, Giorgio Valentini:
Discovering Significant Structures in Clustered Bio-molecular Data Through the Bernstein Inequality. KES (3) 2007: 886-891 - [c40]Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati:
On the Complexity of Unary Tiling-Recognizable Picture Languages. STACS 2007: 381-392 - 2006
- [j37]Alberto Bertoni, Giorgio Valentini
:
Randomized maps for assessing the reliability of patients clusters in DNA microarray data analyses. Artif. Intell. Medicine 37(2): 85-109 (2006) - [j36]Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
:
Local Limit Properties for Pattern Statistics and Rational Models. Theory Comput. Syst. 39(1): 209-235 (2006) - [j35]Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki:
Preface. Theor. Comput. Sci. 356(1-2): 1-5 (2006) - [j34]Alberto Bertoni, Carlo Mereghetti
, Beatrice Palano
:
Some formal tools for analyzing quantum automata. Theor. Comput. Sci. 356(1-2): 14-25 (2006) - [c39]Alberto Bertoni, Christian Choffrut, Beatrice Palano
:
Context-Free Grammars and XML Languages. Developments in Language Theory 2006: 108-119 - 2005
- [j33]Alberto Bertoni, Raffaella Folgieri
, Giorgio Valentini
:
Bio-molecular cancer prediction with random subspace ensembles of support vector machines. Neurocomputing 63: 535-539 (2005) - [j32]Alberto Bertoni, Carlo Mereghetti
, Beatrice Palano
:
Small size quantum automata recognizing some regular languages. Theor. Comput. Sci. 340(1): 394-407 (2005) - [c38]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Some formal methods for analyzing quantum automata. DCFS 2005: 1-14 - [c37]Alberto Bertoni, Paola Campadelli, Roberto Posenato
:
Analysis of a Genetic Model with Finite Populations. ICNC (3) 2005: 235-244 - [c36]Alberto Bertoni, Giorgio Valentini
:
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms. WIRN/NAIS 2005: 31-37 - 2004
- [c35]Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. STACS 2004: 117-128 - [c34]Alberto Bertoni, Raffaella Folgieri
, Giorgio Valentini:
Feature Selection Combined with Random Subspace Ensemble for Gene Expression Based Diagnosis of Malignancies. WIRN 2004: 29-35 - 2003
- [j31]Alberto Bertoni, Carlo Mereghetti
, Beatrice Palano
:
Golomb Rulers And Difference Sets For Succinct Quantum Automata. Int. J. Found. Comput. Sci. 14(5): 871-888 (2003) - [j30]Paolo Bordone
, Alberto Bertoni, Rossella Brunetti
, Carlo Jacoboni:
Monte Carlo simulation of quantum electron transport based on Wigner paths. Math. Comput. Simul. 62(3-6): 307-314 (2003) - [j29]Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
:
On the number of occurrences of a symbol in words of regular languages. Theor. Comput. Sci. 302(1-3): 431-456 (2003) - [c33]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Quantum Computing: 1-Way Quantum Automata. Developments in Language Theory 2003: 1-20 - [c32]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. ICTCS 2003: 86-96 - 2002
- [j28]Alberto Bertoni, Paola Campadelli, Giuliano Grossi
:
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation. Algorithmica 33(1): 71-88 (2002) - [c31]Alberto Bertoni, Beatrice Palano:
Structural Complexity and Neural Networks. WIRN 2002: 190-215 - 2001
- [j27]Alberto Bertoni, Paola Campadelli, Giuliano Grossi
:
An approximation algorithm for the maximum cut problem and its experimental analysis. Discret. Appl. Math. 110(1): 3-12 (2001) - [j26]Alberto Bertoni, Marco Carpentieri:
Regular Languages Accepted by Quantum Automata. Inf. Comput. 165(2): 174-182 (2001) - [j25]Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini
:
Random Generation for Finitely Ambiguous Context-free Languages. RAIRO Theor. Informatics Appl. 35(6): 499-512 (2001) - [j24]Alberto Bertoni, Marco Carpentieri:
Analogies and differences between quantum and stochastic automata. Theor. Comput. Sci. 262(1): 69-81 (2001) - [j23]Alberto Bertoni, Paolo Bordone, Rossella Brunetti, Carlo Jacoboni, Susanna Reggiani:
Numerical Simulation of Quantum Logic Gates Based on Quantum Wires. VLSI Design 13(1-4): 97-102 (2001) - [j22]Paolo Bordone, Alberto Bertoni, Rossella Brunetti, Carlo Jacoboni:
Wigner Paths Method in Quantum Transport with Dissipation. VLSI Design 13(1-4): 211-220 (2001) - [j21]Rossella Brunetti, Alberto Bertoni, Paolo Bordone, Carlo Jacoboni:
Dynamical Equation and Monte Carlo Simulation of the Two-time Wigner Function for Electron Quantum Transport. VLSI Design 13(1-4): 375-380 (2001) - [c30]Alberto Bertoni, Giuliano Grossi, Alessandro Provetti, Vladik Kreinovich, Luis Tari:
The Prospect for Answer Sets Computation by a Genetic Model. Answer Set Programming 2001 - [c29]Alberto Bertoni, Paola Campadelli, Giuliano Grossi:
Solving Min Vertex Cover with Iterated Hopfield Networks. WIRN 2001: 87-95 - 2000
- [j20]Alberto Bertoni, Paola Campadelli, Marco Carpentieri, Giuliano Grossi
:
A Genetic Model: Analysis and Application to MAXSAT. Evol. Comput. 8(3): 291-309 (2000) - [c28]Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. STACS 2000: 567-580
1990 – 1999
- 1998
- [j19]Alberto Bertoni, Paolo Massazza:
On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages. RAIRO Theor. Informatics Appl. 32(1-3): 79-98 (1998) - 1997
- [j18]Alberto Bertoni, Paola Campadelli, Cristina Gangai, Roberto Posenato
:
Approximability of the Ground State Problem for Certain Ising Spin Glasses. J. Complex. 13(3): 326-329 (1997) - [j17]Maria Alberta Alberti, Alberto Bertoni, Paola Campadelli, Giuliano Grossi
, Roberto Posenato
:
A Neural Algorithm for MAX-2SAT: Performance Analysis and Circuit Implementation. Neural Networks 10(3): 555-560 (1997) - [c27]Alberto Bertoni, Paola Campadelli, M. Parodi:
A Boosting Algorithm for Regression. ICANN 1997: 343-348 - [c26]Alberto Bertoni, Paola Campadelli, Marco Carpentieri, Giuliano Grossi:
Analysis of a Genetic Model. ICGA 1997: 121-126 - [c25]Alberto Bertoni, Paola Campadelli, Giuliano Grossi:
A Discrete Neural Algorithm for the Maximum Clique Problem: Analysis and Circuit Implementation. WAE 1997: 84-91 - [c24]Alberto Bertoni, Paola Campadelli, Roberto Posenato
:
An Upper Bound for the Maximum Cut Mean Value. WG 1997: 78-84 - 1996
- [c23]Alberto Bertoni, Paola Campadelli, Marco Carpentieri, Giuliano Grossi
:
A Genetic Model and the Hopfield Networks. ICANN 1996: 463-468 - 1995
- [j16]Alberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino:
Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions. Inf. Process. Lett. 56(1): 15-17 (1995) - [c22]Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. MFCS 1995: 309-318 - [c21]Maria Alberta Alberti, Alberto Bertoni, Paola Campadelli, Giuliano Grossi
, Roberto Posenato
:
A neural circuit for the maximum 2-satisfiability problem. PDP 1995: 319-323 - [p1]Alberto Bertoni, Massimiliano Goldwurm, Giancarlo Mauri, Nicoletta Sabadini:
Counting Techniques for Inclusion, Equivalence and Membership Problems. The Book of Traces 1995: 131-163 - 1994
- [j15]Alberto Bertoni, Paolo Massazza:
A Parallel Algorithm for the Hadamard Product of Holonomic Formal Series. Int. J. Algebra Comput. 4(4): 561-574 (1994) - [j14]Alberto Bertoni, Carlo Mereghetti
, Giovanni Pighizzini
:
An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 50(6): 289-292 (1994) - [j13]Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
Corrigendum: An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 52(6): 339 (1994) - [c20]Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. MFCS 1994: 245-255 - 1993
- [j12]Alberto Bertoni, Marco Dorigo
:
Implicit Parallelism in Genetic Algorithms. Artif. Intell. 61(2): 307-314 (1993) - [j11]Alberto Bertoni, Massimiliano Goldwurm:
On Ranking 1-Way Finitely Ambiguous NL Languages and #P1-Complete Census Functions. RAIRO Theor. Informatics Appl. 27(2): 135-148 (1993) - 1992
- [j10]Alberto Bertoni, Paolo Massazza, Nicoletta Sabadini:
Holonomic Generating Functions and Context Free Languages. Int. J. Found. Comput. Sci. 3(2): 181-191 (1992) - [c19]Alberto Bertoni, Paola Campadelli, Anna Morpurgo, Sandra Panizza:
Polynomial Iniform Convergence and Polynomial-Sample Learnability. COLT 1992: 265-271 - 1991
- [j9]Bruno Apolloni, Alberto Bertoni, Paola Campadelli, Diego de Falco:
Asymmetric Boltzmann machines. Biol. Cybern. 66(1): 61-70 (1991) - [j8]Alberto Bertoni, Paola Campadelli, Giancarlo Mauri:
Some Notes on Computational Learing Theory. Bull. EATCS 43: 140-158 (1991) - [j7]Alberto Bertoni, Danilo Bruschi, Massimiliano Goldwurm:
Ranking and Formal Power Series. Theor. Comput. Sci. 79(1): 25-35 (1991) - [j6]Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages. Theor. Comput. Sci. 86(2): 325-342 (1991) - [c18]Alberto Bertoni, Paola Campadelli, Anna Morpurgo, Sandra Panizza:
Polynomial Uniform Convergence of Relative Frequencies to Probabilities. NIPS 1991: 904-911 - 1990
- [j5]Alberto Bertoni, Massimiliano Goldwurm, Paolo Massazza:
Counting Problems and Algebraic Formal Power Series in Noncommuting Variables. Inf. Process. Lett. 34(3): 117-121 (1990)
1980 – 1989
- 1989
- [j4]Alberto Bertoni, Giancarlo Mauri
, Nicoletta Sabadini:
Membership Problems for Regular and Context-Free Trace Languages. Inf. Comput. 82(2): 135-150 (1989) - [c17]Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). FCT 1989: 35-46 - 1988
- [j3]Alberto Bertoni, Nicoletta Sabadini:
Generating functions of trace languages. Bull. EATCS 35: 106-112 (1988) - 1987
- [c16]Alberto Bertoni, Massimiliano Goldwurm:
On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages. AAECC 1987: 35-59 - [c15]Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
Computing the Counting Function of Context-Free Languages. STACS 1987: 169-179 - 1986
- [c14]Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
Analysis of a Class of Algorithms for Problems on Trace Languages. AAECC 1986: 202-214 - [c13]Alberto Bertoni, Massimiliano Goldwurm, Giancarlo Mauri
, Nicoletta Sabadini:
Parallel Algorithms and the Classification of Problems. WOPPLOT 1986: 206-226 - 1984
- [c12]Alberto Bertoni, Giancarlo Mauri
, Pierangelo Miglioli, Mario Ornaghi:
Abstract Data Types and Their Extensions within a Constructive Logic. Semantics of Data Types 1984: 177-195 - 1982
- [c11]Alberto Bertoni, Giancarlo Mauri
, Nicoletta Sabadini:
Equivalence and Membership Problems for Regular Trace Languages. ICALP 1982: 61-71 - 1981
- [j2]Alberto Bertoni, Giancarlo Mauri
:
On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems. Inf. Process. Lett. 12(3): 142-145 (1981) - [c10]Alberto Bertoni, Marco Brambilla, Giancarlo Mauri
, Nicoletta Sabadini:
An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace Languages. MFCS 1981: 205-215 - [c9]Alberto Bertoni, Giancarlo Mauri
, Nicoletta Sabadini:
A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines. STOC 1981: 168-176 - 1980
- [c8]Alberto Bertoni, Giancarlo Mauri
, Pierangelo Miglioli:
Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools. Symposium on Programming 1980: 44-58
1970 – 1979
- 1979
- [j1]Alberto Bertoni, Giancarlo Mauri
, Mauro Torelli:
Three Efficient Algorithms for Counting Problems. Inf. Process. Lett. 8(1): 50-53 (1979) - [c7]Alberto Bertoni, Giancarlo Mauri
, Pierangelo Miglioli:
A Characterization of Abstract Data as Model-Theoretic Invariants. ICALP 1979: 26-37 - 1977
- [c6]Alberto Bertoni, Giancarlo Mauri
, Mauro Torelli:
Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata. ICALP 1977: 87-94 - [c5]Alberto Bertoni, Giancarlo Mauri
, Mauro Torelli:
An Algebraic Approach to Problem Solution and Problem Semantics. MFCS 1977: 253-262 - 1974
- [c4]Alberto Bertoni:
The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages Theory. GI Jahrestagung 1974: 107-112 - [c3]Alberto Bertoni:
Mathematical Methods of the Theory of Stochastic Automata. MFCS 1974: 9-22 - 1973
- [c2]Alberto Bertoni:
Equations of Formal Power Series over Non Commutative Semiring. MFCS 1973: 185-190 - 1972
- [c1]Alberto Bertoni:
Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines. ICALP 1972: 507-516
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint