default search action
Matthieu Latapy
Person information
- affiliation: LIP6, Paris
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i43]Bastien Legay, Matthieu Latapy:
Mapping low-resolution edges to high-resolution paths: the case of traffic measurements in cities. CoRR abs/2401.08539 (2024) - [i42]Guillaume Moinard, Matthieu Latapy:
Fast and Robust Flocking of Protesters on Street Networks. CoRR abs/2406.01101 (2024) - 2023
- [j48]Frédéric Simard, Clémence Magnien, Matthieu Latapy:
Computing Betweenness Centrality in Link Streams. J. Graph Algorithms Appl. 27(3): 195-217 (2023) - [c41]Esteban Bautista, Matthieu Latapy:
Link Streams as a Generalization of Graphs and Time Series. CogMI 2023: 150-158 - [i41]Mehdi Naima, Matthieu Latapy, Clémence Magnien:
Temporal Betweenness Centrality on Shortest Paths Variants. CoRR abs/2305.01080 (2023) - [i40]Esteban Bautista, Matthieu Latapy:
Link Streams as a Generalization of Graphs and Time Series. CoRR abs/2311.11187 (2023) - 2022
- [j47]Esteban Bautista
, Matthieu Latapy:
A local updating algorithm for personalized PageRank via Chebyshev polynomials. Soc. Netw. Anal. Min. 12(1): 31 (2022) - [i39]Esteban Bautista, Matthieu Latapy:
A Frequency-Structure Approach for Link Stream Analysis. CoRR abs/2212.03804 (2022) - 2021
- [c40]Jules Azad Emery, Matthieu Latapy:
Full Bitcoin blockchain data made easy. ASONAM 2021: 240-243 - [i38]Matthieu Latapy:
Partitions of an Integer into Powers. CoRR abs/2101.08312 (2021) - [i37]Olivier Bodini, Matthieu Latapy:
Generalized Tilings with Height Functions. CoRR abs/2101.08347 (2021) - [i36]Frédéric Simard, Clémence Magnien, Matthieu Latapy:
Computing Betweenness Centrality in Link Streams. CoRR abs/2102.06543 (2021) - [i35]Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen:
Termination of Multipartite Graph Series Arising from Complex Network Modelling. CoRR abs/2103.04447 (2021) - [i34]Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan:
On the Termination of Some Biclique Operators on Multipartite Graphs. CoRR abs/2103.04451 (2021) - [i33]Jules Azad Emery
Full Bitcoin Blockchain Data Made Easy. CoRR abs/2106.08072 (2021) - [i32]Esteban Bautista, Matthieu Latapy:
A Local Updating Algorithm for Personalized PageRank via Chebyshev Polynomials. CoRR abs/2110.02538 (2021) - [i31]Esteban Bautista, Matthieu Latapy:
A logical approach for temporal and multiplex networks analysis. CoRR abs/2110.02543 (2021) - 2020
- [j46]Nicolas Gensollen
Do you trade with your friends or become friends with your trading partners? A case study in the $\breve {G}1$ cryptocurrency. Appl. Netw. Sci. 5(1): 25 (2020) - [j45]Clara Stegehuis, Matthieu Latapy:
Closure coefficients in scale-free complex networks. J. Complex Networks 8(3) (2020) - [c39]Léo Rannou, Clémence Magnien, Matthieu Latapy:
Strongly Connected Components in Stream Graphs: Computation and Experimentations. COMPLEX NETWORKS (1) 2020: 568-580 - [i30]Léo Rannou, Clémence Magnien, Matthieu Latapy:
Strongly Connected Components in Stream Graphs: Computation and Experimentations. CoRR abs/2011.08054 (2020)
2010 – 2019
- 2019
- [j44]Matthieu Latapy, Marco Fiore, Artur Ziviani:
Link streams: Methods and applications. Comput. Networks 150: 263-265 (2019) - [j43]Audrey Wilmet, Tiphaine Viard, Matthieu Latapy, Robin Lamarche-Perrin:
Outlier detection in IP traffic modelled as a link stream using the stability of degree distributions over time. Comput. Networks 161: 197-209 (2019) - [i29]Armel Jacques Nzekon Nzeko'o, Maurice Tchuenté, Matthieu Latapy:
Link Stream Graph for Temporal Recommendations. CoRR abs/1904.12576 (2019) - [i28]Armel Jacques Nzekon Nzeko'o, Maurice Tchuenté, Matthieu Latapy:
A general graph-based framework for top-N recommendation using content, temporal and trust information. CoRR abs/1905.02681 (2019) - [i27]Audrey Wilmet, Tiphaine Viard, Matthieu Latapy, Robin Lamarche-Perrin:
Degree-based Outlier Detection within IP Traffic Modelled as a Link Stream. CoRR abs/1906.02524 (2019) - [i26]Matthieu Latapy, Clémence Magnien, Tiphaine Viard:
Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks. CoRR abs/1906.04840 (2019) - [i25]Nicolas Gensollen, Matthieu Latapy:
Do you trade with your friends or become friends with your trading partners? A case study in the G1 cryptocurrency. CoRR abs/1911.10792 (2019) - 2018
- [j42]Clément Bertrand, Frédéric Peschanski, Hanna Klaudel, Matthieu Latapy:
Pattern Matching in Link Streams: Timed-Automata with Finite Memory. Sci. Ann. Comput. Sci. 28(2): 161-198 (2018) - [j41]Tiphaine Viard
Enumerating maximal cliques in link streams with durations. Inf. Process. Lett. 133: 44-48 (2018) - [j40]Matthieu Latapy
Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1): 61:1-61:29 (2018) - [c38]Clément Bertrand, Hanna Klaudel, Matthieu Latapy, Frédéric Peschanski:
Pattern Matching in Link Streams: A Token-Based Approach. Petri Nets 2018: 227-247 - [c37]Audrey Wilmet, Tiphaine Viard, Matthieu Latapy, Robin Lamarche-Perrin:
Degree-Based Outliers Detection Within IP Traffic Modelled as a Link Stream. TMA 2018: 1-8 - [i24]Thibaud Arnoux, Lionel Tabourier, Matthieu Latapy:
Predicting interactions between individuals with structural and dynamical information. CoRR abs/1804.01465 (2018) - [i23]Jean Creusefond, Matthieu Latapy:
Propagation of content similarity through a collaborative network for live show recommendation. CoRR abs/1804.09073 (2018) - 2017
- [j39]Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan:
Rigorous Measurement of the Internet Degree Distribution. Complex Syst. 26(1) (2017) - [c36]Thibaud Arnoux, Lionel Tabourier, Matthieu Latapy:
Combining structural and dynamic information to predict activity in link streams. ASONAM 2017: 935-942 - [c35]Rémy Cazabet
Tracking Bitcoin Users Activity Using Community Detection on a Network of Weak Signals. COMPLEX NETWORKS 2017: 166-177 - [c34]Aurore Payen, Lionel Tabourier, Matthieu Latapy:
Impact of Temporal Features of Cattle Exchanges on the Size and Speed of Epidemic Outbreaks. ICCSA (2) 2017: 84-97 - [c33]Armel Jacques Nzekon Nzeko'o, Maurice Tchuenté, Matthieu Latapy:
Temporal Recommendation, Long- and Short-term Preferences, Session-based Temporal Graph, Time Weight Content-based Graph, Time-averaged Hit Ratio, PageRank, Injected Preference Fusion.. WEBIST 2017: 268-275 - [i22]Matthieu Latapy, Tiphaine Viard, Clémence Magnien:
Stream Graphs and Link Streams for the Modeling of Interactions over Time. CoRR abs/1710.04073 (2017) - [i21]Tiphaine Viard, Raphaël Fournier-S'niehotta, Clémence Magnien, Matthieu Latapy:
Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams. CoRR abs/1710.07107 (2017) - [i20]Rémy Cazabet, Baccour Rym, Matthieu Latapy:
Tracking bitcoin users activity using community detection on a network of weak signals. CoRR abs/1710.08158 (2017) - [i19]Tiphaine Viard, Clémence Magnien, Matthieu Latapy:
Enumerating maximal cliques in link streams with durations. CoRR abs/1712.06970 (2017) - 2016
- [j38]Fabien Viger, Matthieu Latapy:
Efficient and simple generation of random simple connected graphs with prescribed degree sequence. J. Complex Networks 4(1): 15-37 (2016) - [j37]Noé Gaumont
Finding remarkably dense sequences of contacts in link streams. Soc. Netw. Anal. Min. 6(1): 87:1-87:14 (2016) - [j36]Tiphaine Viard
Computing maximal cliques in link streams. Theor. Comput. Sci. 609: 245-252 (2016) - [c32]Noé Gaumont, Tiphaine Viard
Analysis of the Temporal and Structural Features of Threads in a Mailing-List. CompleNet 2016: 107-118 - 2015
- [j35]Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan:
On the termination of some biclique operators on multipartite graphs. Discret. Appl. Math. 195: 59-73 (2015) - [c31]Jordan Viard, Matthieu Latapy, Clémence Magnien:
Revealing contact patterns among high-school students using maximal cliques in link streams. ASONAM 2015: 1517-1522 - [c30]Armel Jacques Nzekon Nzeko'o, Matthieu Latapy, Maurice Tchuenté:
Social Network Analysis of Developers' and Users' Mailing Lists of Some Free Open Source Software. BigData Congress 2015: 728-732 - [c29]Noé Gaumont, François Queyroi, Clémence Magnien, Matthieu Latapy:
Expected Nodes: A Quality Function for the Detection of Link Communities. CompleNet 2015: 57-64 - [i18]Tiphaine Viard, Matthieu Latapy, Clémence Magnien:
Computing maximal cliques in link streams. CoRR abs/1502.00993 (2015) - [i17]Noé Gaumont, Tiphaine Viard, Raphaël Fournier-S'niehotta, Qinna Wang, Matthieu Latapy:
Analysis of the temporal and structural features of threads in a mailing-list. CoRR abs/1512.05002 (2015) - 2014
- [j34]Matthieu Latapy, Assia Hamzaoui, Clémence Magnien:
Detecting events in the dynamics of ego-centred measurements of the Internet topology‡. J. Complex Networks 2(1): 38-59 (2014) - [c28]Matthieu Latapy, Tiphaine Viard
Complex Networks and Link Streams for the Empirical Analysis of Large Software. Petri Nets 2014: 40-50 - [c27]Elie Rotenberg, Christophe Crespelle, Matthieu Latapy:
Measuring routing tables in the internet. INFOCOM Workshops 2014: 795-800 - [c26]Jordan Viard, Matthieu Latapy:
Identifying roles in an IP network with temporal and structural density. INFOCOM Workshops 2014: 801-806 - [c25]Fabien Tarissan, Elie Rotenberg, Matthieu Latapy, Christophe Crespelle:
UDP Ping: A Dedicated Tool for Improving Measurements of the Internet Topology. MASCOTS 2014: 506-509 - [c24]Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan:
Measuring the degree distribution of routers in the core internet. Networking 2014: 1-9 - [i16]Tiphaine Viard, Matthieu Latapy:
Identifying roles in an IP network with temporal and structural density. CoRR abs/1406.4969 (2014) - 2013
- [j33]Fabien Tarissan, Bruno Quoitin
Towards a bipartite graph modeling of the internet topology. Comput. Networks 57(11): 2331-2347 (2013) - [j32]Oussama Allali, Clémence Magnien, Matthieu Latapy:
Internal link prediction: A new approach for predicting links in bipartite graphs. Intell. Data Anal. 17(1): 5-25 (2013) - [j31]Matthieu Latapy, Clémence Magnien, Raphaël Fournier:
Quantifying paedophile activity in a large P2P system. Inf. Process. Manag. 49(1): 248-263 (2013) - [j30]Oussama Allali, Lionel Tabourier, Clémence Magnien, Matthieu Latapy:
Internal links and pairs as a new tool for the analysis of bipartite complex networks. Soc. Netw. Anal. Min. 3(1): 85-91 (2013) - [j29]Daniel Faria Bernardes, Matthieu Latapy, Fabien Tarissan:
Inadequacy of SIR model to reproduce key properties of real-world spreading cascades: experiments on a large-scale P2P system. Soc. Netw. Anal. Min. 3(4): 1195-1208 (2013) - 2012
- [j28]Abdelhamid Salah Brahim, Bénédicte Le Grand, Matthieu Latapy:
Diffusion Cascades: Spreading Phenomena in Blog Network Communities. Parallel Process. Lett. 22(1) (2012) - [j27]Alice Albano, Bénédicte Le Grand, Matthieu Latapy:
Visualisation de grands réseaux dynamiques. Application à la détection d'anomalies de routage dans l'Internet. Rev. d'Intelligence Artif. 26(4): 409-427 (2012) - [c23]Daniel Faria Bernardes, Matthieu Latapy, Fabien Tarissan:
Relevance of SIR Model for Real-world Spreading Phenomena: Experiments on a Large-scale P2P System. ASONAM 2012: 327-334 - [c22]Sebastien Heymann, Matthieu Latapy, Clémence Magnien:
Outskewer: Using Skewness to Spot Outliers in Samples and Time Series. ASONAM 2012: 527-534 - [i15]Matthieu Latapy, Clémence Magnien, Raphaël Fournier:
Quantifying Paedophile Activity in a Large P2P System. CoRR abs/1206.4166 (2012) - [i14]Raphaël Fournier, Thibault Cholez, Matthieu Latapy, Clémence Magnien, Isabelle Chrisment, Ivan Daniloff, Olivier Festor:
Comparing paedophile activity in different P2P systems. CoRR abs/1206.4167 (2012) - 2011
- [j26]Matthieu Latapy:
Complex networks. Comput. Commun. 34(5): 607-608 (2011) - [j25]Adrien Friggeri, Jean-Philippe Cointet, Matthieu Latapy:
A Real-World Spreading Experiment in the Blogosphere. Complex Syst. 19(3) (2011) - [j24]Matthieu Latapy
A Radar for the Internet. Complex Syst. 20(1) (2011) - [j23]Clémence Magnien, Matthieu Latapy, Jean-Loup Guillaume
Impact of random failures and attacks on Poisson and power-law random networks. ACM Comput. Surv. 43(3): 13:1-13:31 (2011) - [j22]Abdelhamid Salah Brahim, Bénédicte Le Grand, Lionel Tabourier, Matthieu Latapy:
Citations among blogs in a hierarchy of communities: Method and case study. J. Comput. Sci. 2(3): 247-252 (2011) - [j21]Pascal Pons, Matthieu Latapy:
Post-processing hierarchical community structures: Quality improvements and multi-scale view. Theor. Comput. Sci. 412(8-10): 892-900 (2011) - [j20]Matthieu Latapy:
Introduction. Tech. Sci. Informatiques 30(2): 135-136 (2011) - [c21]Matthieu Latapy, Clémence Magnien, Raphaël Fournier:
Quantifying paedophile queries in a large P2P system. INFOCOM 2011: 401-405 - [i13]Oussama Allali, Lionel Tabourier, Clémence Magnien, Matthieu Latapy:
Internal links and pairs as a new tool for the analysis of bipartite complex networks. CoRR abs/1104.4418 (2011) - 2010
- [c20]Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen:
Termination of Multipartite Graph Series Arising from Complex Network Modelling. COCOA (1) 2010: 1-10 - [c19]Xiaomin Wang, Matthieu Latapy, Michèle Soria:
Deciding on the Type of a Graph from a BFS. CompleNet 2010: 68-74 - [c18]Assia Hamzaoui, Matthieu Latapy, Clémence Magnien:
Detecting events in the dynamics of ego-centered measurements of the internet topology. WiOpt 2010: 505-512
2000 – 2009
- 2009
- [j19]Matthieu Latapy, Thi Ha Duong Phan:
The lattice of integer partitions and its infinite extension. Discret. Math. 309(6): 1357-1367 (2009) - [c17]Frederic Aidouni, Matthieu Latapy, Clémence Magnien:
Ten weeks in the life of an eDonkey server. IPDPS 2009: 1-5 - [c16]Oussama Allali, Matthieu Latapy, Clémence Magnien:
Measurement of eDonkey activity with distributed honeypots. IPDPS 2009: 1-8 - [i12]Clémence Magnien, Frédéric Ouédraogo, Guillaume Valadon, Matthieu Latapy:
Fast dynamics in Internet topology: preliminary observations and explanations. CoRR abs/0904.2716 (2009) - [i11]Clémence Magnien, Matthieu Latapy, Michel Habib:
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. CoRR abs/0904.2728 (2009) - [i10]Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira:
Detection, Understanding, and Prevention of Traceroute Measurement Artifacts. CoRR abs/0904.2733 (2009) - [i9]Oussama Allali, Matthieu Latapy, Clémence Magnien:
Measurement of eDonkey Activity with Distributed Honeypots. CoRR abs/0904.3215 (2009) - [i8]Fabien Tarissan, Matthieu Latapy, Christophe Prieur:
Efficient Measurement of Complex Networks Using Link Queries. CoRR abs/0904.3222 (2009) - 2008
- [j18]Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman
Detection, understanding, and prevention of traceroute measurement artifacts. Comput. Networks 52(5): 998-1018 (2008) - [j17]Matthieu Latapy, Walter Willinger:
Complex computer and communication networks. Comput. Networks 52(15): 2817-2818 (2008) - [j16]Clémence Magnien, Matthieu Latapy, Michel Habib:
Fast computation of empirically tight bounds for the diameter of massive graphs. ACM J. Exp. Algorithmics 13 (2008) - [j15]Matthieu Latapy, Clémence Magnien, Nathalie Del Vecchio:
Basic notions for the analysis of large two-mode networks. Soc. Networks 30(1): 31-48 (2008) - [j14]Matthieu Latapy:
Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1-3): 458-473 (2008) - [c15]Matthieu Latapy:
Analyse des grands graphes de terrain. CORIA 2008: 5-6 - [c14]Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo:
A Radar for the Internet. ICDM Workshops 2008: 901-908 - [c13]Matthieu Latapy, Clémence Magnien:
Complex Network Measurements: Estimating the Relevance of Observed Properties. INFOCOM 2008: 1660-1668 - [i7]Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo:
A Radar for the Internet. CoRR abs/0807.1603 (2008) - [i6]Frederic Aidouni, Matthieu Latapy, Clémence Magnien:
Ten weeks in the life of an eDonkey server. CoRR abs/0809.3415 (2008) - 2007
- [j13]Rémi Dorat, Matthieu Latapy, Bernard Conein, Nicolas Auray:
Multi-level analysis of an interaction network between individuals in a mailing-list. Ann. des Télécommunications 62(3-4): 325-349 (2007) - [j12]Jeremie Leguay
Describing and simulating internet routes. Comput. Networks 51(8): 2067-2085 (2007) - 2006
- [j11]Jean-Loup Guillaume
Relevance of massively distributed explorations of the Internet topology: Qualitative results. Comput. Networks 50(16): 3197-3224 (2006) - [j10]Pascal Pons, Matthieu Latapy:
Computing Communities in Large Networks Using Random Walks. J. Graph Algorithms Appl. 10(2): 191-218 (2006) - [j9]Ravi Kumar, Matthieu Latapy:
Preface. Theor. Comput. Sci. 355(1): 1-5 (2006) - [c12]Brice Augustin, Xavier Cuvellier, Benjamin Orgogozo, Fabien Viger, Timur Friedman
Avoiding traceroute anomalies with Paris traceroute. Internet Measurement Conference 2006: 153-158 - [i5]Matthieu Latapy, Clémence Magnien:
Measuring Fundamental Properties of Real-World Complex Networks. CoRR abs/cs/0609115 (2006) - [i4]Matthieu Latapy:
Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs. CoRR abs/cs/0609116 (2006) - 2005
- [j8]Jean-Loup Guillaume, Matthieu Latapy:
Complex Network Metrology. Complex Syst. 16(1) (2005) - [j7]Frédéric Chavanon, Matthieu Latapy, Michel Morvan, Eric Rémila, Laurent Vuillon:
Graph encoding of 2D-gon tilings. Theor. Comput. Sci. 346(2-3): 226-253 (2005) - [c11]Fabien Viger, Matthieu Latapy:
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence. COCOON 2005: 440-449 - [c10]Pierre Fraigniaud, Philippe Gauron, Matthieu Latapy:
Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. Euro-Par 2005: 1163-1172 - [c9]Jean-Loup Guillaume, Matthieu Latapy:
Relevance of massively distributed explorations of the Internet topology: simulation results. INFOCOM 2005: 1084-1094 - [c8]Stevens Le Blond, Jean-Loup Guillaume, Matthieu Latapy:
Clustering in P2P Exchanges and Consequences on Performances. IPTPS 2005: 193-204 - [c7]Pascal Pons, Matthieu Latapy:
Computing Communities in Large Networks Using Random Walks. ISCIS 2005: 284-293 - [c6]Jeremie Leguay, Matthieu Latapy, Timur Friedman
Describing and Simulating Internet Routes. NETWORKING 2005: 659-670 - [i3]Fabien Viger, Matthieu Latapy:
Fast generation of random connected graphs with prescribed degrees. CoRR abs/cs/0502085 (2005) - 2004
- [j6]Jean-Loup Guillaume
Bipartite structure of all complex networks. Inf. Process. Lett. 90(5): 215-221 (2004) - [j5]Eric Goles Ch., Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan:
Sandpile models and lattices: a comprehensive survey. Theor. Comput. Sci. 322(2): 383-407 (2004) - [c5]Jean-Loup Guillaume, Matthieu Latapy:
Bipartite Graphs as Models of Complex Networks. CAAN 2004: 127-139 - [c4]Jean-Loup Guillaume, Matthieu Latapy, Stevens Le Blond:
Statistical Analysis of a P2P Query Graph Based on Degrees and Their Time-Evolution. IWDC 2004: 126-137 - [c3]Jean-Loup Guillaume, Matthieu Latapy, Clémence Magnien:
Comparison of Failures and Attacks on Random and Scale-Free Networks. OPODIS 2004: 186-196 - [i2]Jeremie Leguay, Matthieu Latapy, Timur Friedman, Kavé Salamatian:
Describing and Simulating Internet Routes. CoRR cs.NI/0411051 (2004) - 2002
- [j4]Jean-Michel Autebert, Matthieu Latapy, Sylviane R. Schwer:
Le treillis des chemins de Delannoy. Discret. Math. 258(1-3): 225-234 (2002) - [j3]Matthieu Latapy, Clémence Magnien:
Coding distributive lattices with Edge Firing Games. Inf. Process. Lett. 83(3): 125-128 (2002) - [j2]Matthieu Latapy:
Integer Partitions, Tilings of 2D-gons and Lattices. RAIRO Theor. Informatics Appl. 36(4): 389-399 (2002) - [c2]Jean-Loup Guillaume, Matthieu Latapy, Laurent Viennot:
Efficient and Simple Encodings for the Web Graph. WAIM 2002: 328-337 - 2001
- [j1]Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan:
Structure of some sand piles model. Theor. Comput. Sci. 262(1): 525-556 (2001) - [c1]Matthieu Latapy:
Partitions of an Integer into Powers. DM-CCG 2001: 215-228 - 2000
- [i1]Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan:
Structure of some sand pile model. CoRR cs.DM/0008002 (2000)
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-05 20:18 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: