Bruce Hajek

From MaRDI portal
Person:380924

Available identifiers

zbMath Open hajek.bruce-eWikidataQ26703263 ScholiaQ26703263MaRDI QIDQ380924

List of research outcomes

PublicationDate of PublicationType
The Longest-Chain Protocol Under Random Delays2024-02-23Paper
Community Recovery in a Preferential Attachment Graph2020-01-28Paper
On non-unique solutions in mean field games2019-03-13Paper
Submatrix localization via message passing2018-11-22Paper
Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log*|V|) time2018-09-26Paper
Preferential Attachment Graphs with Planted Communities2018-01-21Paper
Information Limits for Recovering a Hidden Community2017-10-19Paper
A New Mechanism for the Free-Rider Problem2017-08-08Paper
Low-SNR Capacity of Noncoherent Fading Channels2017-08-08Paper
Doubly randomized protocols for a random multiple access channel with ``success-nonsuccess feedback2017-07-21Paper
Stability of a Peer-to-Peer Communication System2017-07-12Paper
On the use of packet classes in communication networks to enhance congestion pricing based on marks2017-06-20Paper
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions2017-04-28Paper
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming2017-04-28Paper
Stability of a peer-to-peer communication system2015-09-11Paper
On bidding with securities: risk aversion and positive dependence2015-05-05Paper
https://portal.mardi4nfdi.de/entity/Q51795602015-03-20Paper
A maximal inequality for supermartingales2014-09-29Paper
The Missing Piece Syndrome in Peer-to-Peer Communication2014-07-21Paper
The Supermarket Game2014-07-21Paper
Auctions with a profit sharing contract2013-11-14Paper
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm2009-02-24Paper
On Fixed Input Distributions forNoncoherent Communication Over High-SNR Rayleigh-Fading Channels2008-12-21Paper
Capacity Per Unit Energy of Fading Channels With a Peak Constraint2008-12-21Paper
Comments on "Bit-interleaved coded modulation"2008-12-21Paper
Gossiping With Multiple Messages2008-12-21Paper
Lex-Optimal Online Multiclass Scheduling with Hard Deadlines2005-11-11Paper
Broad-band fading channels: signal burstiness and capacity2005-05-11Paper
Capacity and reliability function for small peak signal constraints2005-05-11Paper
An information-theoretic and game-theoretic study of timing channels2005-05-11Paper
A queue with semiperiodic traffic2005-05-03Paper
https://portal.mardi4nfdi.de/entity/Q44608172004-03-29Paper
Large bursts do not cause instability2000-10-17Paper
On large deviations in load sharing networks2000-06-08Paper
On large deviations of Markov processes with discontinuous statistics2000-05-09Paper
Information theory and communication networks: an unconsummated union1999-11-21Paper
Analysis of Simple Algorithms for Dynamic Load Balancing1999-01-18Paper
Balanced loads in infinite networks1997-06-10Paper
https://portal.mardi4nfdi.de/entity/Q48951381996-11-19Paper
https://portal.mardi4nfdi.de/entity/Q48948101996-10-07Paper
Scheduling nonuniform traffic in a packet switching system with large propagation delay1995-07-12Paper
On the delay in a multiple-access system with large propagation delay1995-03-01Paper
A simple formula for mean multiplexing delay for independent regenerative sources1994-11-21Paper
Sharper analysis of packet routing on a butterfly1994-09-11Paper
On the average delay for routing subject to independent deflections1993-05-16Paper
Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks1993-02-04Paper
Deflection routing in hypercube networks1993-01-16Paper
The time complexity of maximum matching by simulated annealing1992-06-25Paper
Bounds on evacuation time for deflection routing1991-01-01Paper
On the maximum tolerable noise for reliable computation by formulas1991-01-01Paper
Performance of global load balancing by local adjustment1990-01-01Paper
Simulated annealing - to cool or not1989-01-01Paper
Cooling Schedules for Optimal Annealing1988-01-01Paper
Link scheduling in polynomial time1988-01-01Paper
A decomposition theorem for binary Markov random fields1987-01-01Paper
Locating the maximum of a simple random sequence by sequential search1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38273351987-01-01Paper
Optimization by simulated annealing: a necessary and sufficient condition for convergence1986-01-01Paper
Mean stochastic comparison of diffusions1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33346921985-01-01Paper
Stochastic approximation methods for decentralized control of multiaccess communications1985-01-01Paper
Extremal Splittings of Point Processes1985-01-01Paper
Optimal control of two interacting service stations1984-01-01Paper
Optimal dynamic routing in communication networks with continuous traffic1984-01-01Paper
The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks1983-01-01Paper
Multiple stochastic integrals: Projection and iteration1983-01-01Paper
Stochastic equations of hyperbolic type and a two-parameter Stratonovich calculus1982-01-01Paper
Information-singularity and recoverability of random processes1982-01-01Paper
Decentralized dynamic control of a multiaccess broadcast channel1982-01-01Paper
Information of partitions with applications to random access communications1982-01-01Paper
Hitting-time and occupation-time bounds implied by drift analysis with applications1982-01-01Paper
Birth-and-death processes on the integers with phases and general boundaries1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39022671981-01-01Paper
Representation and transformation of two-parameter martingales under a change of measure1980-01-01Paper
On the strong information singularity of certain stationary processes (Corresp.)1979-01-01Paper
Evaluation of an achievable rate region for the broadcast channel1979-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: Bruce Hajek