default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph G. Peters
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j37]Arnaud Casteigts, Joseph G. Peters, Jason Schoeters:
Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121: 1-17 (2021)- [j36]Libak Abou
, Joseph Peters, Ellyce Wong, Rebecca Akers, Mauricette Sènan Dossou, Jacob J. Sosnoff, Laura A. Rice:
Gait and Balance Assessments using Smartphone Applications in Parkinson's Disease: A Systematic Review. J. Medical Syst. 45(9): 87 (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)
2010 – 2019
- 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 - 2016
- [c21]Jillian Dicker, Joseph G. Peters:
Smallest Paths with Restricted Orientations in Simple Polygons. CCCG 2016: 216-222 - 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) - [j28]Mohsen Jamali Langroodi, Joseph Peters, Shervin Shirmohammadi:
Decoder-Complexity-Aware Encoding of Motion Compensation for Multiple Heterogeneous Receivers. ACM Trans. Multim. Comput. Commun. Appl. 11(2s): 46:1-46:22 (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 - [c18]Mohsen Jamali Langroodi, Joseph Peters, Shervin Shirmohammadi:
Complexity constrained layering of broadcast video for heterogeneous mobile receivers. MoVid@MMSys 2015: 1-6 - [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 - [c16]Mohammad Hosseini, Joseph Peters, Shervin Shirmohammadi:
Energy-Efficient 3D Texture Streaming for Mobile Games. MoVid@MMSys 2014: 5:1-5:6 - [c15]Mohsen Jamali Langroodi, Joseph Peters, Shervin Shirmohammadi:
Complexity Aware Encoding of the Motion Compensation Process of the H.264/AVC Video Coding Standard. NOSSDAV 2014: 103 - [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
- [j27]Farid Molazem Tabrizi, Joseph G. Peters, Mohamed Hefeeda:
Dynamic Control of Receiver Buffers in Mobile Video Streaming Systems. IEEE Trans. Mob. Comput. 12(5): 995-1008 (2013) - [c14]Pariya Raoufi, Joseph Peters:
Energy-efficient wireless video streaming with H.264 coding. ICME Workshops 2013: 1-6 - [c13]Mohammad Hosseini, Joseph Peters, Shervin Shirmohammadi:
Energy-budget-compliant adaptive 3D texture streaming in mobile games. MMSys 2013: 1-11 - [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) - [c11]Mohammad Hosseini, Alexandra Fedorova, Joseph Peters, Shervin Shirmohammadi:
Energy-aware adaptations in mobile 3d graphics. ACM Multimedia 2012: 1017-1020 - 2011
- [j25]Philippe J. Giabbanelli, Joseph G. Peters:
SYNTHESE. Réseaux complexes et épidémies. Tech. Sci. Informatiques 30(2): 181-212 (2011) - [c10]Farid Molazem Tabrizi, Joseph G. Peters, Mohamed Hefeeda:
Adaptive Transmission of Variable-Bit-Rate Video Streams to Mobile Devices. Networking (2) 2011: 213-224 - [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)
2000 – 2009
- 2008
- [c8]Cameron Dale, Jiangchuan Liu, Joseph G. Peters, Bo Li:
Evolution and Enhancement of BitTorrent Network Topologies. IWQoS 2008: 1-10 - 2007
- [j24]Nenad Obradoviç, Joseph G. Peters, Goran Ruzic:
Efficient domination in circulant graphs with two chord lengths. Inf. Process. Lett. 102(6): 253-258 (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) - 2005
- [j20]Nenad Obradoviç, Joseph G. Peters, Goran Ruzic:
Minimum chromaticity of circulant graphs. Discret. Math. 299(1-3): 288-296 (2005) - [j19]Nenad Obradoviç, Joseph G. Peters, Goran Ruzic:
Reliable broadcasting in double loop networks. Networks 46(2): 88-97 (2005) - 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) - [c6]Peter Gvozdjak, Joseph G. Peters:
Modelling Links in Inclined LEO Satellite Networks. SIROCCO 2001: 195-208 - 2000
- [j17]Francesc Comellas, Javier Ozón, Joseph G. Peters:
Deterministic small-world communication networks. Inf. Process. Lett. 76(1-2): 83-90 (2000)
1990 – 1999
- 1999
- [c5]Peter Gvozdjak, Joseph G. Peters:
Gossiping in Inclined LEO Satellite Networks. SIROCCO 1999: 166-180 - 1998
- [j16]Jave O. Kane, Joseph G. Peters:
Line broadcasting in cycles. Discret. Appl. Math. 83(1-3): 207-228 (1998) - [j15]Joseph G. Peters, Curtis C. Spencer:
Global Communication on Circuit-Switched Toroidal Meshes. Parallel Process. Lett. 8(2): 161-175 (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
- [j13]David B. Peters, Joseph G. Peters:
Bounded Depth Broadcasting. Discret. Appl. Math. 66(3): 255-270 (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) - [j8]Sanjeev Mahajan, Joseph G. Peters:
Regularity and Locality in K-terminal Graphs. Discret. Appl. Math. 54(2-3): 229-250 (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] - 1993
- [c2]James K. Tam, Joseph Peters:
A pyramid-based approach to interactive terrain visualization. PRS 1993: 67-70 - 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) - [j4]Kenneth M. McDonald, Joseph G. Peters:
Smallest paths in simple rectilinear polygons. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(7): 864-875 (1992)
1980 – 1989
- 1988
- [j3]Joseph G. Peters:
Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem. Math. Oper. Res. 13(3): 497-507 (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) - [c1]Mohamed Salehmohamed, Wo-Shun Luk, Joseph G. Peters:
Performance Evaluation of LAN Sorting Algorithms. SIGMETRICS 1987: 226-233 - 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] - 1983
- [b1]Joseph G. Peters:
Time-accuracy trade-offs for hard maximization problems. University of Toronto, Canada, 1983
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 2025-01-21 00:22 CET 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:
