Suresh C. Kothari - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2022

Control flow equivalence method for establishing sanctity of compilingPayas Awadhutkar, Ahmed Tamrawi, Ryan Goluch, Suresh C. Kothari. compsec, 115:102608, 2022. [doi]

2016

Software engineering research lab to airplanes, orion and beyond: one professor's journey shaped by industry-university collaborationSuresh C. Kothari. ICSE 2016: 3-9 [doi]

2013

Computational modeling to detect software sabotage: A discussion of technical challenges and a demonstration of innovative technologySuresh C. Kothari. issre 2013: 81 [doi]

2003

Space and time efficient parallel algorithms and software for EST clusteringAnantharaman Kalyanaraman, Srinivas Aluru, Volker Brendel, Suresh C. Kothari. tpds, 14(12):1209-1221, 2003. [doi]

2002

Space and Time Efficient Parallel Algorithms and Software for EST ClusteringAnantharaman Kalyanaraman, Srinivas Aluru, Suresh C. Kothari. icpp 2002: 331 [doi]

Parallel EST ClusteringAnantharaman Kalyanaraman, Srinivas Aluru, Suresh C. Kothari. ipps 2002: [doi]

2000

ParAgent: A Domain-Specific Semi-automatic Parallelization ToolSimanta Mitra, Suresh C. Kothari, Jaekyu Cho, A. Krishnaswarmy. hipc 2000: 141-148 [doi]

1997

Parallel Implementation of Hydrostatic MM5Youngtae Kim, Zaitao Pan, Eugene S. Takle, Suresh C. Kothari. ppsc 1997:

1995

CMP: A Memory-Constrained Scalability MetricMark A. Fienup, Suresh C. Kothari. ppsc 1995: 848-849

1994

A Memory Constrained Scalability MetricMark A. Fienup, Suresh C. Kothari. icpp 1994: 1-7

Adaptation of the relaxation method for learning in bidirectional associative memoryHeekuck Oh, Suresh C. Kothari. tnn, 5(4):576-583, 1994. [doi]

1993

Neural Networks for Pattern RecognitionSuresh C. Kothari, Heekuck Oh. ac, 37:119-166, 1993.

1992

Probabilistic Information Capacity of Hopfield Associative MemoryKesig Lee, Suresh C. Kothari, Dongwan Shin. compsys, 6(1), 1992. [doi]

1990

On Optimal Parallelization of Sorting NetworksEthan Gannett, Suresh C. Kothari, Hsu-Chun Yen. TCS, 76(2-3):331-341, 1990.

Testing arbitrary subhypergraphs for the lossless join propertyLes Miller, John H. Leuchner, Suresh C. Kothari, K. C. Liu. isci, 51(1):95-110, 1990. [doi]

1989

Optimal Designs of Linear Flow Systolic ArchitecturesSuresh C. Kothari, Heekuck Oh, Ethan Gannet. icpp 1989: 247-256

On Computing the Combinatorial Power of SW-Banyan NetworksRobert S. Roberts, Suresh C. Kothari. TC, 38(5):761-765, 1989.

1988

1987

On Optimal Parallelization of Sorting NetworksEthan Gannett, Suresh C. Kothari, Hsu-Chun Yen. fsttcs 1987: 195-206

Multistage Interconnection Networks for Multiprocessor SystemsSuresh C. Kothari. ac, 26:155-199, 1987.

1985

General Algorithms for the Address Calculation of Lexicographically Ordered TuplesSuresh C. Kothari, K. V. S. Ramarao. ipl, 21(3):113-116, 1985.

1984

Generalized Linear Threshold SchemeSuresh C. Kothari. crypto 1985: 231-241 [doi]

1983

A Condition Known to be Sufficient for Rearrangeability of the Benes Class of Interconnection Networks with 2x2 Switches Is Also NecessarySuresh C. Kothari, S. Lakshmivarahan. icpp 1983: 76-78

Sign in or sign up to see more results.

runs on WebDSL