


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


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 58 matches
- 1997
- Abraham J. Wyner:
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm. IEEE Trans. Inf. Theory 43(5): 1452-1464 (1997) - 1996
- Amnon Gavish, Abraham Lempel:
Match-length functions for data compression. IEEE Trans. Inf. Theory 42(5): 1375-1380 (1996) - 1995
- Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
On Encoding and Decoding with Two-Way Head Machines. Inf. Comput. 116(1): 128-133 (1995) - Aaron D. Wyner, Abraham J. Wyner:
Improved redundancy of a version of the Lempel-Ziv algorithm. IEEE Trans. Inf. Theory 41(3): 723-731 (1995) - 1994
- Amnon Gavish, Abraham Lempel:
On ternary complementary sequences. IEEE Trans. Inf. Theory 40(2): 522-526 (1994) - 1993
- Abraham Lempel, Gadiel Seroussi:
Application of Finte Fields to Memory Interleaving. AAECC 1993: 244-256 - Amnon Gavish, Abraham Lempel:
On Complementary Sequences. Algebraic Coding 1993: 126-140 - 1992
- Abraham Lempel, Gadiel Seroussi:
Systematic derivation of spline bases. Comput. Aided Geom. Des. 9(5): 349-363 (1992) - Ron M. Roth, Abraham Lempel:
t-sum generators of finite Abelian groups. Discret. Math. 103(3): 279-292 (1992) - Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv:
A sequential algorithm for the universal coding of finite memory sources. IEEE Trans. Inf. Theory 38(3): 1002-1014 (1992) - Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel:
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences. IEEE Trans. Inf. Theory 38(2): 380-385 (1992) - Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv:
On the Coding Delay of a General Coder. Data Compression Conference 1992: 102-111 - 1991
- Abraham Lempel, Gadiel Seroussi:
Explicit formulas for self-complementary normal bases in certain finite fields. IEEE Trans. Inf. Theory 37(4): 1220-1222 (1991) - Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
On Compression with Two-Way Head Machines. Data Compression Conference 1991: 218-227 - Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel:
On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual Sequences. Data Compression Conference 1991: 239-246 - 1990
- Marcelo J. Weinberger, Abraham Lempel:
Factorization of symmetric circulant matrices in finite fields. Discret. Appl. Math. 28(3): 271-285 (1990) - Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
Two-dimensional encoding by finite-state encoders. IEEE Trans. Commun. 38(3): 341-347 (1990) - Ron M. Roth, Abraham Lempel:
Application of circulant matrices to the construction and decoding of linear codes. IEEE Trans. Inf. Theory 36(5): 1157-1163 (1990) - 1989
- Ron M. Roth, Abraham Lempel:
A construction of non-Reed-Solomon type MDS codes. IEEE Trans. Inf. Theory 35(3): 655-657 (1989) - Ron M. Roth, Abraham Lempel:
On MDS codes via Cauchy matrices. IEEE Trans. Inf. Theory 35(6): 1314-1319 (1989) - 1988
- Abraham Lempel, Marcelo J. Weinberger:
Self-Complementary Normal Bases in Finite Fields. SIAM J. Discret. Math. 1(2): 193-198 (1988) - Ron M. Roth, Abraham Lempel:
Composition of Reed-Solomon codes and geometric designs. IEEE Trans. Inf. Theory 34(4): 810-816 (1988) - 1986
- Tuvi Etzion, Abraham Lempel:
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network. SIAM J. Comput. 15(1): 216-221 (1986) - Abraham Lempel:
On multiset decipherable codes. IEEE Trans. Inf. Theory 32(5): 714-716 (1986) - Abraham Lempel, Jacob Ziv:
Compression of two-dimensional data. IEEE Trans. Inf. Theory 32(1): 2-8 (1986) - 1985
- Shimon Even, Oded Goldreich
, Abraham Lempel:
A Randomized Protocol for Signing Contracts. Commun. ACM 28(6): 637-647 (1985) - Gérard D. Cohen, Abraham Lempel:
Linear intersecting codes. Discret. Math. 56(1): 35-43 (1985) - Abraham Lempel, Martin Cohn:
Design of universal test sequences for VLSI. IEEE Trans. Inf. Theory 31(1): 10-17 (1985) - 1984
- Gadiel Seroussi, Abraham Lempel:
On Symmetric Algorithms for Bilinear Forms over Finite Fields. J. Algorithms 5(3): 327-344 (1984) - Tuvi Etzion, Abraham Lempel:
Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inf. Theory 30(3): 480-484 (1984)
skipping 28 more matches
loading more results
failed to load more results, please try again later

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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
retrieved on 2023-06-04 02:18 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint