Eric Lehman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2022

Towards Generalizable Methods for Automating Risk Score CalculationJennifer J. Liang, Eric Lehman, Ananya Iyengar, Diwakar Mahajan, Preethi Raghavan, Cindy Y. Chang, Peter Szolovits. bionlp 2022: 426-431 [doi]

2021

Does BERT Pretrained on Clinical Notes Reveal Sensitive Data?Eric Lehman, Sarthak Jain, Karl Pichotta, Yoav Goldberg, Byron C. Wallace. naacl 2021: 946-959 [doi]

2020

Evidence Inference 2.0: More Data, Better ModelsJay DeYoung, Eric Lehman, Benjamin E. Nye, Iain James Marshall, Byron C. Wallace. bionlp 2020: 123-132 [doi]

ERASER: A Benchmark to Evaluate Rationalized NLP ModelsJay DeYoung, Sarthak Jain, Nazneen Fatema Rajani, Eric Lehman, Caiming Xiong, Richard Socher, Byron C. Wallace. acl 2020: 4443-4458 [doi]

2019

Inferring Which Medical Treatments Work from Reports of Clinical TrialsEric Lehman, Jay DeYoung, Regina Barzilay, Byron C. Wallace. naacl 2019: 3705-3717 [doi]

2009

3.5-Way Cuckoo Hashing for the Price of 2-and-a-BitEric Lehman, Rina Panigrahy. esa 2009: 671-681 [doi]

2005

The smallest grammar problemMoses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat. TIT, 51(7):2554-2576, 2005. [doi]

Network coding: does the model need tuning?April Rasala Lehman, Eric Lehman. soda 2005: 499-504 [doi]

2004

Complexity classification of network information flow problemsApril Rasala Lehman, Eric Lehman. soda 2004: 142-150 [doi]

Network Coding: Does the Model Need Tuning?April Rasala Lehman, Eric Lehman. eccc, (034), 2004. [doi]

2002

Approximating the smallest grammar: Kolmogorov complexity in natural modelsMoses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat. stoc 2002: 792-801 [doi]

Monotonicity testing over general poset domainsEldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky. stoc 2002: 474-483 [doi]

Approximation algorithms for grammar-based data compressionEric Lehman. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 2002. [doi]

Approximation algorithms for grammar-based compressionEric Lehman, Abhi Shelat. soda 2002: 205-212 [doi]

2001

On Disjoint Chains of SubsetsEric Lehman, Dana Ron. JCT, 94(2):399-404, 2001. [doi]

2000

Testing MonotonicityOded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky. combinatorica, 20(3):301-337, 2000. [doi]

1999

1998

Testing MonotonicityOded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron. focs 1998: 426-435 [doi]

1997

Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide WebDavid R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin. stoc 1997: 654-663 [doi]

Logic decomposition during technology mappingEric Lehman, Yosinatori Watanabe, Joel Grodstein, Heather Harkness. tcad, 16(8):813-834, 1997. [doi]

1995

A delay model for logic synthesis of continuously-sized networksJoel Grodstein, Eric Lehman, Heather Harkness, Bill Grundmann, Yosinatori Watanabe. iccad 1995: 458-462 [doi]

Logic decomposition during technology mappingEric Lehman, Yosinori Watanabe, Joel Grodstein, Heather Harkness. iccad 1995: 264-271 [doi]

1994

Optimal latch mapping and retiming within a treeJoel Grodstein, Eric Lehman, Heather Harkness, Hervé J. Touati, Bill Grundmann. iccad 1994: 242-245 [doi]

Sign in or sign up to see more results.

runs on WebDSL