Name
Affiliation
Papers
MACIEJ J. CIESIELSKI
University of Massachusetts
93
Collaborators
Citations 
PageRank 
123
629
74.80
Referers 
Referees 
References 
954
1030
861
Search Limit
1001000
Title
Citations
PageRank
Year
Functional Verification of Arithmetic Circuits: Survey of Formal Methods00.342022
SPEAR: Hardware-based Implicit Rewriting for Square-root Circuit Verification00.342020
Formal Verification of Constrained Arithmetic Circuits using Computer Algebraic Approach00.342020
Dual Approach to Solving SAT in Hardware00.342020
Understanding Algebraic Rewriting for Arithmetic Circuit Verification: a Bit-Flow Model50.472020
Formal Analysis of Galois Field Arithmetic Circuits-Parallel Verification and Reverse Engineering.10.372019
Formal Verification of Integer Dividers:Division by a Constant10.372019
Spectral approach to verifying non-linear arithmetic circuits.00.342019
Functional Verification of Hardware Dividers using Algebraic Model00.342019
Formal Analysis of Galois Field Arithmetics - Parallel Verification and Reverse Engineering.00.342018
End-to-End Industrial Study of Retiming10.402018
Fast Algebraic Rewriting Based on And-Inverter Graphs.100.602018
Rewriting Environment for Arithmetic Circuit Verification.00.342018
Advanced Datapath Synthesis using Graph Isomorphism.00.342017
Reverse engineering of irreducible polynomials in GF(2m) arithmetic.00.342017
Efficient parallel verification of Galois field multipliers10.362017
Incremental SAT-Based Reverse Engineering of Camouflaged Logic Circuits.120.582017
Formal Verification of Truncated Multipliers Using Algebraic Approach and Re-Synthesis10.372017
Analyzing Imprecise Adders Using BDDs -- A Case Study40.402016
Formal Verification of Arithmetic Circuits by Function Extraction.130.722016
DAG-aware logic synthesis of datapaths.10.362016
Formal Verification Using Don't-Care and Vanishing Polynomials00.342016
Logic Debugging of Arithmetic Circuits60.502015
Verification of gate-level arithmetic circuits by function extraction241.032015
Exploiting Circuit Duality to Speed up SAT00.342015
Verification of arithmetic datapath designs using word-level approach — A case study10.382015
Fast STA prediction-based gate-level timing simulation20.492014
Fast time-parallel C-based event-driven RTL simulation00.342014
Function Extraction from Arithmetic Bit-Level Circuits50.512014
An Approach to Multi-core Functional Gate-Level Simulation Minimizing Synchronization and Communication Overheads10.482013
MULTES: Multilevel Temporal-Parallel Event-Driven Simulation30.502013
FPGA latency optimization using system-level transformations and DFG restructuring10.362013
Arithmetic Bit-Level Verification Using Network Flow Model.30.472013
Algebraic approach to arithmetic design verification40.482011
A Variation-Aware Taylor Expansion Diagram-Based Approach For Nano-Cmos Register-Transfer Level Leakage Optimization10.342011
Variation-Aware TED-Based Approach for Nano-CMOS RTL Leakage Optimization10.342011
Retiming Arithmetic Datapaths Using Timed Taylor Expansion Diagrams10.362010
The best constant approximant operators in Lorentz spaces Gammap, w and their applications00.342010
High-Level Dataflow Transformations Using Taylor Expansion Diagrams20.442009
Optimizing data flow graphs to minimize hardware implementation80.602009
Optimization of data-flow computations using canonical TED representation10.382009
Simulation Acceleration with HW Re-Compilation Avoidance00.342008
A fast two-pass HDL simulation with on-demand dump00.342008
Data-flow transformations using Taylor expansion diagrams70.612007
Efficient factorization of DSP transforms using taylor expansion diagrams40.512006
Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs311.362006
Design Validation of Behavioral VHDL Descriptions for Arbitrary Fault Models60.522005
Yield-aware Floorplanning00.342005
An ILP formulation for yield-driven architectural synthesis20.382005
Algorithms for Taylor Expansion Diagrams40.492004
  • 1
  • 2