Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Zhaneta Savova-Tasheva

◀ ▶ joint publications with Borislav Bedzhev

> Home > Persons > Zhaneta Savova-Tasheva

Publications

2007
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/compsystech/TashevBT07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compsystech/TashevBT07
Todor Tashev, Borislav Bedzhev, Zhaneta Tasheva:
The generalized shrinking-multiplexing generator. CompSysTech 2007: 48
2005
[i1]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/TashevaBS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/TashevaBS05
Zhaneta Tasheva, Borislav Bedzhev, Borislav Stoyanov:
N-adic Summation-Shrinking Generator. Basic properties and empirical evidences. IACR Cryptol. ePrint Arch. 2005: 68 (2005)
2004
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/compsystech/BedzhevTS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compsystech/BedzhevTS04
Borislav Y. Bedzhev, Zhaneta Nikolova Tasheva, Borislav Stoyanov:
A method for computer synthesis of radio signals for the next generation personal communication systems. CompSysTech 2004: 1-6
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/compsystech/BedzhevTS04a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compsystech/BedzhevTS04a
Borislav Y. Bedzhev, Zhaneta Nikolova Tasheva, Borislav Stoyanov:
An algorithm for computer synthesis of complementary sequences. CompSysTech 2004: 1-6

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.