default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Pietracaprina
Person information
- affiliation: University of Padua, Department of Information Engineering, Padua, Italy
- affiliation: Brown University, Department of Computer Science, Providence RI, USA
- affiliation (PhD 1994): University of Illinois at Urbana-Champaign, IL, USA
- affiliation: University of Pisa, Department of Computer Science, Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Enrico Dandolo, Alessio Mazzetto, Andrea Pietracaprina
, Geppino Pucci:
MapReduce algorithms for robust center-based clustering in doubling metrics. J. Parallel Distributed Comput. 194: 104966 (2024)- [c49]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
Fast and Accurate Fair k-Center Clustering in Doubling Metrics. WWW 2024: 756-767 - 2023
- [j38]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Federico Soldà:
Scalable and space-efficient Robust Matroid Center algorithms. J. Big Data 10(1): 49 (2023) - [c48]Enrico Dandolo, Andrea Pietracaprina, Geppino Pucci:
Distributed k-Means with Outliers in General Metrics. Euro-Par 2023: 474-488 - [c47]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. WADS 2023: 620-636 - [i21]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Fully dynamic clustering and diversity maximization in doubling metrics. CoRR abs/2302.07771 (2023) - 2022
- [j37]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
k-Center Clustering with Outliers in Sliding Windows. Algorithms 15(2): 52 (2022) - [j36]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Adaptive k-center and diameter estimation in sliding windows. Int. J. Data Sci. Anal. 14(2): 155-173 (2022) - [i20]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
k-Center Clustering with Outliers in Sliding Windows. CoRR abs/2201.02448 (2022) - [i19]Enrico Dandolo, Andrea Pietracaprina, Geppino Pucci:
Distributed k-Means with Outliers in General Metrics. CoRR abs/2202.08173 (2022) - 2021
- [c46]Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin:
Scalable Distributed Approximation of Internal Measures for Clustering Evaluation. SDM 2021: 648-656 - 2020
- [j35]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Distributed Graph Diameter Approximation. Algorithms 13(9): 216 (2020) - [j34]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. ACM Trans. Knowl. Discov. Data 14(5): 60:1-60:27 (2020) - [c45]Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci:
Dimensionality-adaptive k-center in sliding windows. DSAA 2020: 197-206 - [i18]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. CoRR abs/2002.03175 (2020) - [i17]Andrea Pietracaprina, Geppino Pucci, Federico Soldà:
Coreset-based Strategies for Robust Center-type Problems. CoRR abs/2002.07463 (2020) - [i16]Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin:
Scalable Distributed Approximation of Internal Measures for Clustering Evaluation. CoRR abs/2003.01430 (2020)
2010 – 2019
- 2019
- [j33]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially. Proc. VLDB Endow. 12(7): 766-778 (2019) - [c44]Alessio Mazzetto, Andrea Pietracaprina, Geppino Pucci:
Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces. ISAAC 2019: 34:1-34:16 - [i15]Alessio Mazzetto, Andrea Pietracaprina, Geppino Pucci:
Accurate MapReduce Algorithms for $k$-median and $k$-means in General Metric Spaces. CoRR abs/1904.12728 (2019) - 2018
- [c43]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
Fast Coreset-based Diversity Maximization under Matroid Constraints. WSDM 2018: 81-89 - [i14]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially. CoRR abs/1802.09205 (2018) - 2017
- [j32]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. Proc. VLDB Endow. 10(5): 469-480 (2017) - [j31]Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin:
Clustering Uncertain Graphs. Proc. VLDB Endow. 11(4): 472-484 (2017) - 2016
- [j30]Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci:
On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. 199: 101-109 (2016) - [j29]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. J. ACM 63(1): 3:1-3:36 (2016) - [c42]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. IPDPS 2016: 12-21 - [i13]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. CoRR abs/1605.05590 (2016) - [i12]Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin:
Clustering Uncertain Graphs. CoRR abs/1612.06675 (2016) - 2015
- [j28]Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin:
Space-efficient parallel algorithms for combinatorial search problems. J. Parallel Distributed Comput. 76: 58-65 (2015) - [j27]Nicola Lazzarini, Loris Nanni, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Teresa Maria Seccia, Gian Paolo Rossi:
Heterogeneous machine learning system for improving the diagnosis of primary aldosteronism. Pattern Recognit. Lett. 65: 124-130 (2015) - [c41]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. SPAA 2015: 182-191 - [i11]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. CoRR abs/1506.03265 (2015) - 2014
- [i10]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
Network-Oblivious Algorithms. CoRR abs/1404.3318 (2014) - [i9]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. CoRR abs/1407.3144 (2014) - 2013
- [j26]Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci:
On the Expansion and Diameter of Bluetooth-Like Topologies. Theory Comput. Syst. 52(2): 319-339 (2013) - [c40]Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin:
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. MFCS 2013: 717-728 - [i8]Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin:
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. CoRR abs/1306.2552 (2013) - 2012
- [j25]Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin:
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. J. ACM 59(3): 12:1-12:22 (2012) - [c39]Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal:
Space-round tradeoffs for MapReduce computations. ICS 2012: 235-244 - 2011
- [j24]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Strategy for Maximal Dense Motif Extraction. J. Comput. Biol. 18(4): 535-545 (2011) - [c38]Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Tight bounds on information dissemination in sparse mobile networks. PODC 2011: 355-362 - [r2]Gianfranco Bilardi, Andrea Pietracaprina:
Models of Computation, Theoretical. Encyclopedia of Parallel Computing 2011: 1150-1158 - [i7]Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Tight Bounds on Information Dissemination in Sparse Mobile Networks. CoRR abs/1101.4609 (2011) - [i6]Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal:
Space-Round Tradeoffs for MapReduce Computations. CoRR abs/1111.2228 (2011) - 2010
- [j23]Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin:
Mining top-K frequent itemsets through progressive sampling. Data Min. Knowl. Discov. 21(2): 310-326 (2010) - [i5]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. CoRR abs/1002.0874 (2010) - [i4]Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin:
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. CoRR abs/1002.1104 (2010) - [i3]Sara Nasso, Francesco Silvestri, Francesco Tisiot, Barbara Di Camillo, Andrea Pietracaprina, Gianna Maria Toffolo:
An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree. CoRR abs/1002.3724 (2010) - [i2]Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin:
Mining Top-K Frequent Itemsets Through Progressive Sampling. CoRR abs/1006.5235 (2010) - [i1]Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Infectious Random Walks. CoRR abs/1007.1604 (2010)
2000 – 2009
- 2009
- [j22]Pierluigi Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci:
On the connectivity of Bluetooth-based ad hoc networks. Concurr. Comput. Pract. Exp. 21(7): 875-887 (2009) - [c37]Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci:
On the Expansion and Diameter of Bluetooth-Like Topologies. ESA 2009: 528-539 - [c36]Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin:
Introduction. Euro-Par 2009: 989 - [c35]Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin:
An efficient rigorous approach for identifying statistically significant frequent itemsets. PODS 2009: 117-126 - [c34]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI 2009: 362-374 - 2008
- [j21]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Store-and-Forward Multicast Routing on the Mesh. Theory Comput. Syst. 42(4): 519-535 (2008) - [j20]Nancy M. Amato, Der-Tsai Lee, Andrea Pietracaprina, Roberto Tamassia:
Preface. Theor. Comput. Sci. 408(2-3): 97-98 (2008) - 2007
- [c33]Paolo Bertasi, Mauro Bianco, Andrea Pietracaprina, Geppino Pucci:
Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer. CISIS 2007: 285-290 - [c32]Andrea Pietracaprina, Fabio Vandin:
Efficient Incremental Mining of Top-K Frequent Closed Itemsets. Discovery Science 2007: 275-280 - [c31]Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri:
On the Connectivity of Bluetooth-Based Ad Hoc Networks. Euro-Par 2007: 960-969 - [c30]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri:
Network-Oblivious Algorithms. IPDPS 2007: 1-10 - [r1]Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi:
Decomposable BSP. Handbook of Parallel Computing 2007 - 2006
- [j19]Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci:
Translating submachine locality into locality of reference. J. Parallel Distributed Comput. 66(5): 633-646 (2006) - [c29]Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri:
Cache-oblivious simulation of parallel programs. IPDPS 2006 - 2005
- [j18]Andrea Pietracaprina, Geppino Pucci:
Optimal many-to-one routing on the mesh with constant queues. Inf. Process. Lett. 96(1): 24-29 (2005) - [j17]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
On stalling in LogP. J. Parallel Distributed Comput. 65(3): 307-312 (2005) - [c28]Andrea Pietracaprina, Kieran T. Herley, Christos D. Zaroliagis, Casiano Rodriguez-Leon:
Topic 12 Theory and Algorithms for Parallel Computation. Euro-Par 2005: 929 - [c27]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione:
The Potential of On-Chip Multiprocessing for QCD Machines. HiPC 2005: 386-397 - 2004
- [c26]Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina:
Topic 13: Theory and Algorithms for Parallel Computation. Euro-Par 2004: 803 - [c25]Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci:
Translating Submachine Locality into Locality of Reference. IPDPS 2004 - 2003
- [j16]Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci:
A General Pram Simulation Scheme For Clustered Machines. Int. J. Found. Comput. Sci. 14(6): 1147-1164 (2003) - [c24]Andrea Pietracaprina, Dario Zandolin:
Mining Frequent Itemsets using Patricia Tries. FIMI 2003 - 2002
- [j15]Roberto Grossi, Andrea Pietracaprina, Geppino Pucci:
Optimal Deterministic Protocols for Mobile Robots on a Grid. Inf. Comput. 173(2): 132-142 (2002) - [j14]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Deterministic parallel backtrack search. Theor. Comput. Sci. 270(1-2): 309-324 (2002) - [c23]Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci:
Seamless Integration of Parallelism and Memory Hierarchy. ICALP 2002: 856-867 - [c22]Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pietracaprina, Giuseppe Prencipe:
Distribution Sweeping on Clustered Machines with Hierarchical Memories. IPDPS 2002 - 2001
- [j13]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree. Inf. Comput. 165(2): 123-143 (2001) - [c21]Andrea Pietracaprina, Geppino Pucci:
Optimal Many-to-One Routing on the Mesh with Constant Queues. Euro-Par 2001: 645-650 - [c20]Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci:
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. International Conference on Computational Science (2) 2001: 579-588 - [c19]Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci:
Implementing Shared Memory on Clustered Machines. IPDPS 2001: 62 - [c18]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
One-to-Many routing on the mesh. SPAA 2001: 31-37 - 2000
- [j12]Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn:
Constructive, Deterministic Implementation of Shared Memory on Meshes. SIAM J. Comput. 30(2): 625-648 (2000) - [c17]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
On Stalling in LogP. IPDPS Workshops 2000: 109-115 - [c16]Nancy M. Amato, Jack Perdue, Mark M. Mathis, Andrea Pietracaprina, Geppino Pucci:
Predicting Performance on SMPs. A Case Study: The SGI Power Challenge. IPDPS 2000: 729-737 - [c15]Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto:
On the Space and Access Complexity of Computation DAGs. WG 2000: 47-58
1990 – 1999
- 1999
- [j11]Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Complexity of Parallel Multisearch on Coarse-Grained Machines. Algorithmica 24(3-4): 209-242 (1999) - [j10]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis:
BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999) - [j9]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Deterministic Branch-and-Bound on Distributed Memory Machines. Int. J. Found. Comput. Sci. 10(4): 391-404 (1999) - [j8]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Fast Deterministic Parallel Branch-and-Bound. Parallel Process. Lett. 9(3): 325-333 (1999) - [c14]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci:
A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. Euro-Par 1999: 543-551 - [c13]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract). IPPS/SPDP Workshops 1999: 1085-1094 - 1998
- [c12]Andrea Pietracaprina:
Deterministic Routing of h-relations on the Multibutterfly. IPPS/SPDP 1998: 375-379 - [c11]Roberto Grossi, Andrea Pietracaprina, Geppino Pucci:
Optimal Deterministic Protocols for Mobile Robots on a Grid. SWAT 1998: 181-192 - [e1]Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci:
Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings. Lecture Notes in Computer Science 1461, Springer 1998, ISBN 3-540-64848-8 [contents] - 1997
- [j7]Andrea Pietracaprina, Franco P. Preparata:
Practical Constructive Schemes for Deterministic Shared-Memory Access. Theory Comput. Syst. 30(1): 3-37 (1997) - [j6]Andrea Pietracaprina, Geppino Pucci:
The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines. Theory Comput. Syst. 30(3): 231-247 (1997) - 1996
- [c10]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Fast Deterministic Backtrack Search. ICALP 1996: 598-609 - [c9]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis:
BSP vs LogP. SPAA 1996: 25-32 - [c8]Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Deterministic Complexity of Parallel Multisearch (Extended Abstract). SWAT 1996: 404-415 - 1995
- [c7]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). ESA 1995: 60-74 - [c6]Andrea Pietracaprina, Geppino Pucci:
Improved Deterministic PRAM Simulation on the Mesh. ICALP 1995: 372-383 - 1994
- [j5]Arvind Krishna, Bruce E. Hajek, Andrea Pietracaprina:
Sharper analysis of packet routing on a butterfly. Networks 24(2): 91-101 (1994) - [c5]Andrea Pietracaprina, Geppino Pucci:
Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy. ESA 1994: 391-400 - [c4]Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn:
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. SPAA 1994: 248-256 - 1993
- [c3]Andrea Pietracaprina, Franco P. Preparata:
A Practical Constructive Scheme for Deterministic Shared-Memory Access. SPAA 1993: 100-109 - [c2]Andrea Pietracaprina, Franco P. Preparata:
On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. STACS 1993: 110-119 - 1992
- [j4]Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci:
Analysis and Implementation of Parallel Uniform Hashing. Int. J. Found. Comput. Sci. 3(1): 55-63 (1992) - 1991
- [j3]Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci:
Analysis of Parallel Uniform Hashing. Inf. Process. Lett. 37(2): 67-69 (1991) - [c1]Arvind Krishna, Andrea Pietracaprina, Bruce E. Hajek:
Packet Routing in Optimal Time on a Butterfly. INFOCOM 1991: 840-849 - 1990
- [j2]Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci:
A New Scheme for the Deterministic Simulation of PRAMs in VLSI. Algorithmica 5(4): 529-544 (1990)
1980 – 1989
- 1988
- [j1]Fabrizio Luccio, Geppino Pucci, Andrea Pietracaprina:
A Probabilistic Simulation of PRAMs on a Bounded Degree Network. Inf. Process. Lett. 28(3): 141-147 (1988)
Coauthor Index
[j39] [c49] [j38] [c48] [c47] [i21] [j37] [j36] [i20] [i19] [c46] [j35] [j34] [c45] [i18] [i17] [i16] [j33] [c44] [i15] [c43] [i14] [j32] [j31] [j30] [j29] [c42] [i13] [i12] [j28] [j27] [c41] [i11] [i10] [i9] [j26] [c40] [i8] [j25] [c39] [j24] [c38] [i7] [i6] [i5] [i4] [i1] [j22] [c37] [c35] [c34] [j21] [c33] [c31] [c30] [r1] [j19] [c29] [j18] [j17] [c27] [c25] [j16] [j15] [j14] [c23] [j13] [c21] [c20] [c19] [c18] [j12] [c17] [c16] [j10] [j9] [j8] [c14] [c13] [c11] [e1] [j6] [c10] [c9] [c7] [c6] [c5] [c4] [j4] [j3] [j2] [j1]
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 wit