default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas S. Anantharaman
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[c10]Thomas S. Anantharaman, Venkatesh Mysore, Bud Mishra:
Fast and Cheap Genome Wide Haplotype Construction via Optical Mapping. Pacific Symposium on Biocomputing 2005- 2001
- [c9]Thomas S. Anantharaman, Bud Mishra:
False Positives in Genomic Map Assembly and Sequence Validation. WABI 2001: 27-40
1990 – 1999
- 1999
- [c8]Thomas S. Anantharaman, Bud Mishra, David C. Schwartz:
Genomics via Optical Mapping III: Contiging Genomic DNA. ISMB 1999: 18-27 - 1998
- [c7]David C. Schwartz, Thomas S. Anantharaman, C. Aston, Bud Mishra, V. Clarke, D. Gebauer, S. Delobette, E. Dimalanta, J. Edington, J. Evenzehav, J. Giacalone, C. Hiort, E. Huff, J. Jing, Z. Lai, E. Lee, J. Lin, B. Porter, R. Qi, Y. Skiadis:
New approaches to genomic analysis using single molecules. RECOMB 1998: 248-250 - 1997
- [j9]Thomas S. Anantharaman:
Evaluation Tuning for Computer Chess: Linear Discriminant Methods. J. Int. Comput. Games Assoc. 20(4): 224-242 (1997) - [j8]Thomas S. Anantharaman, Bud Mishra, David C. Schwartz:
Genomics via Optical Mapping II: Ordered Restriction Maps. J. Comput. Biol. 4(2): 91-118 (1997) - [c6]Thomas S. Anantharaman, Bud Mishra:
Statistical Algorithms and Software for Genomics. COMPSAC 1997: 434-437 - 1991
- [j7]Thomas S. Anantharaman:
Confidently Selecting a Search Heuristic. J. Int. Comput. Games Assoc. 14(1): 3-16 (1991) - [j6]Thomas S. Anantharaman:
A Statistical Study of Selective Min-Max Search in Computer Chess. J. Int. Comput. Games Assoc. 14(1): 21 (1991) - [j5]Thomas S. Anantharaman:
Extension Heuristics. J. Int. Comput. Games Assoc. 14(2): 47-65 (1991) - [j4]Thomas S. Anantharaman:
Human Arbiters of Chess Tactics? J. Int. Comput. Games Assoc. 14(2): 111 (1991) - 1990
- [j3]Thomas S. Anantharaman, Murray Campbell, Feng-Hsiung Hsu:
Singular Extensions: Adding Selectivity to Brute-Force Searching. Artif. Intell. 43(1): 99-109 (1990)
1980 – 1989
- 1989
- [c5]Roberto Bisiani, Thomas S. Anantharaman, L. Butcher:
BEAM. An accelerator for speech recognition. ICASSP 1989: 782-784 - 1988
- [j2]Thomas S. Anantharaman, Murray Campbell, Feng-Hsiung Hsu:
Singular Extensions: Adding Selectivity to Brute-Force Searching. J. Int. Comput. Games Assoc. 11(4): 135-143 (1988) - 1986
- [j1]Thomas S. Anantharaman, Edmund M. Clarke, Michael J. Foster, Bud Mishra:
Compiling Path Expressions Into VLSI Circuits. Distributed Comput. 1(3): 150-166 (1986) - [c4]Thomas S. Anantharaman, Roberto Bisiani:
A Hardware Accelerator for Speech Recognition Algorithms. ISCA 1986: 216-223 - 1985
- [c3]Thomas S. Anantharaman, Roberto Bisiani:
Custom data-flow machines for speech recognition. ICASSP 1985: 1847-1850 - [c2]Thomas S. Anantharaman, Edmund M. Clarke, Michael J. Foster, Bud Mishra:
Compiling Path Expressions into VLSI Circuits. POPL 1985: 191-204 - 1984
- [c1]Thomas S. Anantharaman, M. Annaratone, Roberto Bisiani:
A family of custom VLSI circuits for speech recognition. ICASSP 1984: 355-358
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-04-25 05:42 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:
