Joseph G. Peters

Available identifiers

zbMath Open peters.joseph-gMaRDI QIDQ294853

List of research outcomes

Publication	Date of Publication	Type
Temporal Cliques Admit Sparse Spanners	2022-07-21	Paper
Temporal cliques admit sparse spanners	2021-07-06	Paper
Fast and frugal targeting with incentives	2020-02-20	Paper
Computing parameters of sequence-based dynamic graphs	2019-06-27	Paper
Time-bounded influence diffusion with incentives	2019-01-30	Paper
Optimal odd gossiping	2018-09-06	Paper
Time-Bounded Influence Diffusion with Incentives	2018-07-18	Paper
A generic framework for computing parameters of sequence-based dynamic graphs	2018-04-12	Paper
Odd gossiping	2017-03-15	Paper
Deterministic small-world communication networks	2016-06-16	Paper
Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs	2015-09-21	Paper
Spread of influence in weighted networks under time and budget constraints	2015-05-26	Paper
Influence diffusion in social networks under time window constraints	2015-05-22	Paper
A characterization of oblivious message adversaries for which consensus is solvable	2015-05-22	Paper
Influence Diffusion in Social Networks under Time Window Constraints	2013-12-17	Paper
Optimal gathering in radio grids with interference	2012-10-11	Paper
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults	2011-08-19	Paper
Efficient domination in circulant graphs with two chord lengths	2010-01-29	Paper
Neighborhood Broadcasting in Hypercubes	2008-12-05	Paper
https://portal.mardi4nfdi.de/entity/Q5755518	2007-08-13	Paper
Exchanging messages of different sizes	2006-05-22	Paper
Minimum chromaticity of circulant graphs	2005-10-10	Paper
Reliable broadcasting in double loop networks	2005-09-22	Paper
Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs	2002-09-19	Paper
Line broadcasting in cycles	1998-07-28	Paper
Bounded depth broadcasting	1996-11-05	Paper
Antepenultimate broadcasting	1996-10-07	Paper
Spanners of Hypercube-Derived Networks	1996-07-02	Paper
Reliable broadcasting	1995-03-05	Paper
Regularity and locality in \(k\)-terminal graphs	1994-11-28	Paper
Minimum broadcast digraphs	1993-01-16	Paper
Sparse broadcast graphs	1992-09-27	Paper
Broadcasting in Bounded Degree Graphs	1992-06-28	Paper
Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem	1988-01-01	Paper
Broadcast Networks of Bounded Degree	1988-01-01	Paper
Parallel approximation schemes for subset sum and knapsack problems	1987-01-01	Paper
Sequential Estimation Algorithm Using a Continuous UDU' Covariance Factorization	1980-01-01	Paper
Implementation of samplesort: A minimal storage tree sort	1975-01-01	Paper

Research outcomes over time

This page was built for person: Joseph G. Peters