{"id":"https://openalex.org/W2093202670","doi":"https://doi.org/10.1016/s0020-0190(01)00199-5","title":"A faster off-line algorithm for the TCP acknowledgement problem","display_name":"A faster off-line algorithm for the TCP acknowledgement problem","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2093202670","doi":"https://doi.org/10.1016/s0020-0190(01)00199-5","mag":"2093202670"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(01)00199-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(01)00199-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008465806","display_name":"John Noga","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"John Noga","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Steyrergasse 30, A\u20108010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Steyrergasse 30, A\u20108010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109048821","display_name":"Steve Seiden","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steve Seiden","raw_affiliation_strings":["Department of Computer Science, 298 Coates Hall, Louisiana State University, Baton Rouge, LA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, 298 Coates Hall, Louisiana State University, Baton Rouge, LA#TAB#","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Steyrergasse 30, A\u20108010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Steyrergasse 30, A\u20108010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.6892,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.74022017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"81","issue":"2","first_page":"71","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/acknowledgement","display_name":"Acknowledgement","score":0.7911707162857056},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.550060510635376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5198307633399963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5047518014907837},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23748356103897095},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20230281352996826}],"concepts":[{"id":"https://openalex.org/C2777880217","wikidata":"https://www.wikidata.org/wiki/Q4674282","display_name":"Acknowledgement","level":2,"score":0.7911707162857056},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.550060510635376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5198307633399963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5047518014907837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23748356103897095},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20230281352996826},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/s0020-0190(01)00199-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(01)00199-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/5cb41dd7-f789-4280-b967-38b0b2f55db2","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/5cb41dd7-f789-4280-b967-38b0b2f55db2","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Noga, J, Seiden, S S & Woeginger, G J 2002, 'A faster off-line algorithm for the TCP acknowledgement problem', Information Processing Letters, vol. 81, no. 2, pp. 71-73. https://doi.org/10.1016/S0020-0190(01)00199-5","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:623759","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=623759","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0020-0190","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:623759","is_oa":false,"landing_page_url":"http://repository.tue.nl/623759","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0020-0190","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/5cb41dd7-f789-4280-b967-38b0b2f55db2","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/5cb41dd7-f789-4280-b967-38b0b2f55db2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Information Processing Letters, 81(2), 71 - 73. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1979784498","https://openalex.org/W2055257826","https://openalex.org/W2057640376","https://openalex.org/W2082378428"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1504381137","https://openalex.org/W4283656061","https://openalex.org/W2620413320","https://openalex.org/W4385757279","https://openalex.org/W2067129656","https://openalex.org/W1974563604","https://openalex.org/W2211012933","https://openalex.org/W1002241103"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
