default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerap A. Savari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Serap A. Savari:
On Image Registration and Subpixel Estimation. CoRR abs/2405.12927 (2024)- 2022
- [i5]Inimfon I. Akpabio, Serap A. Savari:
On the Construction of Distribution-Free Prediction Intervals for an Image Regression Problem in Semiconductor Manufacturing. CoRR abs/2203.03150 (2022)
2010 – 2019
- 2015
- [i4]Narendra Chaudhary, Yao Luo, Serap A. Savari, Roger McCay:
Lossless Layout Image Compression Algorithms for Electron-Beam Direct-Write Lithography. CoRR abs/1505.06494 (2015) - 2014
- [j21]S. M. Hossein Tabatabaei Yazdi, Serap A. Savari:
On the Relationships Among Optimal Symmetric Fix-Free Codes. IEEE Trans. Inf. Theory 60(8): 4567-4583 (2014) - 2013
- [j20]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
A Deterministic Polynomial-Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks. IEEE Trans. Inf. Theory 59(11): 7541-7552 (2013) - [c30]S. M. Hossein Tabatabaei Yazdi, Serap A. Savari:
On the Relationships among Optimal Symmetric Fix-Free Codes. DCC 2013: 391-400 - 2012
- [j19]Serap A. Savari, S. M. Hossein Tabatabaei Yazdi, Navid Abedini, Sunil P. Khatri:
On Optimal and Achievable Fix-Free Codes. IEEE Trans. Inf. Theory 58(8): 5112-5129 (2012) - [i3]S. M. Hossein Tabatabaei Yazdi, Serap A. Savari:
On the Relationships among Optimal Symmetric Fix-Free Codes. CoRR abs/1211.2723 (2012) - 2011
- [j18]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks. IEEE Trans. Inf. Theory 57(5): 3005-3015 (2011) - [j17]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Gerhard Kramer
:
Network Coding in Node-Constrained Line and Star Networks. IEEE Trans. Inf. Theory 57(7): 4452-4468 (2011) - [c29]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
A deterministic polynomialtime algorithm for constructing a multicast coding scheme for linear deterministic relay networks. CISS 2011: 1-6 - [i2]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
A Deterministic Polynomial--Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks. CoRR abs/1101.2937 (2011) - 2010
- [j16]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Gerhard Kramer, Kelli Carlson, Farzad Farnoud:
On the multimessage capacity region for undirected ring networks. IEEE Trans. Inf. Theory 56(4): 1930-1947 (2010) - [c28]Jeehong Yang, Serap A. Savari:
A Lossless Circuit Layout Image Compression Algorithm for Maskless Lithography Systems. DCC 2010: 109-118 - [c27]Navid Abedini, Sunil P. Khatri, Serap A. Savari:
A SAT-Based Scheme to Determine Optimal Fix-Free Codes. DCC 2010: 169-178 - [c26]Serap A. Savari, Jörg Kliewer:
When Huffman Meets Hamming: A Class of Optimal Variable-Length Error Correcting Codes. DCC 2010: 327-336 - [c25]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks. SODA 2010: 1209-1226
2000 – 2009
- 2009
- [c24]Serap A. Savari:
On Minimum-Redundancy Fix-Free Codes. DCC 2009: 3-12 - [i1]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
A Combinatorial Study of Linear Deterministic Relay Networks. CoRR abs/0904.2401 (2009) - 2008
- [j15]Serap A. Savari:
On One-to-One Codes for Memoryless Cost Channels. IEEE Trans. Inf. Theory 54(1): 367-379 (2008) - [c23]Ali Kakhbod, Serap A. Savari, S. M. Sadegh Tabatabaei Yazdi:
A study of the routing capacity regions of networks. ACSCC 2008: 2226-2230 - [c22]Gerhard Kramer, S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
Network coding on line networks with broadcast. CISS 2008: 781-784 - [c21]Jeehong Yang, Serap A. Savari, Oskar Mencer:
An Approach to Graph and Netlist Compression. DCC 2008: 33-42 - [c20]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Gerhard Kramer:
Network coding in star networks. ISIT 2008: 325-329 - 2007
- [j14]Gerhard Kramer, Serap A. Savari:
Communicating Probability Distributions. IEEE Trans. Inf. Theory 53(2): 518-525 (2007) - [c19]Jeehong Yang, Serap A. Savari:
Dictionary-based English text compression using word endings. DCC 2007: 410 - [c18]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Kelli Carlson, Gerhard Kramer:
The Capacity Region of a Collection of Multicast Sessions in an Undirected Ring Network. ICPP Workshops 2007: 40 - [c17]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Farzad Farnoud, Gerhard Kramer:
A Multimessage Capacity Region for Undirected Ring Networks. ISIT 2007: 1091-1095 - 2006
- [j13]Gerhard Kramer, Serap A. Savari:
Edge-Cut Bounds on Network Coding Rates. J. Netw. Syst. Manag. 14(1): 49-67 (2006) - [c16]Serap A. Savari, Gerhard Kramer:
The Multimessage Unicast Capacity Region for Bidirectional Ring Networks. ISIT 2006: 763-767 - [c15]Michael Drmota, Yuriy A. Reznik, Serap A. Savari, Wojciech Szpankowski:
Precise Asymptotic Analysis of the Tunstall Code. ISIT 2006: 2334-2337 - 2005
- [c14]Gerhard Kramer, Serap A. Savari:
Progressive d-separating edge set bounds on network coding rates. ISIT 2005: 1588-1592 - 2004
- [j12]Serap A. Savari:
Compression of words over a partially commutative alphabet. IEEE Trans. Inf. Theory 50(7): 1425-1441 (2004) - [c13]Gerhard Kramer, Serap A. Savari:
Cut sets and information flow in networks of two-way channels. ISIT 2004: 33 - [c12]Serap A. Savari, Akshay Naheta:
Bounds on the expected cost of one-to-one codes. ISIT 2004: 92 - 2003
- [c11]Serap A. Savari:
On Compressing Interchange Classes of Events in a Concurrent System. DCC 2003: 153-162 - [c10]Serap A. Savari:
Compressing a Representation of Events in a Concurrent System. Advances in Network Information Theory 2003: 25-42 - [c9]Gerhard Kramer, Serap A. Savari:
On networks of two-way channels. Algebraic Coding Theory and Information Theory 2003: 133-144 - 2001
- [j11]Vivek K. Goyal, Serap A. Savari, Wei Wang:
On optimal permutation codes. IEEE Trans. Inf. Theory 47(7): 2961-2971 (2001) - [c8]Sean Dorward, Dawei Huang, Serap A. Savari, Gerald Schuller, Bin Yu:
Low Delay Perpetually Lossless Coding of Audio Signals. Data Compression Conference 2001: 312- - 2000
- [j10]Serap A. Savari, Cliff Young:
Comparing and Combining Profiles. J. Instr. Level Parallelism 2 (2000) - [j9]Serap A. Savari:
Renewal theory and source coding. Proc. IEEE 88(11): 1692-1702 (2000) - [j8]Serap A. Savari:
A probabilistic approach to some asymptotics in noiseless communication. IEEE Trans. Inf. Theory 46(4): 1246-1262 (2000)
1990 – 1999
- 1999
- [j7]Serap A. Savari:
Variable-to-fixed length codes and the conservation of entropy. IEEE Trans. Inf. Theory 45(5): 1612-1620 (1999) - [c7]Serap A. Savari:
Variable-to-Fixed Length Codes and Plurally Parsable Dictionaries. Data Compression Conference 1999: 453-462 - 1998
- [j6]Serap A. Savari:
Redundancy of the Lempel-Ziv String Matching Code. IEEE Trans. Inf. Theory 44(2): 787-791 (1998) - [c6]Serap A. Savari:
Variable to Fixed Length Codes for Predictable Sources. Data Compression Conference 1998: 481-490 - 1997
- [j5]Serap A. Savari:
Redundancy of the Lempel-Ziv incremental parsing rule. IEEE Trans. Inf. Theory 43(1): 9-21 (1997) - [j4]Serap A. Savari, Robert G. Gallager:
Generalized Tunstall codes for sources with memory. IEEE Trans. Inf. Theory 43(2): 658-668 (1997) - [c5]Serap A. Savari:
Redundancy of the Lempel-Ziv-Welch Code. Data Compression Conference 1997: 191-200 - [c4]Serap A. Savari:
A probabilistic approach to some asymptotics in source coding. SEQUENCES 1997: 97-106 - 1996
- [b1]Serap A. Savari:
Variable-to-fixed length codes for sources with known and unknown memory. Massachusetts Institute of Technology, Cambridge, MA, USA, 1996 - [j3]Serap A. Savari, Dimitri P. Bertsekas:
Finite Termination of Asynchronous Iterative Algorithms. Parallel Comput. 22(1): 39-56 (1996) - 1995
- [c3]Martin Farach, Michiel O. Noordewier, Serap A. Savari, Larry A. Shepp, Aaron D. Wyner, Jacob Ziv:
On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence. SODA 1995: 48-57 - 1994
- [j2]Serap A. Savari, Robert G. Gallager:
Arithmetic coding for finite-state noiseless channels. IEEE Trans. Inf. Theory 40(1): 100-107 (1994) - [j1]Serap A. Savari:
Some notes on Varn coding. IEEE Trans. Inf. Theory 40(1): 181-186 (1994) - 1993
- [c2]Serap A. Savari:
Average Case Analysis of Five Two-Dimensional Bubble Sorting Algorithms. SPAA 1993: 336-345 - 1992
- [c1]Serap A. Savari, Robert G. Gallager:
Arithmetic Coding for Memoryless Cost Channels. Data Compression Conference 1992: 92-101
Coauthor Index
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-06-19 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
