Joseph G. Peters

Orcid: 0000-0002-2475-8145

Affiliations:
  • Simon Fraser University, Burnaby, Canada


According to our database1, Joseph G. Peters authored at least 61 papers between 1983 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Gait and Balance Assessments using Smartphone Applications in Parkinson's Disease: A Systematic Review.
J. Medical Syst., 2021

Temporal cliques admit sparse spanners.
J. Comput. Syst. Sci., 2021

2020
Fast and frugal targeting with incentives.
Theor. Comput. Sci., 2020

2019
Computing Parameters of Sequence-Based Dynamic Graphs.
Theory Comput. Syst., 2019

2018
Optimal odd gossiping.
Discret. Appl. Math., 2018

Time-Bounded Influence Diffusion with Incentives.
Proceedings of the Structural Information and Communication Complexity, 2018

2017
Odd gossiping.
Discret. Appl. Math., 2017

A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs.
Proceedings of the Structural Information and Communication Complexity, 2017

2016
Smallest Paths with Restricted Orientations in Simple Polygons.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Decoder-Complexity-Aware Encoding of Motion Compensation for Multiple Heterogeneous Receivers.
ACM Trans. Multim. Comput. Commun. Appl., 2015

Influence diffusion in social networks under time window constraints.
Theor. Comput. Sci., 2015

A characterization of oblivious message adversaries for which Consensus is solvable.
Theor. Comput. Sci., 2015

Spread of influence in weighted networks under time and budget constraints.
Theor. Comput. Sci., 2015

An Algebra to Merge Heterogeneous Classifiers.
CoRR, 2015

Complexity constrained layering of broadcast video for heterogeneous mobile receivers.
Proceedings of the 7th ACM International Workshop on Mobile Video, 2015

An Algebraic Approach to Combining Classifiers.
Proceedings of the International Conference on Computational Science, 2015

Efficiently Testing T -Interval Connectivity in Dynamic Graphs.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Complexity Aware Encoding of the Motion Compensation Process of the H.264/AVC Video Coding Standard.
Proceedings of the 24th ACM Workshop on Network and Operating Systems Support for Digital Audio and Video, 2014

Energy-Efficient 3D Texture Streaming for Mobile Games.
Proceedings of the 6th ACM Mobile Video Workshop, MoVid 2014, Singapore, 2014

How to go Viral: Cheaply and Quickly.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Dynamic Control of Receiver Buffers in Mobile Video Streaming Systems.
IEEE Trans. Mob. Comput., 2013

Energy-budget-compliant adaptive 3D texture streaming in mobile games.
Proceedings of the Multimedia Systems Conference 2013, 2013

Energy-efficient wireless video streaming with H.264 coding.
Proceedings of the 2013 IEEE International Conference on Multimedia and Expo Workshops, 2013

2012
Optimal gathering in radio grids with interference.
Theor. Comput. Sci., 2012

Energy-aware adaptations in mobile 3d graphics.
Proceedings of the 20th ACM Multimedia Conference, MM '12, Nara, Japan, October 29, 2012

2011
SYNTHESE. Réseaux complexes et épidémies.
Tech. Sci. Informatiques, 2011

Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults.
Proceedings of the Structural Information and Communication Complexity, 2011

Adaptive Transmission of Variable-Bit-Rate Video Streams to Mobile Devices.
Proceedings of the NETWORKING 2011, 2011

2008
Evolution and Enhancement of BitTorrent Network Topologies.
Proceedings of the 16th International Workshop on Quality of Service, 2008

2007
Neighborhood Broadcasting in Hypercubes.
SIAM J. Discret. Math., 2007

Efficient domination in circulant graphs with two chord lengths.
Inf. Process. Lett., 2007

2006
Exchanging messages of different sizes.
J. Parallel Distributed Comput., 2006

Constructing Incremental Sequences in Graphs.
Algorithmic Oper. Res., 2006

2005
Reliable broadcasting in double loop networks.
Networks, 2005

Minimum chromaticity of circulant graphs.
Discret. Math., 2005

2002
Broadcasting in Small-world Communication Networks.
Proceedings of the SIROCCO 9, 2002

2001
Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs.
Networks, 2001

Modelling Links in Inclined LEO Satellite Networks.
Proceedings of the SIROCCO 8, 2001

2000
Deterministic small-world communication networks.
Inf. Process. Lett., 2000

1999
Gossiping in Inclined LEO Satellite Networks.
Proceedings of the SIROCCO'99, 1999

1998
Global Communication on Circuit-Switched Toroidal Meshes.
Parallel Process. Lett., 1998

Neighbourhood Gossiping in Hypercubes.
Parallel Process. Lett., 1998

Line broadcasting in cycles.
Discret. Appl. Math., 1998

Exchange of Messages of Different Sizes.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998

1996
Circuit-Switched Broadcasting in Torus Networks.
IEEE Trans. Parallel Distributed Syst., 1996

Spanners of Hypercube-Derived Networks.
SIAM J. Discret. Math., 1996

Bounded Depth Broadcasting.
Discret. Appl. Math., 1996

1995
Antepenultimate broadcasting.
Networks, 1995

Structured communication in torus networks.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
Regularity and Locality in K-terminal Graphs.
Discret. Appl. Math., 1994

Reliable broadcasting.
Discret. Appl. Math., 1994

1993
A pyramid-based approach to interactive terrain visualization.
Proceedings of the 1993 Symposium on Parallel Rendering, 1993

1992
Smallest paths in simple rectilinear polygons.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1992

Broadcasting in Bounded Degree Graphs.
SIAM J. Discret. Math., 1992

Minimum Broadcast Digraphs.
Discret. Appl. Math., 1992

Sparse broadcast graphs.
Discret. Appl. Math., 1992

1988
Broadcast Networks of Bounded Degree.
SIAM J. Discret. Math., 1988

Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem.
Math. Oper. Res., 1988

1987
Parallel Approximation Schemes for Subset Sum and Knapsack Problems.
Acta Informatica, 1987

Performance Evaluation of LAN Sorting Algorithms.
Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1987

1983
Time-accuracy trade-offs for hard maximization problems.
PhD thesis, 1983


  Loading...