{"id":"https://openalex.org/W2002992113","doi":"https://doi.org/10.1137/s0097539790192647","title":"Bounded Concurrent Time-Stamping","display_name":"Bounded Concurrent Time-Stamping","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W2002992113","doi":"https://doi.org/10.1137/s0097539790192647","mag":"2002992113"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539790192647","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790192647","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5013225896","display_name":"Danny Dolev","orcid":"https://orcid.org/0000-0001-8853-0644"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Danny Dolev","raw_affiliation_strings":["IBM Almaden Research Center, K53/802, 650 Harry Road, San Jose, CA 95120-6099"],"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, K53/802, 650 Harry Road, San Jose, CA 95120-6099","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037659256","display_name":"Nir Shavit","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nir Shavit","raw_affiliation_strings":["Department of Computer Science, Hebrew University, Givat-Ram, Jerusalem 91906, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Hebrew University, Givat-Ram, Jerusalem 91906, Israel","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013225896"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":4.0586,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.93525312,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"26","issue":"2","first_page":"418","last_page":"455"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.972100019454956,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9620000123977661,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.8270310163497925},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.7582705020904541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7329561710357666},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6725614666938782},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5677355527877808},{"id":"https://openalex.org/keywords/timestamp","display_name":"Timestamp","score":0.5536273717880249},{"id":"https://openalex.org/keywords/fifo","display_name":"FIFO (computing and electronics)","score":0.5180659294128418},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4761402904987335},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"Concurrency control","score":0.4759514033794403},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.44851401448249817},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.44248029589653015},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43338513374328613},{"id":"https://openalex.org/keywords/concurrent-computing","display_name":"Concurrent computing","score":0.42130792140960693},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.41167527437210083},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4078814685344696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3209499716758728},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22958409786224365},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19765248894691467},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.15599307417869568},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10012036561965942}],"concepts":[{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8270310163497925},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.7582705020904541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7329561710357666},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6725614666938782},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5677355527877808},{"id":"https://openalex.org/C113954288","wikidata":"https://www.wikidata.org/wiki/Q186885","display_name":"Timestamp","level":2,"score":0.5536273717880249},{"id":"https://openalex.org/C2777145635","wikidata":"https://www.wikidata.org/wiki/Q515636","display_name":"FIFO (computing and electronics)","level":2,"score":0.5180659294128418},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4761402904987335},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.4759514033794403},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.44851401448249817},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.44248029589653015},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43338513374328613},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.42130792140960693},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.41167527437210083},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4078814685344696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3209499716758728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22958409786224365},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19765248894691467},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.15599307417869568},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10012036561965942},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539790192647","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790192647","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.465.7998","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.7998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://groups.csail.mit.edu/tds/papers/Shavit/sicomp97.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W146687217","https://openalex.org/W1544996722","https://openalex.org/W1556276302","https://openalex.org/W1599934884","https://openalex.org/W1974904623","https://openalex.org/W1976075610","https://openalex.org/W1987182690","https://openalex.org/W1988881980","https://openalex.org/W1990291124","https://openalex.org/W1993805917","https://openalex.org/W2000302396","https://openalex.org/W2002992113","https://openalex.org/W2005317574","https://openalex.org/W2016423197","https://openalex.org/W2019212039","https://openalex.org/W2022086264","https://openalex.org/W2022907112","https://openalex.org/W2025062383","https://openalex.org/W2025911221","https://openalex.org/W2036267700","https://openalex.org/W2036667872","https://openalex.org/W2043801088","https://openalex.org/W2055317155","https://openalex.org/W2055379190","https://openalex.org/W2056740525","https://openalex.org/W2058618358","https://openalex.org/W2069207430","https://openalex.org/W2070908350","https://openalex.org/W2085407655","https://openalex.org/W2087719952","https://openalex.org/W2094104092","https://openalex.org/W2095244541","https://openalex.org/W2101939036","https://openalex.org/W2105336351","https://openalex.org/W2120752240","https://openalex.org/W2121236443","https://openalex.org/W2126944540","https://openalex.org/W2166680701","https://openalex.org/W2170523074","https://openalex.org/W2571591575","https://openalex.org/W4294549613"],"related_works":["https://openalex.org/W2037546465","https://openalex.org/W1490920858","https://openalex.org/W151769687","https://openalex.org/W2258569017","https://openalex.org/W2963362836","https://openalex.org/W2157221099","https://openalex.org/W2067980691","https://openalex.org/W4210829485","https://openalex.org/W857957734","https://openalex.org/W2071904954"],"abstract_inverted_index":{"We":[0],"introduce":[1],"concurrent":[2,12,56,81],"time-stamping,":[3],"a":[4,80,85,125],"paradigm":[5],"that":[6],"allows":[7,102],"processes":[8],"to":[9,34,94,104],"temporally":[10],"order":[11],"events":[13],"in":[14],"an":[15],"asynchronous":[16],"shared-memory":[17],"system.":[18],"Concurrent":[19],"time-stamp":[20,57,82],"systems":[21,58],"are":[22],"powerful":[23],"tools":[24],"for":[25,32,54],"concurrency":[26],"control,":[27],"serving":[28],"as":[29,38,97],"the":[30,75,90,109,115],"basis":[31],"solutions":[33,93,103],"coordination":[35],"problems":[36,95],"such":[37,96],"mutual":[39],"exclusion,":[40],"$\\ell$-exclusion,":[41],"randomized":[42],"consensus,":[43],"and":[44,114,122,124],"multiwriter":[45,131],"multireader":[46,130],"atomic":[47,132],"registers.":[48,133],"Unfortunately,":[49],"all":[50],"previously":[51],"known":[52],"methods":[53],"implementing":[55],"have":[59],"been":[60],"theoretically":[61],"unsatisfying":[62],"since":[63],"they":[64],"require":[65],"unbounded-size":[66,70],"time-stamps---in":[67],"other":[68],"words,":[69],"memory.":[71],"This":[72],"work":[73],"presents":[74],"first":[76],"bounded":[77],"implementation":[78],"of":[79,89,112,118,129],"system,":[83],"providing":[84],"modular":[86],"unbounded-to-bounded":[87],"transformation":[88],"simple":[91],"unbounded":[92],"those":[98],"mentioned":[99],"above.":[100],"It":[101],"two":[105],"formerly":[106],"open":[107],"problems,":[108],"bounded-probabilistic-consensus":[110],"problem":[111,117],"Abrahamson":[113],"fifo-$\\ell$-exclusion":[116],"Fischer,":[119],"Lynch,":[120],"Burns":[121],"Borodin,":[123],"more":[126],"efficient":[127],"construction":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}
