Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Kavalipati, Paparao

   Featured Reviewer
   Reader Recommended
   Reviewer Selected
Follow this Reviewer

Paparao Kavalipati is a software developer and consultant on electronics design automation (EDA) products with expertise in formal verification, logic synthesis, and related technologies. He is currently employed at Tabula Inc. Prior to that, he was a member of the R&D team at major EDA vendors like Mentor Graphics Corp. and Synopsys Inc.

With more than 18 years of experience in the industry, Paparao delivered new features and improvements for a range of products that include programmable logic devices, timing constraint verification, assertion synthesis, RTL compilation, model checking, equivalence checking, and simulation.

Paparao also offers development services and solutions to startup companies.  Working as an independent consultant, Paparao designed and developed a hybrid satisfiability engine for the verification of false paths and multi-cycle paths by formulating them as safety properties.

At Mentor Graphics, Paparao designed and implemented a high-level optimizer for assertion expressions, which benefited the 0in formal product in quickly verifying complex properties written in SVA and PSL. Paparao also contributed to the R&D efforts on low-power design verification, and synthesizing multi-clock SVA. At Synopsys, Paparao crafted various coding refinements to Magellan, Formality, and Scirocco products, covering a broad scope of projects on RTL synthesis, data path equivalence, and simulation speed-up.

His interests span a wide spectrum starting from fundamental algorithms, optimization methods, compilers, and automata theory as embedded in the art of electronics design and verification. Being an industrial researcher, he focuses on theoretical concepts that can relate well to pragmatic applications.

Attracted by the opportunities that Computing Reviews provides for continued learning, Paparao has been volunteering as a reviewer since 2008 and brings a practitioner’s point of view to the articles and books that he reads. He looks forward to keeping in touch with the technological and academic advances while rendering more reviews in the future.

Paparao received his master’s degree from the Indian Institute of Science, Bangalore, in 1996.

Date Reviewed  
- 10 of 41 reviews

  Randomness and elements of decision theory applied to signals
Borda M., Terebes R., Malutan R., Ilea I., Cislariu M., Miclea A., Barburiceanu S., Springer International Publishing, Cham, Switzerland, 2021. 259 pp.  Type: Book (978-3-030903-13-8)

Communication and image processing systems are commonly modeled using random processes and are of immense interest in electronics engineering. This short volume attempts to provide an introduction to various topics related to this subject....

Sep 21 2023  
   Data clustering: theory, algorithms, and applications
Gan G., Ma C., Wu J., SIAM, Philadelphia, PA, 2020. 406 pp.  Type: Book (978-1-611976-32-8)

Data clustering is an unsupervised method of grouping data such that objects in the same cluster are similar and objects in different clusters are distinct. Such techniques have a very diverse span of applicability in areas such as art...

Mar 31 2022  
   Reasoning with probabilistic and deterministic graphical models: exact algorithms (2nd ed.)
Dechter R., Morgan&Claypool Publishers, San Rafael, CA, 2019. 200 pp.  Type: Book (978-1-681734-90-3)

Many problems related to learning and reasoning can make use of graphical models where a knowledge structure is compactly encoded into a graph. When dependencies (or independencies) among the variables of concern are effectively captur...

May 4 2021  
   Applied machine learning
Forsyth D., Springer International Publishing, New York, NY, 2019. 494 pp.  Type: Book (978-3-030181-13-0)

Machine learning methods find application in almost any domain that makes use of some form of computation. These algorithms build appropriate models that help in making predictions; thus, they are of interest in industry as well as in ...

Jul 17 2020  
  Cryptographic and information security approaches for images and videos
Ramakrishnan S., CRC Press, Inc., Boca Raton, FL, 2019. 986 pp.  Type: Book (978-1-138563-84-1)

Cryptography is the art of securing communications transmitted through insecure channels. It consists of mechanisms to keep the data confidential by preventing access to unapproved individuals, maintaining the integrity of the data thr...

Nov 26 2019  
  PIMap: a flexible framework for improving LUT-based technology mapping via parallelized iterative optimization
Liu G., Zhang Z. ACM Transactions on Reconfigurable Technology and Systems 11(4): 1-23, 2019.  Type: Article

Transforming gate-level Boolean logic into functionally equivalent lookup tables (LUTs) is a key step in the compilation of a design into field-programmable gate arrays (FPGAs). Tools typically deploy a sequence of logic optimizations,...

Apr 3 2019  
  A moderately exponential time algorithm for k-IBDD satisfiability
Nagao A., Seto K., Teruyama J. Algorithmica 80(10): 2725-2741, 2018.  Type: Article

Branching programs can be modeled using binary decision diagrams (BDDs), which are rooted directed acyclic graphs with vertices labeled using variables of the program, and two sink nodes representing zero and one. In an ordered BDD (OB...

Aug 15 2018  
  Space-efficient parallel construction of succinct representations of suffix tree topologies
Baier U., Beller T., Ohlebusch E. Journal of Experimental Algorithmics 22(1): 1-26, 2017.  Type: Article

A suffix tree is a compressed tree that represents all the suffixes of a given string. Such a data structure has wide applications in string processing, bioinformatics, and information retrieval and can be constructed with space/time c...

Jan 24 2018  
  Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
González M., Palacios J., Vela C., Hernández-Arauzo A. Journal of Heuristics 23(2-3): 81-110, 2017.  Type: Article

Scatter search is a heuristic method of generating nonrandom solutions. It systematically explores the solution space by constructing new trial solutions from reference solutions using context knowledge. A standard template of the proc...

Nov 1 2017  
  A linear algorithm for a perfect matching in polyomino graphs
Lin Y., Zhang F. Theoretical Computer Science 67582-88, 2017.  Type: Article

Perfect matching in a graph is a set of edges where any pair does not share a common vertex and every vertex of the graph is the endpoint of an edge from that set. From the paper’s introduction: “A polyomino graph i...

Aug 10 2017  
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy