default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruce E. Hajek
Person information
- affiliation: University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c44]Taha Ameen, Bruce E. Hajek:
Robust Graph Matching when Nodes are Corrupt. ICML 2024- [i32]Taha Ameen, Bruce E. Hajek:
Exact Random Graph Matching with Multiple Graphs. CoRR abs/2405.12293 (2024) - 2023
- [c43]Zeyu Zhou, Bruce E. Hajek:
Particle Thompson Sampling with Static Particles. CISS 2023: 1-6 - [c42]Zeyu Zhou, Bruce E. Hajek:
Improving Particle Thompson Sampling through Regenerative Particles. CISS 2023: 1-4 - 2022
- [c41]Taha Ameen, Suryanarayana Sankagiri, Bruce E. Hajek:
Blockchain Security when Messages are Lost. ConsensusDay@CCS 2022: 1-14 - [c40]Bruce E. Hajek, Xiaohan Kang:
Maximum Likelihood Estimation of Optimal Receiver Operating Characteristic Curves From Likelihood Ratio Observations. ISIT 2022: 898-903 - [i31]Bruce E. Hajek, Xiaohan Kang:
Maximum Likelihood Estimation of Optimal Receiver Operating Characteristic Curves from Likelihood Ratio Observations. CoRR abs/2202.01956 (2022) - [i30]Taha Ameen, Suryanarayana Sankagiri, Bruce E. Hajek:
Blockchain Security when Messages are Lost. CoRR abs/2202.07904 (2022) - [i29]Zeyu Zhou, Bruce E. Hajek, Nakjung Choi, Anwar Walid:
Regenerative Particle Thompson Sampling. CoRR abs/2203.08082 (2022) - 2021
- [c39]Xiaohan Kang, Bruce E. Hajek:
Lower Bounds on Information Requirements for Causal Network Inference. ISIT 2021: 754-759 - [i28]Xiaohan Kang, Bruce E. Hajek:
Lower Bounds on Information Requirements for Causal Network Inference. CoRR abs/2102.00055 (2021) - [i27]Suryanarayana Sankagiri, Shreyas Gandlur, Bruce E. Hajek:
The Longest-Chain Protocol Under Random Delays. CoRR abs/2102.00973 (2021)
2010 – 2019
- 2019
- [j61]Bruce E. Hajek
, Suryanarayana Sankagiri:
Community Recovery in a Preferential Attachment Graph. IEEE Trans. Inf. Theory 65(11): 6853-6874 (2019) - [c38]Bruce E. Hajek, Michael Livesay:
On non-unique solutions in mean field games. CDC 2019: 1219-1224 - [c37]Zeyu Zhou, Bruce E. Hajek:
Per-Flow Cardinality Estimation Based On Virtual LogLog Sketching. CISS 2019: 1-6 - 2018
- [j60]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Recovering a hidden community beyond the Kesten-Stigum threshold in O(|E|log*|V|) time. J. Appl. Probab. 55(2): 325-352 (2018) - [c36]Bruce E. Hajek, Suryanarayana Sankagiri:
Recovering a Hidden Community in a Preferential Attachment Graph. ISIT 2018: 2097-2101 - [i26]Bruce E. Hajek, Suryanarayana Sankagiri:
Recovering a Hidden Community in a Preferential Attachment Graph. CoRR abs/1801.06818 (2018) - 2017
- [j59]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Submatrix localization via message passing. J. Mach. Learn. Res. 18: 186:1-186:52 (2017) - [j58]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Information Limits for Recovering a Hidden Community. IEEE Trans. Inf. Theory 63(8): 4729-4745 (2017) - [e2]Bruce E. Hajek, Sewoong Oh, Augustin Chaintreau, Leana Golubchik, Zhi-Li Zhang:
Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05 - 09, 2017. ACM 2017, ISBN 978-1-4503-5032-7 [contents] - 2016
- [j57]S. G. Foss, Bruce E. Hajek, Andrey M. Turlikov:
Doubly randomized protocols for a random multiple access channel with "success-nonsuccess" feedback. Probl. Inf. Transm. 52(2): 156-165 (2016) - [j56]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming. IEEE Trans. Inf. Theory 62(5): 2788-2797 (2016) - [j55]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions. IEEE Trans. Inf. Theory 62(10): 5918-5937 (2016) - [c35]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Semidefinite Programs for Exact Recovery of a Hidden Community. COLT 2016: 1051-1095 - [c34]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Information limits for recovering a hidden community. ISIT 2016: 1894-1898 - [i25]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Semidefinite Programs for Exact Recovery of a Hidden Community. CoRR abs/1602.06410 (2016) - 2015
- [j54]Vineet Abhishek, Bruce E. Hajek, Steven R. Williams:
On bidding with securities: Risk aversion and positive dependence. Games Econ. Behav. 90: 66-80 (2015) - [c33]Yihong Wu, Jiaming Xu, Bruce E. Hajek:
Achieving exact cluster recovery threshold via semidefinite programming under the stochastic block model. ACSSC 2015: 1070-1074 - [c32]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Computational Lower Bounds for Community Detection on Random Graphs. COLT 2015: 899-928 - [c31]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Achieving exact cluster recovery threshold via semidefinite programming. ISIT 2015: 1442-1446 - [c30]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Exact recovery threshold in the binary censored block model. ITW Fall 2015: 99-103 - [c29]Bruce E. Hajek:
Bounds Implied by Drift with Applications. SIGMETRICS 2015: 1 - [c28]Rui Wu, Jiaming Xu, Rayadurgam Srikant, Laurent Massoulié, Marc Lelarge, Bruce E. Hajek:
Clustering and Inference From Pairwise Comparisons. SIGMETRICS 2015: 449-450 - [r1]Bruce E. Hajek:
Auctions. Encyclopedia of Systems and Control 2015 - [i24]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions. CoRR abs/1502.07738 (2015) - [i23]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Information Limits for Recovering a Hidden Community. CoRR abs/1509.07859 (2015) - [i22]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Recovering a Hidden Community Beyond the Spectral Limit in O(|E|log*|V|) Time. CoRR abs/1510.02786 (2015) - [i21]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Submatrix localization via message passing. CoRR abs/1510.09219 (2015) - 2014
- [j53]Siva Theja Maguluri, Bruce E. Hajek, R. Srikant:
The Stability of Longest-Queue-First Scheduling With Variable Packet Sizes. IEEE Trans. Autom. Control. 59(8): 2295-2300 (2014) - [c27]James Yifei Yang, Bruce E. Hajek:
A hybrid algorithm for content placement in distributed video on demand systems. ISIT 2014: 816-820 - [c26]Bruce E. Hajek, Sewoong Oh, Jiaming Xu:
Minimax-optimal Inference from Partial Rankings. NIPS 2014: 1475-1483 - [c25]Jiaming Xu, Rui Wu, Kai Zhu, Bruce E. Hajek, R. Srikant, Lei Ying:
Jointly clustering rows and columns of binary matrices: algorithms and trade-offs. SIGMETRICS 2014: 29-41 - [i20]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Computational Lower Bounds for Community Detection on Random Graphs. CoRR abs/1406.6625 (2014) - [i19]Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming. CoRR abs/1412.6156 (2014) - 2013
- [j52]Vineet Abhishek, Bruce E. Hajek, Steven R. Williams:
Auctions with a profit sharing contract. Games Econ. Behav. 77(1): 247-270 (2013) - [i18]James Yifei Yang, Bruce E. Hajek:
Single Video Performance Analysis for Video-on-Demand Systems. CoRR abs/1307.0849 (2013) - [i17]Ji Zhu, Bruce E. Hajek:
Tree dynamics for peer-to-peer streaming. CoRR abs/1308.1971 (2013) - 2012
- [j51]Ji Zhu, Bruce E. Hajek:
Stability of a Peer-to-Peer Communication System. IEEE Trans. Inf. Theory 58(7): 4693-4713 (2012) - [c24]Jiaming Xu, Bruce E. Hajek:
The supermarket game. ISIT 2012: 2511-2515 - [i16]Jiaming Xu, Bruce E. Hajek:
The Supermarket Game. CoRR abs/1202.2089 (2012) - [i15]Vineet Abhishek, Bruce E. Hajek:
On the Incentive to Deviate in Core Selecting Combinatorial Auctions. CoRR abs/1209.2131 (2012) - 2011
- [c23]Siva Theja Maguluri, Bruce E. Hajek, R. Srikant:
The stability of longest-queue-first scheduling with variable packet sizes. CDC/ECC 2011: 3770-3775 - [c22]Ji Zhu, Bruce E. Hajek:
Stability of a peer-to-peer communication system. PODC 2011: 321-330 - [i14]Vineet Abhishek, Bruce E. Hajek, Steven R. Williams:
Common Value Auctions with a Profit Sharing Contract. CoRR abs/1102.3195 (2011) - [i13]Ji Zhu, Bruce E. Hajek:
Stability of a Peer-to-Peer Communication System. CoRR abs/1110.2753 (2011) - [i12]Vineet Abhishek, Bruce E. Hajek, Steven R. Williams:
On Bidding with Securities: Risk Aversion and Positive Dependence. CoRR abs/1111.1453 (2011) - 2010
- [c21]Vineet Abhishek, Bruce E. Hajek:
Efficiency loss in revenue optimal auctions. CDC 2010: 1082-1087 - [c20]Vineet Abhishek, Bruce E. Hajek:
Revenue optimal auction for single-minded buyers. CDC 2010: 1842-1847 - [c19]Bruce E. Hajek, Ji Zhu:
The missing piece syndrome in peer-to-peer communication. ISIT 2010: 1748-1752 - [i11]Bruce E. Hajek, Ji Zhu:
The Missing Piece Syndrome in Peer-to-Peer Communication. CoRR abs/1002.3493 (2010) - [i10]Vineet Abhishek, Bruce E. Hajek:
Revenue Optimal Auction for Single-Minded Buyers. CoRR abs/1005.1059 (2010) - [i9]Vineet Abhishek, Bruce E. Hajek:
Efficiency Loss in Revenue Optimal Auctions. CoRR abs/1005.1121 (2010)
2000 – 2009
- 2009
- [j50]Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
Low-SNR Capacity of Noncoherent Fading Channels. IEEE Trans. Inf. Theory 55(4): 1555-1574 (2009) - [c18]Bruce E. Hajek, Sichao Yang:
A mechanism for pricing service guarantees. ITW 2009: 211-215 - [e1]Bruce E. Hajek, Leandros Tassiulas, Venkat Anantharam, Ioannis Kontoyiannis:
2009 IEEE Information Theory Workshop, ITW 2009, Volos, Greece, June 10-12, 2009. IEEE 2009, ISBN 978-1-4244-4536-3 [contents] - 2008
- [j49]Bruce E. Hajek:
Substitute valuations: Generation and structure. Perform. Evaluation 65(11-12): 789-803 (2008) - [j48]Sujay Sanghavi, Bruce E. Hajek:
A New Mechanism for the Free-Rider Problem. IEEE Trans. Autom. Control. 53(5): 1176-1183 (2008) - [j47]Bruce E. Hajek, Kevin Mitzel, Sichao Yang:
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm. IEEE Trans. Inf. Theory 54(2): 608-622 (2008) - 2007
- [j46]Sichao Yang, Bruce E. Hajek:
VCG-Kelly Mechanisms for Allocation of Divisible Goods: Adapting VCG Mechanisms to One-Dimensional Signals. IEEE J. Sel. Areas Commun. 25(6): 1237-1243 (2007) - [j45]Sujay Sanghavi, Bruce E. Hajek, Laurent Massoulié:
Gossiping With Multiple Messages. IEEE Trans. Inf. Theory 53(12): 4640-4654 (2007) - [c17]Sujay Sanghavi, Bruce E. Hajek, Laurent Massoulié:
Gossiping with Multiple Messages. INFOCOM 2007: 2135-2143 - [c16]Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
Low SNR Capacity of Fading Channels -MIMO and Delay Spread. ISIT 2007: 516-520 - [i8]Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
Low SNR Capacity of Noncoherent Fading Channels. CoRR abs/0712.2872 (2007) - [i7]Bruce E. Hajek:
Substitute Valuations: Generation and Structure. CoRR abs/0712.3870 (2007) - [i6]Vignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth:
Low SNR Capacity of Fading Channels -- MIMO and Delay Spread. CoRR abs/cs/0701078 (2007) - [i5]Bruce E. Hajek, Kevin Mitzel, Sichao Yang:
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm. CoRR abs/cs/0702102 (2007) - 2006
- [j44]Vignesh Sethuraman, Bruce E. Hajek:
Comments on "Bit-interleaved coded modulation". IEEE Trans. Inf. Theory 52(4): 1795-1797 (2006) - [j43]Sujay Sanghavi, Bruce E. Hajek:
Adaptive induced fluctuations for multiuser diversity. IEEE Trans. Wirel. Commun. 5(6): 1294-1305 (2006) - [c15]Sichao Yang, Bruce E. Hajek:
VCG-Kelly Mechanisms for Allocation of Divisible Goods: Adapting VCG Mechanisms to One-Dimensional Signals. CISS 2006: 1391-1396 - [c14]Vignesh Sethuraman, Bruce E. Hajek:
Low SNR Capacity of Fading Channels with Peak and Average Power Constraints. ISIT 2006: 689-693 - [c13]Guy Bresler, Bruce E. Hajek:
Note On Mutual Information and Orthogonal Space-Time Codes. ISIT 2006: 1315-1318 - [i4]Vignesh Sethuraman, Bruce E. Hajek:
Low SNR Capacity of Fading Channels with Peak and Average Power Constraints. CoRR abs/cs/0604049 (2006) - [i3]Sujay Sanghavi, Bruce E. Hajek, Laurent Massoulié:
Gossiping with Multiple Messages. CoRR abs/cs/0612118 (2006) - 2005
- [j42]Bruce E. Hajek, Pierre Seri:
Lex-Optimal Online Multiclass Scheduling with Hard Deadlines. Math. Oper. Res. 30(3): 562-596 (2005) - [j41]Vignesh Sethuraman, Bruce E. Hajek:
Capacity Per Unit Energy of Fading Channels With a Peak Constraint. IEEE Trans. Inf. Theory 51(9): 3102-3120 (2005) - [c12]Bruce E. Hajek:
On the value of a well chosen bit to the seller in an auction. ISIT 2005: 293-296 - [c11]Vignesh Sethuraman, Bruce E. Hajek, Krishna R. Narayanan:
Capacity bounds for noncoherent fading channels with a peak constraint. ISIT 2005: 515-519 - [c10]Sujay Sanghavi, Bruce E. Hajek:
A new mechanism for the free-rider problem. P2PECON@SIGCOMM 2005: 122-127 - [i2]Vignesh Sethuraman, Bruce E. Hajek:
Capacity per Unit Energy of Fading Channels with a Peak Constraint. CoRR abs/cs/0504085 (2005) - [i1]Vignesh Sethuraman, Bruce E. Hajek:
Comments on 'Bit Interleaved Coded Modulation'. CoRR abs/cs/0506052 (2005) - 2004
- [j40]Rong-Rong Chen, Bruce E. Hajek, Ralf Koetter, Upamanyu Madhow:
On fixed input distributions for noncoherent communication over high-SNR Rayleigh-fading channels. IEEE Trans. Inf. Theory 50(12): 3390-3396 (2004) - [c9]Sujay Sanghavi, Bruce E. Hajek:
Optimal allocation of a divisible good to strategic buyers. CDC 2004: 2748-2753 - 2003
- [c8]Bruce E. Hajek, Kevin Mitzel, Sichao Yang:
Paging and Registration in Cellular Networks: Jointly Optimal Policies an d an Iterative Algorithm. INFOCOM 2003: 524-532 - 2002
- [j39]Juan Alvarez, Bruce E. Hajek:
On the use of packet classes in communication networks to enhance congestion pricing based on marks. IEEE Trans. Autom. Control. 47(6): 1020-1026 (2002) - [j38]Vijay G. Subramanian, Bruce E. Hajek:
Broad-band fading channels: Signal burstiness and capacity. IEEE Trans. Inf. Theory 48(4): 809-827 (2002) - [j37]Bruce E. Hajek, Vijay G. Subramanian:
Capacity and reliability function for small peak signal constraints. IEEE Trans. Inf. Theory 48(4): 828-839 (2002) - [j36]James Giles, Bruce E. Hajek:
An information-theoretic and game-theoretic study of timing channels. IEEE Trans. Inf. Theory 48(9): 2455-2477 (2002) - [c7]Bruce E. Hajek:
Jointly optimal paging and registration for a symmetric random walk. ITW 2002: 20-23 - 2000
- [j35]Bruce E. Hajek:
Large bursts do not cause instability. IEEE Trans. Autom. Control. 45(1): 116-118 (2000)
1990 – 1999
- 1999
- [j34]Bruce E. Hajek:
Information measures for discrete random fields. IEEE Trans. Inf. Theory 45(6): 2210-2211 (1999) - 1998
- [j33]Anthony Ephremides, Bruce E. Hajek:
Information Theory and Communication Networks: An Unconsummated Union. IEEE Trans. Inf. Theory 44(6): 2416-2434 (1998) - [j32]Bruce E. Hajek, Linhai He:
On variations of queue response for inputs with the same mean and autocorrelation function. IEEE/ACM Trans. Netw. 6(5): 588-598 (1998) - 1997
- [j31]Murat Alanyali, Bruce E. Hajek:
Analysis of Simple Algorithms for Dynamic Load Balancing. Math. Oper. Res. 22(4): 840-871 (1997) - [j30]Bruce E. Hajek, Arvind Krishna, Richard O. LaMaire:
On the capture probability for a large number of stations. IEEE Trans. Commun. 45(2): 254-260 (1997) - [j29]Timothy Weller, Bruce E. Hajek:
Scheduling nonuniform traffic in a packet-switching system with small propagation delay. IEEE/ACM Trans. Netw. 5(6): 813-823 (1997) - 1996
- [j28]Bruce E. Hajek:
Review of 'Discrete Stochastic Processes' (Gallager, R.G.; 1996). IEEE Trans. Inf. Theory 42(6): 2273 (1996) - 1995
- [j27]Bruce E. Hajek, Timothy Weller:
Scheduling nonuniform traffic in a packet switching system with large propagation delay. IEEE Trans. Inf. Theory 41(2): 358-365 (1995) - [c6]Murat Alanyali, Bruce E. Hajek:
On Simple Algorithms for Dynamic Load Balancing. INFOCOM 1995: 230-238 - 1994
- [j26]Arvind Krishna, Bruce E. Hajek, Andrea Pietracaprina:
Sharper analysis of packet routing on a butterfly. Networks 24(2): 91-101 (1994) - [j25]Hervé Dupuis, Bruce E. Hajek:
A simple formula for mean multiplexing delay for independent regenerative sources. Queueing Syst. Theory Appl. 16(3-4): 195-239 (1994) - [j24]Timothy Weller, Bruce E. Hajek:
Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies". IEEE Trans. Computers 43(7): 862-863 (1994) - [j23]Bruce E. Hajek, Nikolay B. Likhanov, Boris S. Tsybakov:
On the delay in a multiple-access system with large propagation delay. IEEE Trans. Inf. Theory 40(4): 1158-1166 (1994) - [c5]Timothy Weller, Bruce E. Hajek:
Scheduling Nonuniform Traffic in a Packet Switching System with Small Propagation Delay. INFOCOM 1994: 1344-1351 - 1993
- [j22]Michael Carr, Bruce E. Hajek:
Scheduling with asynchronous service opportunities with applications to multiple satellite systems. IEEE Trans. Autom. Control. 38(12): 1820-1833 (1993) - [j21]Bruce E. Hajek, Rene L. Cruz:
On the average delay for routing subject to independent deflections. IEEE Trans. Inf. Theory 39(1): 84-91 (1993) - [c4]Hervé Dupuis, Bruce E. Hajek:
Simple Formulas for Multiplexing Delay for Independent Regenerative Sources. INFOCOM 1993: 28-35 - 1992
- [j20]Albert G. Greenberg, Bruce E. Hajek:
Deflection routing in hypercube networks. IEEE Trans. Commun. 40(6): 1070-1081 (1992) - [j19]Branko Radosavljevic, Erdal Arikan, Bruce E. Hajek:
Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks. IEEE Trans. Inf. Theory 38(6): 1833-1839 (1992) - 1991
- [j18]Bruce E. Hajek:
Bounds on Evacuation Time for Deflection Routing. Distributed Comput. 5: 1-6 (1991) - [j17]Bruce E. Hajek, Timothy Weller:
On the maximum tolerable noise for reliable computation by formulas. IEEE Trans. Inf. Theory 37(2): 388-391 (1991) - [c3]Arvind Krishna, Andrea Pietracaprina, Bruce E. Hajek:
Packet Routing in Optimal Time on a Butterfly. INFOCOM 1991: 840-849 - 1990
- [j16]Bruce E. Hajek:
Performance of global load balancing of local adjustment. IEEE Trans. Inf. Theory 36(6): 1398-1414 (1990) - [c2]Arvind Krishna, Bruce E. Hajek:
Performance of Shuffle-Like Switching Networks with Deflection. INFOCOM 1990: 473-480
1980 – 1989
- 1988
- [j15]Galen H. Sasaki, Bruce E. Hajek:
The time complexity of maximum matching by simulated annealing. J. ACM 35(2): 387-403 (1988) - [j14]Bruce E. Hajek:
Cooling Schedules for Optimal Annealing. Math. Oper. Res. 13(2): 311-329 (1988) - [j13]Bruce E. Hajek, Galen H. Sasaki:
Link scheduling in polynomial time. IEEE Trans. Inf. Theory 34(5): 910-917 (1988) - 1987
- [j12]Galen H. Sasaki, Bruce E. Hajek:
Optimal Dynamic Routing in Single Commodity Networks by Iterative Methods. IEEE Trans. Commun. 35(11): 1199-1206 (1987) - [j11]Bruce E. Hajek:
Locating the maximum of a simple random sequence by sequential search. IEEE Trans. Inf. Theory 33(6): 877-881 (1987) - 1985
- [j10]Bruce E. Hajek:
Extremal Splittings of Point Processes. Math. Oper. Res. 10(4): 543-556 (1985) - [j9]Bruce E. Hajek:
Stochastic approximation methods for decentralized control of multiaccess communications. IEEE Trans. Inf. Theory 31(2): 176-184 (1985) - [j8]Bruce E. Hajek:
Review of 'Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory' (Kushner, H.J.; 1984). IEEE Trans. Inf. Theory 31(6): 841 (1985) - 1984
- [j7]Bruce E. Hajek, Richard G. Ogier:
Optimal dynamic routing in communication networks with continuous traffic. Networks 14(3): 457-487 (1984) - 1983
- [j6]Bruce E. Hajek:
The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks. J. ACM 30(4): 834-851 (1983) - [c1]Bruce E. Hajek:
Balanced Scheduling in a Packet Synchronized spread Spectrum Network. INFOCOM 1983: 56-65 - 1982
- [j5]Rene L. Cruz, Bruce E. Hajek:
A new upper bound to the throughput of a multi-access broadcast channel. IEEE Trans. Inf. Theory 28(3): 402-405 (1982) - [j4]Bruce E. Hajek:
Information-singularity and recoverability of random processes. IEEE Trans. Inf. Theory 28(3): 422-429 (1982) - [j3]Bruce E. Hajek:
Information of partitions with applications to random access communications. IEEE Trans. Inf. Theory 28(5): 691-700 (1982)
1970 – 1979
- 1979
- [j2]Bruce E. Hajek, Michael B. Pursley:
Evaluation of an achievable rate region for the broadcast channel. IEEE Trans. Inf. Theory 25(1): 36-46 (1979) - [j1]Bruce E. Hajek:
On the strong information singularity of certain stationary processes (Corresp.). IEEE Trans. Inf. Theory 25(5): 605-609 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
