Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Vlad P. Shmerko

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jon T. Butler

> Home > Persons > Vlad P. Shmerko

Publications

2001
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/ButlerDYS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/ButlerDYS01
Jon T. Butler, Gerhard W. Dueck, Svetlana N. Yanushkevich, Vlad P. Shmerko:
On the number of generators for transeunt triangles. Discret. Appl. Math. 108(3): 309-316 (2001)
2000
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tcad/ButlerDSY00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/ButlerDSY00
Jon T. Butler, Gerhard W. Dueck, Vlad P. Shmerko, Svetlana N. Yanushkevich:
Comments on "Sympathy: fast exact minimization of fixedpolarity Reed-Muller expansion for symmetric functions". IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(11): 1386-1388 (2000)
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/ismvl/YanushkevichBDS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ismvl/YanushkevichBDS00
Svetlana N. Yanushkevich, Jon T. Butler, Gerhard W. Dueck, Vlad P. Shmerko:
Experiments on FPRM Expressions for Partially Symmetric Logic Functions. ISMVL 2000: 141-146

a service of

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.