Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., Ser. 1, 2007, Volume 14, Issue 1, Pages 27–44 (Mi da40)  

This article is cited in 4 scientific papers (total in 5 papers)

On the construction of schemes for adders of small depth

S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: Some methods are considered for the circuit design of $n$-digit adders of small depth. The efficiency of synthesis methods is determined by the depth of circuits for $n<1000$.

Full text: PDF file (277 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2008, 2:2, 167–178

Bibliographic databases:


Citation: S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev, “On the construction of schemes for adders of small depth”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007), 27–44; J. Appl. Industr. Math., 2:2 (2008), 167–178

Citation in format AMSBIB
\Bibitem{GasGriSer07}
\by S.~B.~Gashkov, M.~I.~Grinchuk, I.~S.~Sergeev
\paper On the construction of schemes for adders of small depth
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2007
\vol 14
\issue 1
\pages 27--44
\mathnet{http://mi.mathnet.ru/da40}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2328233}
\zmath{https://zbmath.org/?q=an:1249.94072}
\transl
\jour J. Appl. Industr. Math.
\yr 2008
\vol 2
\issue 2
\pages 167--178
\crossref{https://doi.org/10.1134/S1990478908020038}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-44849126348}


Linking options:
  • http://mi.mathnet.ru/eng/da40
  • http://mi.mathnet.ru/eng/da/v14/s1/i1/p27

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. J. Appl. Industr. Math., 3:1 (2009), 61–67  mathnet  crossref  mathscinet  zmath
    2. S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev, “Pismo v redaktsiyu”, Diskretn. analiz i issled. oper., 15:4 (2008), 92–93  mathnet  mathscinet  zmath
    3. S. B. Gashkov, I. S. Sergeev, “Complexity of computation in finite fields”, J. Math. Sci., 191:5 (2013), 661–685  mathnet  crossref
    4. Held S., Spirkl S.T., “Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two”, ACM Trans. Algorithms, 14:1 (2018), 4  crossref  mathscinet  isi  scopus
    5. S. B. Gashkov, I. S. Sergeev, “O znachenii rabot V. M. Khrapchenko”, PDM, 2020, no. 48, 109–124  mathnet  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:683
    Full text:253
    References:47

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021