default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmir Dembo
Person information
- affiliation: Stanford University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c10]Vivek Kumar Bagaria, Amir Dembo, Sreeram Kannan, Sewoong Oh, David Tse, Pramod Viswanath, Xuechao Wang
, Ofer Zeitouni:
Proof-of-Stake Longest Chain Protocols: Security vs Predictability. ConsensusDay@CCS 2022: 29-42- 2021
- [j29]Sohom Bhattacharya, Amir Dembo:
Upper tail for homomorphism counts in constrained sparse random graphs. Random Struct. Algorithms 59(3): 315-338 (2021) - 2020
- [c9]Amir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse, Pramod Viswanath, Xuechao Wang, Ofer Zeitouni:
Everything is a Race and Nakamoto Always Wins. CCS 2020: 859-878 - [i4]Amir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse, Pramod Viswanath, Xuechao Wang, Ofer Zeitouni:
Everything is a Race and Nakamoto Always Wins. CoRR abs/2005.10484 (2020) - [i3]Amir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse, Pramod Viswanath, Xuechao Wang, Ofer Zeitouni:
Everything is a Race and Nakamoto Always Wins. IACR Cryptol. ePrint Arch. 2020: 601 (2020)
2010 – 2019
- 2015
- [i2]Amir Dembo, Andrea Montanari, Subhabrata Sen:
Extremal Cuts of Sparse Random Graphs. CoRR abs/1503.03923 (2015) - 2011
- [i1]Amir Dembo, Andrea Montanari, Nike Sun:
Factor models on locally tree-like graphs. CoRR abs/1110.4821 (2011)
2000 – 2009
- 2005
- [j28]Amir Dembo, Tsachy Weissman:
Universal denoising for the finite-input general-output channel. IEEE Trans. Inf. Theory 51(4): 1507-1517 (2005) - 2004
- [j27]Amir Dembo, Jean-Dominique Deuschel, Darrell Duffie:
Large portfolio losses. Finance Stochastics 8(1): 3-16 (2004) - [c8]Amir Dembo, Tsachy Weissman:
Universal denoising for the finite-input-general-output channel. ISIT 2004: 201 - 2003
- [j26]Amir Dembo, Tsachy Weissman:
The minimax distortion redundancy in noisy source coding. IEEE Trans. Inf. Theory 49(11): 3020-3030 (2003) - 2002
- [j25]Amir Dembo, Ioannis Kontoyiannis:
Source coding, large deviations, and approximate pattern matching. IEEE Trans. Inf. Theory 48(6): 1590-1615 (2002) - 2001
- [j24]Amir Dembo, Ioannis Kontoyiannis:
Critical behavior in lossy source coding. IEEE Trans. Inf. Theory 47(3): 1230-1236 (2001)
1990 – 1999
- 1998
- [b1]Amir Dembo, Ofer Zeitouni:
Large Deviations Techniques and Applications. Springer 1998, ISBN 978-1-4612-5320-4, pp. 1-339 - 1995
- [j23]Amir Dembo, Victor Galperin, Ofer Zeitouni:
Exponential rates for error probabilities in DMPSK systems. IEEE Trans. Commun. 43(2/3/4): 915-921 (1995) - 1994
- [j22]Kai-Yeung Siu, Amir Dembo, Thomas Kailath:
On the Perceptron Learning Algorithm on Data with High Precision. J. Comput. Syst. Sci. 48(2): 347-356 (1994) - [j21]Amir Dembo, Ofer Zeitouni:
A large deviations analysis of range tracking loops. IEEE Trans. Autom. Control. 39(2): 360-364 (1994) - [j20]Shlomo Shamai, Amir Dembo:
Bounds on the symmetric binary cutoff rate for dispersive Gaussian channels. IEEE Trans. Commun. 42(1): 39-53 (1994) - [j19]Tsutomu Kawabata, Amir Dembo:
The rate-distortion dimension of sets and measures. IEEE Trans. Inf. Theory 40(5): 1564-1572 (1994) - 1991
- [j18]Amir Dembo, Thomas M. Cover, Joy A. Thomas:
Information theoretic inequalities. IEEE Trans. Inf. Theory 37(6): 1501-1518 (1991) - [j17]Oluseyi Farotimi, Amir Dembo, Thomas Kailath:
A general weight matrix formulation using optimal control. IEEE Trans. Neural Networks 2(3): 378-394 (1991) - 1990
- [j16]Amir Dembo, Jack Salz:
On the least squares tap adjustment algorithm in adaptive digital echo cancellers. IEEE Trans. Commun. 38(5): 622-628 (1990) - [j15]Amir Dembo, Thomas Kailath:
Model-free distributed learning. IEEE Trans. Neural Networks 1(1): 58-70 (1990)
1980 – 1989
- 1989
- [j14]Amir Dembo:
On the capacity of associative memories with linear threshold functions. IEEE Trans. Inf. Theory 35(4): 709-720 (1989) - [j13]Amir Dembo:
Simple proof of the concavity of the entropy power with respect to Gaussian noise. IEEE Trans. Inf. Theory 35(4): 887-888 (1989) - [j12]Yariv Ephraim, Amir Dembo, Lawrence R. Rabiner:
A minimum discrimination information approach for hidden Markov modeling. IEEE Trans. Inf. Theory 35(5): 1001-1013 (1989) - [j11]Amir Dembo:
On Gaussian feedback capacity. IEEE Trans. Inf. Theory 35(5): 1072-1076 (1989) - [j10]Amir Dembo, Colin L. Mallows, Lawrence A. Shepp:
Embedding nonnegative definite Toeplitz matrices in nonnegative definite circulant matrices, with application to covariance estimation. IEEE Trans. Inf. Theory 35(6): 1206-1212 (1989) - [j9]Amir Dembo:
Signal reconstruction from noisy partial information of its transform. IEEE Trans. Acoust. Speech Signal Process. 37(1): 65-72 (1989) - [c7]E. Ofer, David Malah, Amir Dembo:
A unified framework for LPC excitation representation in residual speech coders. ICASSP 1989: 41-44 - [c6]Oluseyi Farotimi, Amir Dembo, Thomas Kailath:
Neural Network Weight Matrix Synthesis Using Optimal Control Techniques. NIPS 1989: 348-354 - [c5]Amir Dembo, Kai-Yeung Siu, Thomas Kailath:
Complexity of Finite Precision Neural Network Classifier. NIPS 1989: 668-675 - 1988
- [j8]Amir Dembo:
Bounds on the extreme eigenvalues of positive-definite Toeplitz matrices. IEEE Trans. Inf. Theory 34(2): 352-355 (1988) - [j7]Ofer Zeitouni, Amir Dembo:
Exact filters for the estimation of the number of transitions of finite-state continuous-time Markov processes. IEEE Trans. Inf. Theory 34(4): 890-893 (1988) - [j6]Amir Dembo, David Malah:
Signal synthesis from modified discrete short-time transform. IEEE Trans. Acoust. Speech Signal Process. 36(2): 168-181 (1988) - [j5]Amir Dembo, David Malah:
Statistical design of analysis/synthesis systems with quantization. IEEE Trans. Acoust. Speech Signal Process. 36(3): 328-341 (1988) - [j4]Amir Dembo, Ofer Zeitouni:
Maximum a posteriori estimation of time-varying ARMA processes from noisy observations. IEEE Trans. Acoust. Speech Signal Process. 36(4): 471-476 (1988) - 1987
- [j3]Amir Dembo, David Malah:
The design of optimal uniform filter banks with specified composite response. IEEE Trans. Acoust. Speech Signal Process. 35(6): 807-817 (1987) - [c4]Yariv Ephraim, Amir Dembo, Lawrence R. Rabiner:
A minimum discrimination information approach for hidden Markov modeling. ICASSP 1987: 25-28 - [c3]Amir Dembo, Ofer Zeitouni:
High Density Associative Memories. NIPS 1987: 211-218 - 1986
- [j2]Amir Dembo, David Malah:
WMMSE design of digital filter banks with specified composite response. IEEE Trans. Acoust. Speech Signal Process. 34(6): 1529-1541 (1986) - [j1]Amir Dembo:
The relation between maximum likelihood estimation of structured covariance matrices and periodograms. IEEE Trans. Acoust. Speech Signal Process. 34(6): 1661-1662 (1986) - 1985
- [c2]Amir Dembo, David Malah:
Statistical design of analysis/Synthesis systems with quantization. ICASSP 1985: 517-520 - [c1]Amir Dembo, David Malah:
A new approach to multipulse LPC coder design. ICASSP 1985: 949-952
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-10-07 21:19 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:
