Skip to content

Ajay Kumar Verma

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

17

Venues

8

Active years

2004–2010

Best venue rank

A*

Where they publish

Papers

17 indexed papers, newest first.

YearVenueTitleAuthors
2010FPLSynthesis of Floating-Point Addition Clusters on FPGAs Using Carry-Save Arithmetic.Amit Verma, Ajay Kumar Verma, Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
2009ARITHChallenges in Automatic Optimization of Arithmetic Circuits.Ajay Kumar Verma, Philip Brisk, Paolo Ienne
2009ASPDACHybrid LZA: a near optimal implementation of the leading zero anticipator.Amit Verma, Ajay Kumar Verma, Philip Brisk, Paolo Ienne
2009ICCADIterative layering: Optimizing arithmetic circuits by structuring the information flow.Ajay Kumar Verma, Philip Brisk, Paolo Ienne
2008ASPDACFast, quasi-optimal, and pipelined instruction-set extensions.Ajay Kumar Verma, Philip Brisk, Paolo Ienne
2008DATEVariable Latency Speculative Addition: A New Paradigm for Arithmetic Circuit Design.Ajay Kumar Verma, Philip Brisk, Paolo Ienne
2008FPGAArchitectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs.Alessandro Cevrero, Panagiotis Athanasopoulos, Hadi Parandeh-Afshar, Ajay Kumar Verma, Philip Brisk, Frank K. Grkaynak, Yusuf Leblebici, Paolo Ienne
2007ASPDACImproving XOR-Dominated Circuits by Exploiting Dependencies between Operands.Ajay Kumar Verma, Paolo Ienne
2007CASESAn optimistic and conservative register assignment heuristic for chordal graphs.Philip Brisk, Ajay Kumar Verma, Paolo Ienne
2007CASESRethinking custom ISE identification: a new processor-agnostic method.Ajay Kumar Verma, Philip Brisk, Paolo Ienne
2007DACEnhancing FPGA Performance for Arithmetic Circuits.Philip Brisk, Ajay Kumar Verma, Paolo Ienne, Hadi Parandeh-Afshar
2007DACProgressive Decomposition: A Heuristic to Structure Arithmetic Circuits.Ajay Kumar Verma, Philip Brisk, Paolo Ienne
2007DATEAutomatic synthesis of compressor trees: reevaluating large counters.Ajay Kumar Verma, Paolo Ienne
2007ICCADOptimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design.Philip Brisk, Ajay Kumar Verma, Paolo Ienne
2006DACTowards the automatic exploration of arithmetic-circuit architectures.Ajay Kumar Verma, Paolo Ienne
2006DATECombining algorithm exploration with instruction set design: a case study in elliptic curve cryptography.Johann Groschdl, Paolo Ienne, Laura Pozzi, Stefan Tillich, Ajay Kumar Verma
2004ICCADImproved use of the carry-save representation for the synthesis of complex arithmetic circuits.Ajay Kumar Verma, Paolo Ienne