![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Arvind M. Patel
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1986
- [j8]Arvind M. Patel:
On-the-Fly Decoder for Multiple Byte Errors. IBM J. Res. Dev. 30(3): 259-269 (1986) - 1985
- [j7]Arvind M. Patel, Norman L. Soong, Robert K. Korn:
Hierarchical VLSI Routing - An Approximate Routing Procedure. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 4(2): 121-126 (1985) - 1981
- [c9]Arvind M. Patel, L. C. Cote:
Partitioning for VLSI placement problems. DAC 1981: 411-418 - [c8]K. H. Khokhani, Arvind M. Patel, W. Ferguson, J. Sessa, D. Hatton:
Placement of variable size circuits on LSI masterslices. DAC 1981: 426-434 - 1980
- [j6]Arvind M. Patel:
Error Recovery Scheme for the IBM 3850 Mass Storage System. IBM J. Res. Dev. 24(1): 32-42 (1980) - [c7]Arvind M. Patel:
Computer-aided assignment of manufacturing tolerances. DAC 1980: 129-133 - [c6]L. C. Cote, Arvind M. Patel:
The interchange algorithms for circuit placement problems. DAC 1980: 528-534
1970 – 1979
- 1977
- [j5]M. Y. Hsiao, Arvind M. Patel, Dhiraj K. Pradhan:
Store Address Generator with On-Line Fault-Detection Capability. IEEE Trans. Computers 26(11): 1144-1151 (1977) - [c5]K. H. Khokhani, Arvind M. Patel:
The chip layout problem: A placement procedure for lsi. DAC 1977: 291-297 - 1976
- [j4]Arvind M. Patel, C. G. Dewald, L. C. Cote:
Pre-partitioning as a means of enhancing pairwise interchange solutions to quadratic assignment problems. Comput. Oper. Res. 3(1): 49-56 (1976) - 1975
- [j3]Dhiraj K. Pradhan, Arvind M. Patel:
Reed-Muller Like Canonic Forms for Multivalued Functions. IEEE Trans. Computers 24(2): 206-210 (1975) - [j2]Arvind M. Patel:
Maximal q -nary linear codes with large minimum distance (Corresp.). IEEE Trans. Inf. Theory 21(1): 106-110 (1975) - 1974
- [j1]Arvind M. Patel, Se June Hong:
Optimal Rectangular Code for High Density Magnetic Tapes. IBM J. Res. Dev. 18(6): 579-588 (1974) - 1972
- [c4]Arvind M. Patel, M. Y. Hsiao:
An adaptive error correction scheme for computer memory system. AFIPS Fall Joint Computing Conference (1) 1972: 83-87 - 1971
- [c3]Arvind M. Patel:
A multi-channel CRC register. AFIPS Spring Joint Computing Conference 1971: 11-14 - [c2]Douglas C. Bossen, Daniel L. Ostapko, Arvind M. Patel, Martin S. Schmookler:
Minimum test patterns for residue networks. DAC 1971: 278-284 - 1970
- [c1]Douglas C. Bossen, Daniel L. Ostapko, Arvind M. Patel:
Optimum test patterns for parity networks. AFIPS Fall Joint Computing Conference 1970: 63-68
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint