Eric Lehman

Affiliations:
  • Google
  • MIT


According to our database1, Eric Lehman authored at least 27 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Practical Considerations For the Deployment of Clinical NLP Systems
PhD thesis, 2024

2023
From Sparse to Dense: GPT-4 Summarization with Chain of Density Prompting.
CoRR, 2023

Do We Still Need Clinical Language Models?
Proceedings of the Conference on Health, Inference, and Learning, 2023

2022
Learning to Ask Like a Physician.
CoRR, 2022

Towards Generalizable Methods for Automating Risk Score Calculation.
Proceedings of the 21st Workshop on Biomedical Language Processing, 2022

2021
Does BERT Pretrained on Clinical Notes Reveal Sensitive Data?
Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021

2020
Understanding Clinical Trial Reports: Extracting Medical Entities and Their Relations.
CoRR, 2020

Evidence Inference 2.0: More Data, Better Models.
Proceedings of the 19th SIGBioMed Workshop on Biomedical Language Processing, 2020

ERASER: A Benchmark to Evaluate Rationalized NLP Models.
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020

2019
Inferring Which Medical Treatments Work from Reports of Clinical Trials.
Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019

2009
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit.
Proceedings of the Algorithms, 2009

2005
The smallest grammar problem.
IEEE Trans. Inf. Theory, 2005

2004
Network Coding: Does the Model Need Tuning?
Electron. Colloquium Comput. Complex., 2004

Complexity classification of network information flow problems.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002
Approximation algorithms for grammar-based data compression.
PhD thesis, 2002

Monotonicity testing over general poset domains.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Approximating the smallest grammar: Kolmogorov complexity in natural models.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Approximation algorithms for grammar-based compression.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
On Disjoint Chains of Subsets.
J. Comb. Theory A, 2001

2000
Testing Monotonicity.
Comb., 2000

1999
Improved Testing Algorithms for Monotonicity.
Electron. Colloquium Comput. Complex., 1999

Oblivious Deadlock-Free Routing in a Faulty Hypercube.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

1998
Testing Monotonicity.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Logic decomposition during technology mapping.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1997

Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1995
A delay model for logic synthesis of continuously-sized networks.
Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, 1995

1994
Optimal latch mapping and retiming within a tree.
Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, 1994


  Loading...