• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 33 matches

• 2021
• 
  Omid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody:
  Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of Corruptions. TCC (2) 2021: 718-750
• 
  Omid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody:
  Polynomial-time targeted attacks on coin tossing for any number of corruptions. IACR Cryptol. ePrint Arch. 2021: 1464 (2021)
• 2020
• 
  Omid Etesami, Willem H. Haemers:
  On NP-hard graph properties characterized by the spectrum. Discret. Appl. Math. 285: 526-529 (2020)
• 
  Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody:
  Computational Concentration of Measure: Optimal Bounds, Reductions, and More. SODA 2020: 345-363
• 2019
• 
  Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani:
  When an optimal dominating set with given constraints exists. Theor. Comput. Sci. 780: 54-65 (2019)
• 
  Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody:
  Computational Concentration of Measure: Optimal Bounds, Reductions, and More. CoRR abs/1907.05401 (2019)
• 2018
• 
  Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
  Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. APPROX-RANDOM 2018: 30:1-30:15
• 2017
• 
  Salman Beigi, Omid Etesami, Amin Gohari:
  The Value of Help Bits in Randomized and Average-Case Complexity. Comput. Complex. 26(1): 119-145 (2017)
• 
  Salman Beigi, Omid Etesami, Amin Gohari:
  Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. SIAM J. Comput. 46(1): 1-36 (2017)
• 
  Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
  Complete Classification of Generalized Santha-Vazirani Sources. CoRR abs/1709.03053 (2017)
• 
  Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
  Complete Classi fication of Generalized Santha-Vazirani Sources. Electron. Colloquium Comput. Complex. TR17 (2017)
• 2016
• 
  Omid Etesami, Amin Gohari:
  Maximal Rank Correlation. IEEE Commun. Lett. 20(1): 117-120 (2016)
• 2015
• 
  Salman Beigi, Omid Etesami, Amin Gohari:
  Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. ICALP (1) 2015: 143-154
• 
  Salman Beigi, Omid Etesami, Amin Gohari:
  The value of information-theoretic content of help bits for computation. IWCIT 2015: 1-3
• 
  Omid Etesami, Amin Gohari:
  Maximal Rank Correlation. CoRR abs/1511.04191 (2015)
• 2014
• 
  James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
  On the One-Way Function Candidate Proposed by Goldreich. ACM Trans. Comput. Theory 6(3): 14:1-14:35 (2014)
• 
  Salman Beigi, Omid Etesami, Amin Gohari:
  The Value of Help Bits in Randomized and Average-Case Complexity. CoRR abs/1408.0499 (2014)
• 
  Salman Beigi, Omid Etesami, Amin Gohari:
  Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. CoRR abs/1412.6641 (2014)
• 
  Salman Beigi, Omid Etesami, Amin Gohari:
  The Value of Help Bits in Randomized and Average-Case Complexity. Electron. Colloquium Comput. Complex. TR14 (2014)
• 
  Salman Beigi, Omid Etesami, Amin Gohari:
  Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. Electron. Colloquium Comput. Complex. TR14 (2014)
• 2012
• 
  Masoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi:
  Irregular product codes. ITW 2012: 197-201
• 
  Masoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi:
  Irregular Product Codes. CoRR abs/1206.2276 (2012)
• 
  James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
  On the One-Way Function Candidate Proposed by Goldreich. Electron. Colloquium Comput. Complex. TR12 (2012)
• 2010
• 
  Seyed Omid Etesami:
  Pseudorandomness against Depth-2 Circuits and Analysis of Goldreich's Candidate One-Way Function. University of California, Berkeley, USA, 2010
• 
  Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani:
  Improved Pseudorandom Generators for Depth 2 Circuits. APPROX-RANDOM 2010: 504-517
• 2009
• 
  James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
  Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. TCC 2009: 521-538
• 
  Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani:
  Improved Pseudorandom Generators for Depth 2 Circuits. Electron. Colloquium Comput. Complex. TR09 (2009)
• 2007
• 
  Saieed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody:
  On rainbow cycles in edge colored complete graphs. Australas. J Comb. 37: 33-42 (2007)
• 
  Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, Mohammad Mahdian:
  Dynamics of bid optimization in online advertisement auctions. WWW 2007: 531-540
• 2006
• 
  Saeed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody, Arash Sharifi:
  Transversals in long rectangular arrays. Discret. Math. 306(23): 3011-3013 (2006)

skipping 3 more matches