default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCicilia C. Lozano
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j8]Cicilia C. Lozano, Bogdan J. Falkowski, Tadeusz Luba:
Fixed Polarity Linearly Independent Expansions for the Representation of Quaternary Functions. J. Multiple Valued Log. Soft Comput. 19(4): 307-324 (2012)
2000 – 2009
- 2009
- [c20]Cicilia C. Lozano, Bogdan J. Falkowski, Tadeusz Luba:
Two classes of fixed polarity linearly independent arithmetic transforms for quaternary functions. EUSIPCO 2009: 421-425 - [c19]Cicilia C. Lozano, Bogdan J. Falkowski, Tadeusz Luba:
Decision diagram based computation of linearly independent ternary arithmetic transform spectra. EUSIPCO 2009: 973-977 - [c18]Cicilia C. Lozano, Bogdan J. Falkowski, Tadeusz Luba:
Fixed Polarity Quaternary Transforms Derived from Linearly Independent Transform over GF(2) Structure. ISMVL 2009: 318-323 - 2008
- [c17]Cicilia C. Lozano, Bogdan J. Falkowski, Tadeusz Luba:
Properties and Computational Algorithm for Fastest Quaternary Linearly Independent Transforms. ISMVL 2008: 226-231 - 2007
- [j7]Cicilia C. Lozano, Bogdan J. Falkowski:
Fastest linearly independent arithmetic transforms and their calculation on systolic array processors. IET Circuits Devices Syst. 1(2): 181-192 (2007) - [j6]Bogdan J. Falkowski, Cicilia C. Lozano, Tadeusz Luba:
Family of Fastest Linearly Independent Transforms over GF(3): Generation, Relations, and Hardware Implementation. J. Multiple Valued Log. Soft Comput. 13(4-6): 379-396 (2007) - [c16]Bogdan J. Falkowski, Cicilia C. Lozano, Tadeusz Luba:
Properties and relations of new fastest linearly independent arithmetic transforms for ternary functions. EUSIPCO 2007: 2129-2133 - [c15]Bogdan J. Falkowski, Cicilia C. Lozano, Tadeusz Luba:
New Fastest Linearly Independent Transforms over GF(3). ISMVL 2007: 15 - [c14]Bogdan J. Falkowski, Cicilia C. Lozano, Tadeusz Luba:
Efficient Algorithm for Calculation of Quaternardy Fixed Polarity Arithmetic Expansions. ISMVL 2007: 23 - 2006
- [j5]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Column Polarity Matrix Algorithm for Ternary Fixed Polarity Reed-muller Expansions. J. Circuits Syst. Comput. 15(2): 243-262 (2006) - [c13]Cicilia C. Lozano, Bogdan J. Falkowski:
Generation of Fixed Polarity Arithmetic Spectra for Ternary Functions. APCCAS 2006: 1414-1417 - [c12]Cicilia C. Lozano, Bogdan J. Falkowski:
Fixed Polarity Arithmetic Expansions Calculation from Disjoint Cubes Representation of Ternary Functions. APCCAS 2006: 1623-1626 - [c11]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Disjoint Cubes Generation Algorithm for Multiple-Valued Functions. APCCAS 2006: 1627-1630 - [c10]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Efficient computation of fixed polarity arithmetic expansions for ternary functions. ISCAS 2006 - [c9]Cicilia C. Lozano, Bogdan J. Falkowski, Susanto Rahardja:
Algorithms for generation of quaternary fixed polarity arithmetic spectra. ISCAS 2006 - [c8]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Generalized Fastest LIA Transform Spectra Calculation by Systolic Processor. ISIT 2006: 2017-2021 - 2005
- [j4]Bogdan J. Falkowski, Cicilia C. Lozano:
Quaternary Fixed-Polarity Reed-Muller expansion computation through operations on disjoint cubes and its comparison with other methods. Comput. Electr. Eng. 31(2): 112-131 (2005) - [j3]Susanto Rahardja, Bogdan J. Falkowski, Cicilia C. Lozano:
Fastest linearly independent transforms over GF(2) and their properties. IEEE Trans. Circuits Syst. I Regul. Pap. 52-I(9): 1832-1844 (2005) - [c7]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Generalized fastest linearly independent arithmetic transforms. ISCAS (1) 2005: 480-483 - [c6]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Generation and properties of new fastest linearly independent transforms over GF(2) with reordering. ISCAS (5) 2005: 4705-4708 - 2004
- [j2]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Calculation of best fixed polarity Reed-Muller transform over GF(5). IEICE Electron. Express 1(5): 92-97 (2004) - [j1]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Algorithm to generate fixed polarity Reed-Muller GF(5) spectra from disjoint cubes. IEICE Electron. Express 1(6): 131-136 (2004) - [c5]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Generation of disjoint cubes for multiple-valued functions. ISCAS (5) 2004: 133-136 - [c4]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Fast Optimization of Fixed-Polarity Reed-Muller Expansions over GF(5). ISMVL 2004: 162-167 - [c3]Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja:
Spectra Generation for Fixed-Polarity Reed-Muller Transform over GF(5). ISMVL 2004: 177-183 - 2003
- [c2]Bogdan J. Falkowski, Cicilia C. Lozano:
Properties of fastest LIA transform matrices and their spectra. ISCAS (4) 2003: 556-559 - [c1]Bogdan J. Falkowski, Cicilia C. Lozano:
Generation and properties of fastest transform matrices over GF(2). ISCAS (4) 2003: 740-743
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-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
