default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValeriu Beiu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Vlad-Florin Dragoi
, Valeriu Beiu:
Which Coefficients Matter Most - Consecutive $k$-Out-of-$n$:$F$ Systems Revisited. IEEE Trans. Reliab. 73(3): 1633-1646 (2024)- 2023
- [j21]Marilena Jianu, Leonard Daus, Vlad-Florin Dragoi, Valeriu Beiu:
Reliability polynomials of consecutive-k-out-of-n:Fsystems have unbounded roots. Networks 82(3): 222-228 (2023) - 2022
- [j20]Mariana Nagy, Simon Robin Cowell, Valeriu Beiu:
Survey of Cubic Fibonacci Identities When Cuboids Carry Weight. Int. J. Comput. Commun. Control 17(2) (2022) - [j19]Vlad-Florin Dragoi, Valeriu Beiu:
Fast reliability ranking of matchstick minimal networks. Networks 79(4): 479-500 (2022) - [j18]Valeriu Beiu, Leonard Daus, Marilena Jianu, Adela Mihai, Ion Mihai:
On a Surface Associated with Pascal's Triangle. Symmetry 14(2): 411 (2022) - [c59]Andrea-Claudia Beiu, Roxana-Mariana Beiu, Valeriu Beiu:
Optimal design of linear consecutive systems. NANOCOM 2022: 24:1-24:2 - [i3]Marilena Jianu, Leonard Daus, Vlad-Florin Dragoi, Valeriu Beiu:
Consecutive k-out-of-n: F Systems Have Unbounded Roots. CoRR abs/2208.14173 (2022) - 2020
- [j17]Vlad Dragoi, Valeriu Beiu:
Studying the Binary Erasure Polarization Subchannels Using Network Reliability. IEEE Commun. Lett. 24(1): 62-66 (2020) - [c58]Valeriu Beiu, Vlad-Florin Dragoi, Roxana-Mariana Beiu:
Why Reliability for Computing Needs Rethinking. ICRC 2020: 16-25 - [c57]Leonard Daus, Marilena Jianu, Roxana-Mariana Beiu, Valeriu Beiu:
A Tale of Catalan Triangles: Counting Lattice Paths. SOFA 2020: 677-690 - [c56]Vlad-Florin Dragoi, Valeriu Beiu:
Consecutive Systems Asymptotic Threshold Behaviors. SOFA 2020: 691-701 - [i2]Vlad-Florin Dragoi, Simon Robin Cowell, Valeriu Beiu:
Tight Bounds on the Coeffcients of Consecutive k-out-of-n: F Systems. CoRR abs/2003.12419 (2020)
2010 – 2019
- 2019
- [i1]Vlad-Florin Dragoi, Valeriu Beiu:
Fast Reliability Ranking of Matchstick Minimal Networks. CoRR abs/1911.01153 (2019) - 2018
- [j16]Simon Robin Cowell, Valeriu Beiu, Leonard Daus, Philippe Poulin:
On the Exact Reliability Enhancements of Small Hammock Networks. IEEE Access 6: 25411-25426 (2018) - [j15]Vlad Dragoi, Simon Robin Cowell, Valeriu Beiu, Sorin Hoara, Pastorel Gaspar:
How Reliable are Compositions of Series and Parallel Networks Compared with Hammocks? Int. J. Comput. Commun. Control 13(5): 772-791 (2018) - [c55]Vlad Dragoi, Valeriu Beiu, Dominic Bucerzan:
Vulnerabilities of the McEliece Variants Based on Polar Codes. SecITC 2018: 376-390 - [c54]Valeriu Beiu, Simon Robin Cowell, Vlad-Florin Dragoi:
On Posets for Reliability: How Fine Can They Be? SOFA (1) 2018: 115-129 - 2017
- [c53]Simon Robin Cowell, Leonard Daus, Valeriu Beiu, Philippe Poulin:
On hammock networks - sixty years after. DTIS 2017: 1-6 - 2016
- [c52]Roxana Toderean, Oana Geman, Iuliana Chiuchisan, Valentina Emilia Balas, Valeriu Beiu:
Novel Method for Neurodegenerative Disorders Screening Patients Using Hurst Coefficients on EEG Delta Rhythm. SOFA (1) 2016: 349-358 - 2015
- [j14]Valeriu Beiu, Leonard Daus:
Reliability bounds for two dimensional consecutive systems. Nano Commun. Networks 6(3): 145-152 (2015) - [j13]Leonard Daus, Valeriu Beiu:
Lower and Upper Reliability Bounds for Consecutive-k-Out-of-n: F Systems. IEEE Trans. Reliab. 64(3): 1128-1135 (2015) - [c51]Valeriu Beiu, Leonard Daus:
Reliability schemes for nano-communications. ECCTD 2015: 1-4 - [c50]Valeriu Beiu, Mihai Tache:
Statistical analysis of static noise margins. ECCTD 2015: 1-4 - 2014
- [j12]Mihai Tache, Valeriu Beiu, Walid Ibrahim, Fekri Kharbash, Massimo Alioto:
Enhancing the Static Noise Margins by Upsizing Length for Ultra-Low Voltage/Power/Energy Gates. J. Low Power Electron. 10(1): 137-148 (2014) - [c49]Valeriu Beiu, Leonard Daus:
Deciphering the Reliability Scheme of the Neurons - One Ion Channel at a Time. BICT 2014 - [c48]Mihai Tache, Valeriu Beiu, Tsu-Jae King Liu:
Why hybridize NEMS with CMOS? ICECS 2014: 646-649 - 2013
- [c47]Walid Ibrahim, Valeriu Beiu, Mihai Tache, Fekri Kharbash:
On Schmitt trigger and other inverters. ICECS 2013: 29-32 - [c46]Fekri Kharbash, Valeriu Beiu, Mihai Tache, Walid Ibrahim:
Using body bias when upsizing length for maximizing the static noise margins of CMOS gates. ICECS 2013: 409-412 - [c45]Valeriu Beiu, Azam Beg, Walid Ibrahim, Fekri Kharbash, Massimo Alioto:
Enabling sizing for enhancing the static noise margins. ISQED 2013: 278-285 - 2012
- [j11]Walid Ibrahim, Valeriu Beiu, Azam Beg:
GREDA: A Fast and More Accurate Gate Reliability EDA Tool. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 31(4): 509-521 (2012) - [j10]Walid Ibrahim, Valeriu Beiu, Azam Beg:
Optimum Reliability Sizing for Complementary Metal Oxide Semiconductor Gates. IEEE Trans. Reliab. 61(3): 675-686 (2012) - [c44]Pietro Santagati, Valeriu Beiu:
A Mathematical Model for the Analysis of the Johnson-Nyquist Thermal Noise on the Reliability in Nano-Communications. BIONETICS 2012: 49-59 - 2011
- [j9]Valeriu Beiu, Basheer A. M. Madappuram, Peter M. Kelly, Liam McDaid:
On Two-Layer Brain-Inspired Hierarchical Topologies - A Rent's Rule Approach -. Trans. High Perform. Embed. Archit. Compil. 4: 311-333 (2011) - [j8]Walid Ibrahim, Valeriu Beiu:
Using Bayesian Networks to Accurately Calculate the Reliability of Complementary Metal Oxide Semiconductor Gates. IEEE Trans. Reliab. 60(3): 538-549 (2011) - [c43]Valeriu Beiu, Walid Ibrahim, Azam Beg, Liren Zhang, Mihai Tache:
On axon-inspired communications. ECCTD 2011: 789-792 - [c42]John J. Wade, Liam McDaid, Jim Harkin, Vincenzo Crunelli, J. A. Scott Kelso, Valeriu Beiu:
Exploring retrograde signaling via astrocytes as a mechanism for self repair. IJCNN 2011: 3149-3155 - 2010
- [c41]Liren Zhang, Hesham El-Sayed, Valeriu Beiu:
A Position-Based Broadcast Relay Approach in Mobile Vehicle-to-Vehicle Network. ICWN 2010: 611-616 - [c40]Walid Ibrahim, Valeriu Beiu, Azam Beg:
On NOR-2 von Neumann multiplexing. IDT 2010: 67-72
2000 – 2009
- 2009
- [c39]Valeriu Beiu, Basheer A. M. Madappuram, Peter M. Kelly, Liam McDaid:
On Two-Layer Hierarchical Networks How Does the Brain Do This? NanoNet 2009: 231-241 - [c38]Peter M. Kelly, Fergal Tuffy, Valeriu Beiu, Liam McDaid:
Reduced Interconnects in Neural Networks Using a Time Multiplexed Architecture Based on Quantum Devices. NanoNet 2009: 242-250 - [c37]Valeriu Beiu, Walid Ibrahim, Rafic Z. Makki:
On Wires Holding a Handful of Electrons. NanoNet 2009: 259-269 - [c36]Walid Ibrahim, Valeriu Beiu:
A Bayesian-Based EDA Tool for Nano-circuits Reliability Calculations. NanoNet 2009: 276-284 - [e1]Alexandre Schmid, Sanjay Goel, Wei Wang, Valeriu Beiu, Sandro Carrara:
Nano-Net - 4th International ICST Conference, Nano-Net 2009, Lucerne, Switzerland, October 18-20, 2009. Proceedings. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 20, Springer 2009, ISBN 978-3-642-04849-4 [contents] - [r1]Valeriu Beiu, Walid Ibrahim, Sanja Lazarova-Molnar:
Device-Level Majority von Neumann Multiplexing. Encyclopedia of Artificial Intelligence 2009: 471-479 - 2008
- [c35]Valeriu Beiu, Walid Ibrahim:
Does the brain really outperform Rent's rule? ISCAS 2008: 640-643 - [c34]Basheer A. M. Madappuram, Valeriu Beiu, Peter M. Kelly, Liam McDaid:
On brain-inspired connectivity and hybrid network topologies. NANOARCH 2008: 54-61 - [c33]Valeriu Beiu, Basheer A. M. Madappuram, T. Martin McGinnity:
On brain-inspired hybrid topologies for nano-architectures - a Rent's rule approach -. ICSAMOS 2008: 33-40 - 2007
- [j7]Valeriu Beiu, Snorre Aunet, Jabulani Nyathi, Ray Robert Rydberg III, Walid Ibrahim:
Serial Addition: Locally Connected Architectures. IEEE Trans. Circuits Syst. I Regul. Pap. 54-I(11): 2564-2579 (2007) - [c32]Walid Ibrahim, Valeriu Beiu:
Long Live Small Fan-in Majority Gates Their Reign Looks Like Coming! ASAP 2007: 278-283 - [c31]Valeriu Beiu:
Grand Challenges of Nanoelectronics and Possible Architectural Solutions: What Do Shannon, von Neumann, Kolmogorov, and Feynman Have to do with Moore. ISMVL 2007 - [c30]Valeriu Beiu, Walid Ibrahim, Sanja Lazarova-Molnar:
What von Neumann Did Not Say About Multiplexing Beyond Gate Failures - The Gory Details. IWANN 2007: 487-496 - 2006
- [c29]Valeriu Beiu, Jabulani Nyathi, Snorre Aunet, Mawahib H. Sulieman:
Femto Joule Switching for Nano Electronics. AICCSA 2006: 415-423 - [c28]Mawahib H. Sulieman, Valeriu Beiu:
Multiplexing Schemes in Single-Electron Technology. AICCSA 2006: 424-428 - [c27]Valeriu Beiu, Walid Ibrahim, Y. A. Alkhawwar, Mawahib H. Sulieman:
Gate Failures Effectively Shape Multiplexing. DFT 2006: 29-40 - 2005
- [c26]Valeriu Beiu, Snorre Aunet, Jabulani Nyathi, Ray Robert Rydberg III, Asbjørn Djupdal:
On the Advantages of Serial Architectures for Low-Power Reliable Computations. ASAP 2005: 276-281 - [c25]Valeriu Beiu, Artur Zawadski, Razvan Andonie, Snorre Aunet:
Using Kolmogorov Inspired Gates for Low Power Nanoelectronics. IWANN 2005: 438-445 - [c24]Valeriu Beiu, Asbjørn Djupdal, Snorre Aunet:
Ultra Low-Power Neural Inspired Addition: When Serial Might Outperform Parallel Architectures. IWANN 2005: 486-493 - 2004
- [c23]Valeriu Beiu:
A Novel Highly Reliable Low-Power Nano Architecture When von Neumann Augments. ASAP 2004: 167-177 - [c22]David J. Betowski, Daniel Dwyer, Valeriu Beiu:
A Novel Segmented Parabolic Sine Approximation for Direct Digital Frequency Synthesizers. ESA/VLSI 2004: 523-529 - [c21]Valeriu Beiu, Mawahib H. Sulieman:
Optimal Practical Perceptron Addition Application to Single Electron Technology. ESA/VLSI 2004: 541-550 - [c20]Mawahib H. Sulieman, Valeriu Beiu:
Characterization of a 16-bit threshold logic single-electron technology adder. ISCAS (3) 2004: 681-684 - 2003
- [j6]Valeriu Beiu, José M. Quintana, Maria J. Avedillo:
VLSI implementations of threshold logic-a comprehensive survey. IEEE Trans. Neural Networks 14(5): 1217-1243 (2003) - [c19]Valeriu Beiu, Maria J. Avedillo, José M. Quintana:
Review of Capacitive Threshold Gate Implementations. ICANN 2003: 737-744 - [c18]Valeriu Beiu:
Constructive Threshold Logic Addition A Synopsis of the Last Decade. ICANN 2003: 745-752 - [c17]Suryanarayana Tatapudi, Valeriu Beiu:
Split-Precharge Differential Noise-Immune Threshold Logic Gate (SPD-NTL). IWANN (2) 2003: 49-56 - [c16]Valeriu Beiu, José M. Quintana, Maria J. Avedillo:
Review of Differential Threshold Gate Implementations. Neural Networks and Computational Intelligence 2003: 44-49 - [c15]Valeriu Beiu:
On Existential and Constructive Neural Complexity Results. Neural Networks and Computational Intelligence 2003: 63-72 - [c14]Razvan Andonie, Lucian Mircea Sasu, Valeriu Beiu:
A Modified Fuzzy ARTMAP Architecture for Incremental Learning Function Approximation. Neural Networks and Computational Intelligence 2003: 124-129
1990 – 1999
- 1999
- [j5]Valeriu Beiu, Sorin Draghici, Thierry de Pauw:
A Constructive Approach to Calculating Lower Entropy Bounds. Neural Process. Lett. 9(1): 1-12 (1999) - [c13]Valeriu Beiu:
Neural Addition and Fibonacci Numbers. IWANN (2) 1999: 198-207 - 1998
- [j4]Valeriu Beiu:
On the circuit and VLSI complexity of threshold gate COMPARISON. Neurocomputing 19(1-3): 77-98 (1998) - [j3]Valeriu Beiu, Hanna E. Makaruk:
Deeper Sparsely Nets can be Optimal. Neural Process. Lett. 8(3): 201-210 (1998) - [c12]Valeriu Beiu:
Implementing size-optimal discrete neural networks require analog circuitry. EUSIPCO 1998: 1-4 - [c11]Valeriu Beiu:
2D Neural Hardware versus 3D Biological Ones. NC 1998: 36-42 - [c10]Valeriu Beiu:
On Kolmogorov's Superpositions and Boolean Functions. SBRN 1998: 55-60 - 1997
- [c9]Valeriu Beiu:
Enhanced lower entropy bounds with application to constructive learning. EUROMICRO 1997: 541-548 - [c8]Valeriu Beiu, Thierry de Pauw:
Tight Bounds on the Size of Neural Networks for Classification Problems. IWANN 1997: 743-752 - [c7]Valeriu Beiu, Sorin Draghici, Hanna E. Makaruk:
On limited fan-in optimal neural networks. SBRN 1997: 19-30 - 1996
- [j2]Valeriu Beiu, John G. Taylor:
On the Circuit Complexity of Sigmoid Feedforward Neural Networks. Neural Networks 9(7): 1155-1171 (1996) - 1995
- [c6]Valeriu Beiu, John G. Taylor:
VLSI Optimal Neural Network Learning Algorithm. ICANNGA 1995: 61-64 - [c5]Valeriu Beiu, John G. Taylor:
Optimal Mapping of Neural Networks onto FPGA's - A New Constructive Algorithm -. IWANN 1995: 822-829 - [c4]J. C. Lemm, Valeriu Beiu, John G. Taylor:
Density Estimation as a Preprocessing Step for Constructive Algorithms. SNN Symposium on Neural Networks 1995: 213-216 - 1994
- [j1]Valeriu Beiu, J. A. Peperstraete, Joos Vandewalle, Rudy Lauwereins:
Closse Approximations of Sigmoid Functions by Sum of Step for VLSI Implementation of Neural Networks. Sci. Ann. Cuza Univ. 3: 5-34 (1994) - [c3]Valeriu Beiu, J. A. Peperstraete, Joos Vandewalle, Rudy Lauwereins:
VLSI complexity reduction by piece-wise approximation of the sigmoid function. ESANN 1994 - 1993
- [c2]Valeriu Beiu, J. A. Peperstraete, Joos Vandewalle, Rudy Lauwereins:
Efficient decomposition of comparison and its applications. ESANN 1993
1980 – 1989
- 1988
- [c1]Valeriu Beiu:
VLSI arrays implementing parallel line-drawing algorithms. Parcella 1988: 241-247
Coauthor Index
aka: Vlad-Florin Dragoi
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-04 20:57 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:
