Остановите войну!
for scientists:
default search action
Joseph G. Peters
- > Home > Persons > Joseph G. Peters
Publications
- 2021
- [j37]Arnaud Casteigts, Joseph G. Peters, Jason Schoeters:
Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121: 1-17 (2021) - 2020
- [j35]Gennaro Cordasco, Luisa Gargano, Joseph G. Peters, Adele A. Rescigno, Ugo Vaccaro:
Fast and frugal targeting with incentives. Theor. Comput. Sci. 812: 62-79 (2020) - 2019
- [j34]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Computing Parameters of Sequence-Based Dynamic Graphs. Theory Comput. Syst. 63(3): 394-417 (2019) - [c24]Arnaud Casteigts, Joseph G. Peters, Jason Schoeters:
Temporal Cliques Admit Sparse Spanners. ICALP 2019: 134:1-134:14 - 2018
- [j33]Guillaume Fertin, Joseph G. Peters:
Optimal odd gossiping. Discret. Appl. Math. 247: 53-69 (2018) - [c23]Gennaro Cordasco, Luisa Gargano, Joseph G. Peters, Adele A. Rescigno, Ugo Vaccaro:
Time-Bounded Influence Diffusion with Incentives. SIROCCO 2018: 280-295 - [i8]Gennaro Cordasco, Luisa Gargano, Joseph Peters, Adele Anna Rescigno, Ugo Vaccaro:
Time-Bounded Influence Diffusion with Incentives. CoRR abs/1807.06921 (2018) - [i7]Arnaud Casteigts, Joseph G. Peters, Jason Schoeters:
Temporal Cliques Admit Sparse Spanners. CoRR abs/1810.00104 (2018) - 2017
- [j32]Guillaume Fertin, Joseph G. Peters, Lynette Raabe, Charlie Xu:
Odd gossiping. Discret. Appl. Math. 216: 550-561 (2017) - [c22]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. SIROCCO 2017: 321-338 - 2015
- [j31]Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro:
Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. 584: 53-66 (2015) - [j30]Étienne Coulouma, Emmanuel Godard, Joseph G. Peters:
A characterization of oblivious message adversaries for which Consensus is solvable. Theor. Comput. Sci. 584: 80-90 (2015) - [j29]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
Spread of influence in weighted networks under time and budget constraints. Theor. Comput. Sci. 586: 40-58 (2015) - [c20]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Efficiently Testing T -Interval Connectivity in Dynamic Graphs. CIAC 2015: 89-100 - [c19]Philippe J. Giabbanelli, Joseph G. Peters:
An Algebraic Approach to Combining Classifiers. ICCS 2015: 1545-1554 - [i6]Philippe J. Giabbanelli, Joseph G. Peters:
An Algebra to Merge Heterogeneous Classifiers. CoRR abs/1501.05141 (2015) - [i5]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Efficiently Testing T-Interval Connectivity in Dynamic Graphs. CoRR abs/1502.00089 (2015) - [i4]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
Spread of Influence in Weighted Networks under Time and Budget Constraints. CoRR abs/1502.05599 (2015) - 2014
- [c17]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
How to go Viral: Cheaply and Quickly. FUN 2014: 100-112 - [i3]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
How to go Viral: Cheaply and Quickly. CoRR abs/1404.3033 (2014) - 2013
- [c12]Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro:
Influence Diffusion in Social Networks under Time Window Constraints. SIROCCO 2013: 141-152 - [i2]Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro:
Influence Diffusion in Social Networks under Time Window Constraints. CoRR abs/1311.5193 (2013) - 2012
- [j26]Jean-Claude Bermond, Joseph G. Peters:
Optimal gathering in radio grids with interference. Theor. Comput. Sci. 457: 10-26 (2012) - 2011
- [j25]Philippe J. Giabbanelli, Joseph G. Peters:
SYNTHESE. Réseaux complexes et épidémies. Tech. Sci. Informatiques 30(2): 181-212 (2011) - [c9]Emmanuel Godard, Joseph G. Peters:
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. SIROCCO 2011: 29-41 - [i1]Emmanuel Godard, Joseph G. Peters:
Consensus vs Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. CoRR abs/1106.3579 (2011) - 2008
- [c8]Cameron Dale, Jiangchuan Liu, Joseph G. Peters, Bo Li:
Evolution and Enhancement of BitTorrent Network Topologies. IWQoS 2008: 1-10 - 2007
- [j23]Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters:
Neighborhood Broadcasting in Hypercubes. SIAM J. Discret. Math. 21(4): 823-843 (2007) - 2006
- [j22]Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault:
Constructing Incremental Sequences in Graphs. Algorithmic Oper. Res. 1(2) (2006) - [j21]Alfredo Goldman, Joseph G. Peters, Denis Trystram:
Exchanging messages of different sizes. J. Parallel Distributed Comput. 66(1): 1-18 (2006) - 2002
- [c7]Francesc Comellas, Margarida Mitjana, Joseph G. Peters:
Broadcasting in Small-world Communication Networks. SIROCCO 2002: 73-85 - 2001
- [j18]Pierre Fraigniaud, Joseph G. Peters:
Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs. Networks 38(3): 150-162 (2001) - 2000
- [j17]Francesc Comellas, Javier Ozón, Joseph G. Peters:
Deterministic small-world communication networks. Inf. Process. Lett. 76(1-2): 83-90 (2000) - 1998
- [j14]Satoshi Fujita, Stephane Perennes, Joseph G. Peters:
Neighbourhood Gossiping in Hypercubes. Parallel Process. Lett. 8(2): 189-195 (1998) - [c4]Alfredo Goldman, Denis Trystram, Joseph G. Peters:
Exchange of Messages of Different Sizes. IRREGULAR 1998: 194-205 - 1996
- [j12]Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau:
Spanners of Hypercube-Derived Networks. SIAM J. Discret. Math. 9(1): 37-54 (1996) - [j11]Joseph G. Peters, Michel Syska:
Circuit-Switched Broadcasting in Torus Networks. IEEE Trans. Parallel Distributed Syst. 7(3): 246-255 (1996) - 1995
- [j10]Jean-Claude Bermond, Pierre Fraigniaud, Joseph G. Peters:
Antepenultimate broadcasting. Networks 26(3): 125-137 (1995) - [c3]Pierre Fraigniaud, Joseph G. Peters:
Structured communication in torus networks. HICSS (2) 1995: 584-593 - 1994
- [j9]Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards:
Reliable broadcasting. Discret. Appl. Math. 53(1-3): 135-148 (1994) - [e2]Michel Cosnard, Afonso Ferreira, Joseph G. Peters:
Parallel and Distributed Computing, First Canada-France Conference, Montréal, Canada, May 19-21, 1994, Proceedings. Lecture Notes in Computer Science 805, Springer 1994, ISBN 3-540-58078-6 [contents] - 1992
- [j7]Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Sparse broadcast graphs. Discret. Appl. Math. 36(2): 97-130 (1992) - [j6]Arthur L. Liestman, Joseph G. Peters:
Minimum Broadcast Digraphs. Discret. Appl. Math. 37/38: 401-419 (1992) - [j5]Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Broadcasting in Bounded Degree Graphs. SIAM J. Discret. Math. 5(1): 10-24 (1992) - 1988
- [j2]Arthur L. Liestman, Joseph G. Peters:
Broadcast Networks of Bounded Degree. SIAM J. Discret. Math. 1(4): 531-540 (1988) - 1987
- [j1]Joseph G. Peters, Larry Rudolph:
Parallel Approximation Schemes for Subset Sum and Knapsack Problems. Acta Informatica 24(4): 417-432 (1987) - 1984
- [e1]Tiko Kameda, Jayadev Misra, Joseph G. Peters, Nicola Santoro:
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984. ACM 1984, ISBN 0-89791-143-1 [contents]
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 02:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint