Joseph G. Peters

From MaRDI portal
Person:294853

Available identifiers

zbMath Open peters.joseph-gMaRDI QIDQ294853

List of research outcomes

PublicationDate of PublicationType
Temporal Cliques Admit Sparse Spanners2022-07-21Paper
Temporal cliques admit sparse spanners2021-07-06Paper
Fast and frugal targeting with incentives2020-02-20Paper
Computing parameters of sequence-based dynamic graphs2019-06-27Paper
Time-bounded influence diffusion with incentives2019-01-30Paper
Optimal odd gossiping2018-09-06Paper
Time-Bounded Influence Diffusion with Incentives2018-07-18Paper
A generic framework for computing parameters of sequence-based dynamic graphs2018-04-12Paper
Odd gossiping2017-03-15Paper
Deterministic small-world communication networks2016-06-16Paper
Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs2015-09-21Paper
Spread of influence in weighted networks under time and budget constraints2015-05-26Paper
Influence diffusion in social networks under time window constraints2015-05-22Paper
A characterization of oblivious message adversaries for which consensus is solvable2015-05-22Paper
Influence Diffusion in Social Networks under Time Window Constraints2013-12-17Paper
Optimal gathering in radio grids with interference2012-10-11Paper
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults2011-08-19Paper
Efficient domination in circulant graphs with two chord lengths2010-01-29Paper
Neighborhood Broadcasting in Hypercubes2008-12-05Paper
https://portal.mardi4nfdi.de/entity/Q57555182007-08-13Paper
Exchanging messages of different sizes2006-05-22Paper
Minimum chromaticity of circulant graphs2005-10-10Paper
Reliable broadcasting in double loop networks2005-09-22Paper
Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs2002-09-19Paper
Line broadcasting in cycles1998-07-28Paper
Bounded depth broadcasting1996-11-05Paper
Antepenultimate broadcasting1996-10-07Paper
Spanners of Hypercube-Derived Networks1996-07-02Paper
Reliable broadcasting1995-03-05Paper
Regularity and locality in \(k\)-terminal graphs1994-11-28Paper
Minimum broadcast digraphs1993-01-16Paper
Sparse broadcast graphs1992-09-27Paper
Broadcasting in Bounded Degree Graphs1992-06-28Paper
Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem1988-01-01Paper
Broadcast Networks of Bounded Degree1988-01-01Paper
Parallel approximation schemes for subset sum and knapsack problems1987-01-01Paper
Sequential Estimation Algorithm Using a Continuous UDU' Covariance Factorization1980-01-01Paper
Implementation of samplesort: A minimal storage tree sort1975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Joseph G. Peters