Pushkin R. Pari

According to our database, Pushkin R. Pari authored at least 6 papers between 2003 and 2006.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2006

Dual-Processor Design of Energy Efficient Fault-Tolerant System.

Shaoxiong Hua, Pushkin R. Pari, Gang Qu

Proceedings of the 2006 IEEE International Conference on Application-Specific Systems, 2006

2004

How many solutions does a SAT instance have?

Pushkin R. Pari, Lin Yuan, Gang Qu

Proceedings of the 2004 International Symposium on Circuits and Systems, 2004

Soft IP Protection: Watermarking HDL Codes.

Lin Yuan, Pushkin R. Pari, Gang Qu

Proceedings of the Information Hiding, 6th International Workshop, 2004

Finding Redundant Constraints for FSM Minimization.

Lin Yuan, Pushkin R. Pari, Gang Qu

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

Generating 'Random' 3-SAT Instances with Specific Solution Space Structure.

Pushkin R. Pari, Jane Lin, Lin Yuan, Gang Qu

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

Zero overhead watermarking technique for FPGA designs.

Adarsh K. Jain, Lin Yuan, Pushkin R. Pari, Gang Qu

Proceedings of the 13th ACM Great Lakes Symposium on VLSI 2003, 2003