{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T02:47:15Z","timestamp":1777690035716,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90158-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"175-201","source":"Crossref","is-referenced-by-count":22,"title":["Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling"],"prefix":"10.1016","volume":"130","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil","family":"Kalai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moty","family":"Ricklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Stockmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90158-9_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","article-title":"Eigenvalues and expanders","volume":"6","author":"Alon","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(94)90158-9_BIB2","series-title":"The Probabilistic Method","author":"Alon","year":"1991"},{"key":"10.1016\/0304-3975(94)90158-9_BIB3","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","article-title":"Complexity of network synchronization","volume":"32","author":"Awerbuch","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90158-9_BIB4","first-page":"571","article-title":"Competitive distributed job scheduling","author":"Awerbuch","year":"1992","journal-title":"Proc. 24th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90158-9_BIB5","series-title":"Technical Memo TM-410","article-title":"Online tracking of mobile users","author":"Awerbuch","year":"1989"},{"key":"10.1016\/0304-3975(94)90158-9_BIB6","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/FSCS.1990.89571","article-title":"Sparse partitions","author":"Awerbuch","year":"1990","journal-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90158-9_BIB7","first-page":"39","article-title":"Competitive algorithms for distributed data management","author":"Bartal","year":"1992","journal-title":"Proc. 24th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90158-9_BIB8","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/SFCS.1992.267756","article-title":"The distributed k-server problem \u2014 a competitive distributed translator for k-server algorithms","author":"Bartal","year":"1992","journal-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90158-9_BIB9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/1970980","article-title":"Inequalities in Fourier analysis","volume":"102","author":"Beckner","year":"1975","journal-title":"Ann. of Math."},{"key":"10.1016\/0304-3975(94)90158-9_BIB10","first-page":"379","article-title":"On the power of randomization in online algorithms","author":"Ben-David","year":"1990","journal-title":"Proc. 22nd ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90158-9_BIB11","series-title":"Extremal Graph Theory","first-page":"107","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0304-3975(94)90158-9_BIB12","first-page":"587","article-title":"On the second eigenvalue in random regular graphs","author":"Friedman","year":"1989","journal-title":"Proc. 21st ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90158-9_BIB13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","article-title":"Optimal numberings and isoperimetric problems on graphs","volume":"1","author":"Harper","year":"1966","journal-title":"J. Combin. Th."},{"key":"10.1016\/0304-3975(94)90158-9_BIB14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/SFCS.1988.21923","article-title":"The influence of variables on Boolean functions","author":"Kahn","year":"1988","journal-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90158-9_BIB15_1","first-page":"240","article-title":"Explicit expanders and the Ramanujan conjectures","author":"Lubotzky","year":"1986","journal-title":"Proc. 18th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90158-9_BIB15_2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","article-title":"Ramanujan graphs","volume":"8","author":"Lubotzky","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(94)90158-9_BIB16_1","first-page":"51","article-title":"Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators","volume":"24","author":"Margulis","year":"1988","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0304-3975(94)90158-9_BIB16_2","first-page":"39","volume":"24","author":"Margulis","year":"1988","journal-title":"Problems of Inform. Transmission"},{"key":"10.1016\/0304-3975(94)90158-9_BIB17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190130114","article-title":"Graph spanners","volume":"13","author":"Peleg","year":"1989","journal-title":"J. Graph Th."},{"key":"10.1016\/0304-3975(94)90158-9_BIB18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0218015","article-title":"The token distribution problem","volume":"18","author":"Peleg","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90158-9_BIB19","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)90158-9_BIB20","first-page":"222","article-title":"Probabilistic computation: toward a unified measure of complexity","author":"Yao","year":"1977","journal-title":"Proc. 18th IEEE Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901589?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901589?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:16:52Z","timestamp":1580901412000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594901589"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90158-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}