default search action
Anastasia Volkova
Person information
- affiliation: University of Nantes, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i6]Agathe Herrou, Florent de Dinechin, Stéphane Letz, Yann Orlarey, Anastasia Volkova:
Towards Fixed-Point Formats Determination for Faust Programs. CoRR abs/2403.06527 (2024) - 2023
- [j6]Martin Kumm, Anastasia Volkova, Silviu-Ioan Filip:
Design of Optimal Multiplierless FIR Filters With Minimal Number of Adders. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(2): 658-671 (2023) - [j5]Rémi Garcia, Anastasia Volkova:
Toward the Multiple Constant Multiplication at Minimal Hardware Cost. IEEE Trans. Circuits Syst. I Regul. Pap. 70(5): 1976-1988 (2023) - [j4]Debasmita Lohar, Clothilde Jeangoudoux, Anastasia Volkova, Eva Darulova:
Sound Mixed Fixed-Point Quantization of Neural Networks. ACM Trans. Embed. Comput. Syst. 22(5s): 136:1-136:26 (2023) - [c16]Anastasia Volkova, Rémi Garcia, Florent de Dinechin, Martin Kumm:
Hardware-Optimal Digital FIR Filters: One ILP to Rule Them all and in Faithfulness Bind Them. ACSSC 2023: 1574-1578 - [c15]Rémi Garcia, Anastasia Volkova:
Multiple Constant Multiplication: From Target Constants to Optimized Pipelined Adder Graphs. FPL 2023: 137-143 - 2022
- [j3]Rémi Garcia, Anastasia Volkova, Martin Kumm, Alexandre Goldsztejn, Jonas Kühle:
Hardware-Aware Design of Multiplierless Second-Order IIR Filters With Minimum Adders. IEEE Trans. Signal Process. 70: 1673-1686 (2022) - [c14]Tobias Habermann, Jonas Kühle, Martin Kumm, Anastasia Volkova:
Hardware-Aware Quantization for Multiplierless Neural Network Controllers. APCCAS 2022: 541-545 - [c13]Rémi Garcia, Anastasia Volkova, Martin Kumm:
Truncated Multiple Constant Multiplication with Minimal Number of Full Adders. ISCAS 2022: 263-267 - [c12]Heiko Becker, Mohit Tekriwal, Eva Darulova, Anastasia Volkova, Jean-Baptiste Jeannin:
Dandelion: Certified Approximations of Elementary Functions. ITP 2022: 6:1-6:19 - [i5]Heiko Becker, Mohit Tekriwal, Eva Darulova, Anastasia Volkova, Jean-Baptiste Jeannin:
Dandelion: Certified Approximations of Elementary Functions. CoRR abs/2202.05472 (2022) - [i4]Rémi Garcia, Anastasia Volkova:
Towards the Multiple Constant Multiplication at Minimal Hardware Cost. CoRR abs/2210.02742 (2022) - 2021
- [c11]Florent de Dinechin, Silviu-Ioan Filip, Martin Kumm, Anastasia Volkova:
Towards Arithmetic-Centered Filter Design. ARITH 2021: 115-118 - [i3]Rémi Garcia, Anastasia Volkova, Martin Kumm, Alexandre Goldsztejn, Jonas Kühle:
Hardware-aware Design of Multiplierless Second-Order IIR Filters with Minimum Adders. CoRR abs/2108.01565 (2021) - 2020
- [j2]Anastasia Volkova, Thibault Hilaire, Christoph Quirin Lauter:
Arithmetic Approaches for Rigorous Design of Reliable Fixed-Point LTI Filters. IEEE Trans. Computers 69(4): 489-504 (2020) - [c10]Christoph Quirin Lauter, Anastasia Volkova:
A Framework for Semi-Automatic Precision and Accuracy Analysis for Fast and Rigorous Deep Learning. ARITH 2020: 103-110 - [i2]Christoph Quirin Lauter, Anastasia Volkova:
A Framework for Semi-Automatic Precision and Accuracy Analysis for Fast and Rigorous Deep Learning. CoRR abs/2002.03869 (2020)
2010 – 2019
- 2019
- [j1]Anastasia Volkova, Matei Istoan, Florent de Dinechin, Thibault Hilaire:
Towards Hardware IIR Filters Computing Just Right: Direct Form I Case Study. IEEE Trans. Computers 68(4): 597-608 (2019) - [c9]Anastasia Volkova, Jean-Michel Muller:
Semi-Automatic Implementation of the Complementary Error Function. ARITH 2019: 167-174 - [c8]Eva Darulova, Anastasia Volkova:
Sound Approximation of Programs with Elementary Functions. CAV (2) 2019: 174-183 - 2018
- [i1]Eva Darulova, Anastasia Volkova:
Sound Approximation of Programs with Elementary Functions. CoRR abs/1811.10274 (2018) - 2017
- [b1]Anastasia Volkova:
Towards reliable implementation of digital filters. (Vers une implémentation fiable des filtres numériques). Pierre and Marie Curie University, Paris, France, 2017 - [c7]Anastasia Volkova, Christoph Quirin Lauter, Thibault Hilaire:
Reliable Verification of Digital Implemented Filters Against Frequency Specifications. ARITH 2017: 180-187 - [c6]Fahad Qureshi, Jarmo Takala, Anastasia Volkova, Thibault Hilaire:
Multiplierless unified architecture for mixed radix-2/3/4 FFTs. EUSIPCO 2017: 1334-1338 - [c5]Thibault Hilaire, Anastasia Volkova:
Error analysis methods for the fixed-point implementation of linear systems. SiPS 2017: 1-6 - 2016
- [c4]Thibault Hilaire, Anastasia Volkova, Maminionja Ravoson:
Reliable Fixed-Point Implementation of Linear Data-Flows. SiPS 2016: 92-97 - 2015
- [c3]Anastasia Volkova, Thibault Hilaire, Christoph Quirin Lauter:
Determining fixed-point formats for a digital filter implementation using the worst-case peak gain measure. ACSSC 2015: 737-741 - [c2]Anastasia Volkova, Thibault Hilaire, Christoph Quirin Lauter:
Reliable Evaluation of the Worst-Case Peak Gain Matrix in Multiple Precision. ARITH 2015: 96-103 - [c1]Anastasia Volkova, Thibault Hilaire:
Fixed-point implementation of Lattice Wave Digital Filter: Comparison and error analysis. EUSIPCO 2015: 1118-1122
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint