A faster off-line algorithm for the TCP acknowledgement problem. (Q1603523): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: John Noga / rank
Normal rank
 
Property / author
 
Property / author: John Noga / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence comparison with mixed convex and concave costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concave least-weight subsequence problem revisited / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00199-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093202670 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:36, 30 July 2024

scientific article
Language Label Description Also known as
English
A faster off-line algorithm for the TCP acknowledgement problem.
scientific article

    Statements

    A faster off-line algorithm for the TCP acknowledgement problem. (English)
    0 references
    0 references
    0 references
    0 references
    14 July 2002
    0 references
    0 references
    Transmission Control Protocol
    0 references
    TCP acknowledgement
    0 references
    Networks
    0 references
    Dynamic programming
    0 references
    0 references