Valentina Ciriani

Orcid: 0000-0002-0469-4201

Affiliations:
  • University of Milan, Italy


According to our database1, Valentina Ciriani authored at least 90 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Qutrit representation of quantum images: new quantum ternary circuit design.
Quantum Inf. Process., August, 2024

2023
XOR-AND-XOR Logic Forms for Autosymmetric Functions and Applications to Quantum Computing.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., June, 2023

Novel qutrit circuit design for multiplexer, De-multiplexer, and decoder.
Quantum Inf. Process., 2023

Quaternary Reversible Circuit Optimization for Scalable Multiplexer and Demultiplexer.
IEEE Access, 2023

Compact Quantum Circuits for Dimension Reducible Functions.
Proceedings of the 26th Euromicro Conference on Digital System Design, 2023

2022
Exploiting Symmetrization and D-Reducibility for Approximate Logic Synthesis.
IEEE Trans. Computers, 2022

Multiplicative Complexity of XOR Based Regular Functions.
IEEE Trans. Computers, 2022

ADD-based Spectral Analysis of Probing Security.
Proceedings of the 2022 Design, Automation & Test in Europe Conference & Exhibition, 2022

On the Optimal OBDD Representation of 2-XOR Boolean Affine Spaces.
Proceedings of the 2022 Design, Automation & Test in Europe Conference & Exhibition, 2022

2021
A Boolean Heuristic for Disjoint SOP Synthesis.
Proceedings of the 24th Euromicro Conference on Digital System Design, 2021

Autosymmetry of Incompletely Specified Functions.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2021

2020
Stuck-At Fault Mitigation of Emerging Technologies Based Switching Lattices.
J. Electron. Test., 2020

Computing the full quotient in bi-decomposition by approximation.
Proceedings of the 2020 Design, Automation & Test in Europe Conference & Exhibition, 2020

Multiplicative Complexity of Autosymmetric Functions: Theory and Applications to Security.
Proceedings of the 57th ACM/IEEE Design Automation Conference, 2020

2019
Boolean Minimization of Projected Sums of Products via Boolean Relations.
IEEE Trans. Computers, 2019

An OBDD-Based Technique for the Efficient Synthesis of Garbled Circuits.
Proceedings of the Security and Trust Management - 15th International Workshop, 2019

Fault Mitigation of Switching Lattices under the Stuck-At-Fault Model.
Proceedings of the IEEE Latin American Test Symposium, 2019

Testability of Switching Lattices in the Cellular Fault Model.
Proceedings of the 22nd Euromicro Conference on Digital System Design, 2019

Approximate Logic Synthesis by Symmetrization.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2019

2018
Composition of switching lattices for regular and for decomposed functions.
Microprocess. Microsystems, 2018

Enhancing logic synthesis of switching lattices by generalized Shannon decomposition methods.
Microprocess. Microsystems, 2018

Testability of Switching Lattices in the Stuck at Fault Model.
Proceedings of the IFIP/IEEE International Conference on Very Large Scale Integration, 2018

Integrated Synthesis Methodology for Crossbar Arrays.
Proceedings of the 14th IEEE/ACM International Symposium on Nanoscale Architectures, 2018

2017
Logic synthesis and testing techniques for switching nano-crossbar arrays.
Microprocess. Microsystems, 2017

A multiple valued logic approach for the synthesis of garbled circuits.
Proceedings of the 2017 IFIP/IEEE International Conference on Very Large Scale Integration, 2017

Exploiting Quantum Gates in Secure Computation.
Proceedings of the Euromicro Conference on Digital System Design, 2017

Composition of Switching Lattices and Autosymmetric Boolean Function Synthesis.
Proceedings of the Euromicro Conference on Digital System Design, 2017

Computing with nano-crossbar arrays: Logic synthesis and fault tolerance.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2017

2016
Index-Resilient Zero-Suppressed BDDs: Definition and Operations.
ACM Trans. Design Autom. Electr. Syst., 2016

Synthesis on switching lattices of Dimension-reducible Boolean functions.
Proceedings of the 2016 IFIP/IEEE International Conference on Very Large Scale Integration, 2016

Logic Synthesis for Switching Lattices by Decomposition with P-Circuits.
Proceedings of the 2016 Euromicro Conference on Digital System Design, 2016

Synthesis and Performance Optimization of a Switching Nano-Crossbar Computer.
Proceedings of the 2016 Euromicro Conference on Digital System Design, 2016

2015
On the error resilience of ordered binary decision diagrams.
Theor. Comput. Sci., 2015

Using Flexibility in P-Circuits by Boolean Relations.
IEEE Trans. Computers, 2015

Biconditional-BDD Ordering for Autosymmetric Functions.
Proceedings of the 2015 Euromicro Conference on Digital System Design, 2015

Bi-Decomposition Using Boolean Relations.
Proceedings of the 2015 Euromicro Conference on Digital System Design, 2015

2014
Autosymmetric and Dimension Reducible Multiple-Valued Functions.
J. Multiple Valued Log. Soft Comput., 2014

Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults.
Proceedings of the Theoretical Computer Science, 2014

Radiation-tolerant standard cell synthesis using double-rail redundant approach.
Proceedings of the 21st IEEE International Conference on Electronics, Circuits and Systems, 2014

2-SPP Approximate Synthesis for Error Tolerant Applications.
Proceedings of the 17th Euromicro Conference on Digital System Design, 2014

2013
Compact DSOP and Partial DSOP Forms.
Theory Comput. Syst., 2013

SOP restructuring by exploiting don't cares.
Microprocess. Microsystems, 2013

Minimization of EP-SOPs via Boolean relations.
Proceedings of the 21st IEEE/IFIP International Conference on VLSI and System-on-Chip, 2013

Error resilient OBDDs.
Proceedings of the 16th IEEE International Symposium on Design and Diagnostics of Electronic Circuits & Systems, 2013

Minimization of P-circuits using Boolean relations.
Proceedings of the Design, Automation and Test in Europe, 2013

2012
An OBDD approach to enforce confidentiality and visibility constraints in data publishing.
J. Comput. Secur., 2012

Synthesis of P-circuits for logic restructuring.
Integr., 2012

Projected Don't Cares.
Proceedings of the 15th Euromicro Conference on Digital System Design, 2012

2011
Dimension-reducible Boolean functions based on affine spaces.
ACM Trans. Design Autom. Electr. Syst., 2011

Selective data outsourcing for enforcing privacy.
J. Comput. Secur., 2011

Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization.
Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011

An approximation algorithm for cofactoring-based synthesis.
Proceedings of the 21st ACM Great Lakes Symposium on VLSI 2010, 2011

Enforcing Confidentiality and Data Visibility Constraints: An OBDD Approach.
Proceedings of the Data and Applications Security and Privacy XXV, 2011

Compact and Testable Circuits for Regular Functions.
Proceedings of the ARCS 2011, 2011

2010
Combining fragmentation and encryption to protect privacy in data storage.
ACM Trans. Inf. Syst. Secur., 2010

Logic synthesis and testability of D-reducible functions.
Proceedings of the 18th IEEE/IFIP VLSI-SoC 2010, 2010

Fun at a Department Store: Data Mining Meets Switching Theory.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases.
Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

Keep a Few: Outsourcing Data While Maintaining Confidentiality.
Proceedings of the Computer Security, 2009

Logic Minimization and Testability of 2SPP-P-Circuits.
Proceedings of the 12th Euromicro Conference on Digital System Design, 2009

Enforcing Confidentiality Constraints on Sensitive Databases with Lightweight Trusted Clients.
Proceedings of the Data and Applications Security XXIII, 2009

On decomposing Boolean functions via extended cofactoring.
Proceedings of the Design, Automation and Test in Europe, 2009

2008
<i>k</i> -Anonymous Data Mining: A Survey.
Proceedings of the Privacy-Preserving Data Mining - Models and Algorithms, 2008

The optimization of kEP-SOPs: Computational complexity, approximability and experiments.
ACM Trans. Design Autom. Electr. Syst., 2008

Logic Minimization and Testability of 2-SPP Networks.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008

Synthesis of Autosymmetric Functions in a New Three-Level Form.
Theory Comput. Syst., 2008

On the construction of small fully testable circuits with low depth.
Microprocess. Microsystems, 2008

A Comparison between Two Logic Synthesis Forms from Digital Switching Noise Viewpoint.
Proceedings of the Integrated Circuit and System Design. Power and Timing Modeling, 2008

On Projecting Sums of Products.
Proceedings of the 11th Euromicro Conference on Digital System Design: Architectures, 2008

2007
<i>k</i>-Anonymity.
Proceedings of the Secure Data Management in Decentralized Systems, 2007

Microdata Protection.
Proceedings of the Secure Data Management in Decentralized Systems, 2007

A data structure for a sequence of string accesses in external memory.
ACM Trans. Algorithms, 2007

An approximation algorithm for fully testable kEP-SOP networks.
Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007

Fragmentation and Encryption to Enforce Privacy in Data Storage.
Proceedings of the Computer Security, 2007

2006
Testability of SPP Three-Level Logic Networks in Static Fault Models.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006

Exploiting Regularities for Boolean Function Synthesis.
Theory Comput. Syst., 2006

Logic Synthesis of EXOR Projected Sum of Products.
Proceedings of the VLSI-SoC: Research Trends in VLSI and Systems on Chip, 2006

EXOR Projected Sum of Products.
Proceedings of the IFIP VLSI-SoC 2006, 2006

DRedSOP: Synthesis of a New Class of Regular Functions.
Proceedings of the Ninth Euromicro Conference on Digital System Design: Architectures, Methods and Tools (DSD 2006), 30 August, 2006

Efficient minimization of fully testable 2-SPP networks.
Proceedings of the Conference on Design, Automation and Test in Europe, 2006

2004
Room allocation: a polynomial subcase of the quadratic assignment problem.
Discret. Appl. Math., 2004

2003
Synthesis of SPP three-level logic networks using affine spaces.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

Three-level logic minimization based on function regularities.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

Synthesis of integer multipliers in sum of pseudoproducts form.
Integr., 2003

Stuck-At-Fault Testability of SPP Three-Level Logic Forms.
Proceedings of the VLSI-SOC: From Systems to Chips, 2003

Testability of SPP Three-Level Logic Networks.
Proceedings of the IFIP VLSI-SoC 2003, 2003

2002
Implicit Test of Regularity for Not Completely Specified Boolean Functions.
Proceedings of the 11th IEEE/ACM International Workshop on Logic & Synthesis, 2002

Static Optimality Theorem for External Memory String Access.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Fast three-level logic minimization based on autosymmetry.
Proceedings of the 39th Design Automation Conference, 2002

2001
Logic Minimization using Exclusive OR Gates.
Proceedings of the 38th Design Automation Conference, 2001


  Loading...