![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Lev S. Tsimring
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j10]Diane M. Longo, Jangir Selimkhanov, Jeffrey D. Kearns, Jeff Hasty, Alexander Hoffmann, Lev S. Tsimring:
Dual Delayed Feedback Provides Sensitivity and Robustness to the NF-κB Signaling Module. PLoS Comput. Biol. 9(6) (2013) - 2012
- [j9]William H. Mather, Jeff Hasty, Lev S. Tsimring:
Fast stochastic algorithm for simulating evolutionary population dynamics. Bioinform. 28(9): 1230-1238 (2012) - 2011
- [j8]William H. Mather, Jeff Hasty, Lev S. Tsimring, Ruth J. Williams:
Factorized time-dependent distributions for certain multiclass queueing networks and an application to enzymatic processing networks. Queueing Syst. Theory Appl. 69(3-4): 313-328 (2011)
2000 – 2009
- 2009
- [j7]Carlos Aguirre, Ramón Huerta, Lev S. Tsimring:
Optimal Serverless Networks Attacks, Complexity and some Approximate Algorithms. J. Univers. Comput. Sci. 15(14): 2747-2764 (2009) - 2005
- [j6]Roy Tenny, Lev S. Tsimring:
Additive mixing modulation for public key encryption based on distributed dynamics. IEEE Trans. Circuits Syst. I Regul. Pap. 52-I(3): 672-679 (2005) - 2004
- [j5]Roy Tenny, Lev S. Tsimring:
Steps towards Cryptanalysis of Chaotic Active/Passive Decomposition Encryption Schemes Using Average Dynamics Estimation. Int. J. Bifurc. Chaos 14(11): 3949-3968 (2004) - 2002
- [c2]Roy Tenny, Lev S. Tsimring, Henry D. I. Abarbanel, Lawrence E. Larson:
Asymmetric Key Encryption using Distributed Chaotic Nonlinear Dynamics. Communications, Internet, and Information Technology 2002: 338-345 - 2000
- [j4]Mikhail Sushchik Jr., Nikolai F. Rulkov, Lev S. Tsimring, Henry D. I. Abarbanel, Kung Yao, Alexander Volkovskii:
Chaotic pulse position modulation: a robust method of communicating with chaos. IEEE Commun. Lett. 4(4): 128-130 (2000)
1990 – 1999
- 1999
- [j3]Nikolai F. Rulkov, Lev S. Tsimring:
Synchronization methods for communication with chaos over band‐limited channels. Int. J. Circuit Theory Appl. 27(6): 555-567 (1999) - [j2]Alexander Volkovskii, Lev S. Tsimring:
Synchronization and communication using chaotic frequency modulation. Int. J. Circuit Theory Appl. 27(6): 569-576 (1999) - 1998
- [j1]Henry D. I. Abarbanel, Ted Frison, Lev S. Tsimring:
Obtaining order in a world of chaos [signal processing]. IEEE Signal Process. Mag. 15(3): 49-65 (1998) - 1995
- [c1]Ted Frison, Henry D. I. Abarbanel, Lev S. Tsimring:
Chaotic methods for image processing. ICASSP 1995: 1340-1343
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint