Bruce E. Hajek

According to our database1, Bruce E. Hajek authored at least 96 papers between 1979 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The Longest-Chain Protocol Under Random Delays.
CoRR, 2021

2019
Community Recovery in a Preferential Attachment Graph.
IEEE Trans. Inf. Theory, 2019

Per-Flow Cardinality Estimation Based On Virtual LogLog Sketching.
Proceedings of the 53rd Annual Conference on Information Sciences and Systems, 2019

On non-unique solutions in mean field games.
Proceedings of the 58th IEEE Conference on Decision and Control, 2019

2018
Recovering a hidden community beyond the Kesten-Stigum threshold in O(|E|log*|V|) time.
J. Appl. Probab., 2018

Recovering a Hidden Community in a Preferential Attachment Graph.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Information Limits for Recovering a Hidden Community.
IEEE Trans. Inf. Theory, 2017

Submatrix localization via message passing.
J. Mach. Learn. Res., 2017

2016
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions.
IEEE Trans. Inf. Theory, 2016

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming.
IEEE Trans. Inf. Theory, 2016

Doubly randomized protocols for a random multiple access channel with "success-nonsuccess" feedback.
Probl. Inf. Transm., 2016

Semidefinite Programs for Exact Recovery of a Hidden Community.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Auctions.
Proceedings of the Encyclopedia of Systems and Control, 2015

On bidding with securities: Risk aversion and positive dependence.
Games Econ. Behav., 2015

Recovering a Hidden Community Beyond the Spectral Limit in O(|E|log<sup>*</sup>|V|) Time.
CoRR, 2015

Clustering and Inference From Pairwise Comparisons.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Bounds Implied by Drift with Applications.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Exact recovery threshold in the binary censored block model.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Computational Lower Bounds for Community Detection on Random Graphs.
Proceedings of The 28th Conference on Learning Theory, 2015

Achieving exact cluster recovery threshold via semidefinite programming under the stochastic block model.
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

2014
The Stability of Longest-Queue-First Scheduling With Variable Packet Sizes.
IEEE Trans. Autom. Control., 2014

Jointly clustering rows and columns of binary matrices: algorithms and trade-offs.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

Minimax-optimal Inference from Partial Rankings.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

A hybrid algorithm for content placement in distributed video on demand systems.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Auctions with a profit sharing contract.
Games Econ. Behav., 2013

Tree dynamics for peer-to-peer streaming.
CoRR, 2013

Single Video Performance Analysis for Video-on-Demand Systems.
CoRR, 2013

2012
Stability of a Peer-to-Peer Communication System.
IEEE Trans. Inf. Theory, 2012

On the Incentive to Deviate in Core Selecting Combinatorial Auctions
CoRR, 2012

The supermarket game.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Common Value Auctions with a Profit Sharing Contract
CoRR, 2011

2010
The missing piece syndrome in peer-to-peer communication.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Revenue optimal auction for single-minded buyers.
Proceedings of the 49th IEEE Conference on Decision and Control, 2010

Efficiency loss in revenue optimal auctions.
Proceedings of the 49th IEEE Conference on Decision and Control, 2010

2009
Low-SNR Capacity of Noncoherent Fading Channels.
IEEE Trans. Inf. Theory, 2009

A mechanism for pricing service guarantees.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

2008
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm.
IEEE Trans. Inf. Theory, 2008

A New Mechanism for the Free-Rider Problem.
IEEE Trans. Autom. Control., 2008

Substitute valuations: Generation and structure.
Perform. Evaluation, 2008

2007
Gossiping With Multiple Messages.
IEEE Trans. Inf. Theory, 2007

VCG-Kelly Mechanisms for Allocation of Divisible Goods: Adapting VCG Mechanisms to One-Dimensional Signals.
IEEE J. Sel. Areas Commun., 2007

Low SNR Capacity of Fading Channels -MIMO and Delay Spread.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Adaptive induced fluctuations for multiuser diversity.
IEEE Trans. Wirel. Commun., 2006

Comments on "Bit-interleaved coded modulation".
IEEE Trans. Inf. Theory, 2006

Low SNR Capacity of Fading Channels with Peak and Average Power Constraints.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Note On Mutual Information and Orthogonal Space-Time Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Capacity Per Unit Energy of Fading Channels With a Peak Constraint.
IEEE Trans. Inf. Theory, 2005

Lex-Optimal Online Multiclass Scheduling with Hard Deadlines.
Math. Oper. Res., 2005

Capacity bounds for noncoherent fading channels with a peak constraint.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On the value of a well chosen bit to the seller in an auction.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
On fixed input distributions for noncoherent communication over high-SNR Rayleigh-fading channels.
IEEE Trans. Inf. Theory, 2004

2003
Paging and Registration in Cellular Networks: Jointly Optimal Policies an d an Iterative Algorithm.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002
Broad-band fading channels: Signal burstiness and capacity.
IEEE Trans. Inf. Theory, 2002

Capacity and reliability function for small peak signal constraints.
IEEE Trans. Inf. Theory, 2002

An information-theoretic and game-theoretic study of timing channels.
IEEE Trans. Inf. Theory, 2002

On the use of packet classes in communication networks to enhance congestion pricing based on marks.
IEEE Trans. Autom. Control., 2002

Jointly optimal paging and registration for a symmetric random walk.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2000
Large bursts do not cause instability.
IEEE Trans. Autom. Control., 2000

1999
Information measures for discrete random fields.
IEEE Trans. Inf. Theory, 1999

1998
On variations of queue response for inputs with the same mean and autocorrelation function.
IEEE/ACM Trans. Netw., 1998

Information Theory and Communication Networks: An Unconsummated Union.
IEEE Trans. Inf. Theory, 1998

1997
Scheduling nonuniform traffic in a packet-switching system with small propagation delay.
IEEE/ACM Trans. Netw., 1997

On the capture probability for a large number of stations.
IEEE Trans. Commun., 1997

Analysis of Simple Algorithms for Dynamic Load Balancing.
Math. Oper. Res., 1997

1996
Review of 'Discrete Stochastic Processes' (Gallager, R.G.; 1996).
IEEE Trans. Inf. Theory, 1996

1995
Scheduling nonuniform traffic in a packet switching system with large propagation delay.
IEEE Trans. Inf. Theory, 1995

On Simple Algorithms for Dynamic Load Balancing.
Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994
On the delay in a multiple-access system with large propagation delay.
IEEE Trans. Inf. Theory, 1994

Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies".
IEEE Trans. Computers, 1994

A simple formula for mean multiplexing delay for independent regenerative sources.
Queueing Syst. Theory Appl., 1994

Sharper analysis of packet routing on a butterfly.
Networks, 1994

1993
On the average delay for routing subject to independent deflections.
IEEE Trans. Inf. Theory, 1993

Simple Formulas for Multiplexing Delay for Independent Regenerative Sources.
Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

1992
Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks.
IEEE Trans. Inf. Theory, 1992

Deflection routing in hypercube networks.
IEEE Trans. Commun., 1992

1991
On the maximum tolerable noise for reliable computation by formulas.
IEEE Trans. Inf. Theory, 1991

Bounds on Evacuation Time for Deflection Routing.
Distributed Comput., 1991

Packet Routing in Optimal Time on a Butterfly.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

1990
Performance of global load balancing of local adjustment.
IEEE Trans. Inf. Theory, 1990

Performance of Shuffle-Like Switching Networks with Deflection.
Proceedings of the Proceedings IEEE INFOCOM '90, 1990

1988
Link scheduling in polynomial time.
IEEE Trans. Inf. Theory, 1988

Cooling Schedules for Optimal Annealing.
Math. Oper. Res., 1988

The time complexity of maximum matching by simulated annealing.
J. ACM, 1988

1987
Locating the maximum of a simple random sequence by sequential search.
IEEE Trans. Inf. Theory, 1987

Optimal Dynamic Routing in Single Commodity Networks by Iterative Methods.
IEEE Trans. Commun., 1987

1985
Review of 'Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory' (Kushner, H.J.; 1984).
IEEE Trans. Inf. Theory, 1985

Stochastic approximation methods for decentralized control of multiaccess communications.
IEEE Trans. Inf. Theory, 1985

Extremal Splittings of Point Processes.
Math. Oper. Res., 1985

1984
Optimal dynamic routing in communication networks with continuous traffic.
Networks, 1984

1983
The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
J. ACM, October, 1983

Balanced Scheduling in a Packet Synchronized spread Spectrum Network.
Proceedings of the Proceedings IEEE INFOCOM 83, San Diego, CA, USA, April 18-21, 1983, 1983

1982
Information of partitions with applications to random access communications.
IEEE Trans. Inf. Theory, 1982

Information-singularity and recoverability of random processes.
IEEE Trans. Inf. Theory, 1982

A new upper bound to the throughput of a multi-access broadcast channel.
IEEE Trans. Inf. Theory, 1982

1979
Evaluation of an achievable rate region for the broadcast channel.
IEEE Trans. Inf. Theory, 1979

On the strong information singularity of certain stationary processes (Corresp.).
IEEE Trans. Inf. Theory, 1979


  Loading...