Publication:1331949

DOI10.1016/0304-3975(94)90158-9zbMATH Open0834.68042OpenAlexW2010671846MaRDI QIDQ1331949FDOQ1331949

Noga Alon, Gil Kalai, Larry J. Stockmeyer, Moty Ricklin

Publication date: 29 August 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90158-9

zbMATH Keywords

distributed algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Eigenvalues and expanders
• Inequalities in Fourier analysis
• Ramanujan graphs
• Complexity of network synchronization
• Optimal numberings and isoperimetric problems on graphs
• Graph spanners
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Online tracking of mobile users
• The Token Distribution Problem

Cited In (9)

• Distributed Corruption Detection in Networks
• Optimal nearest neighbor queries in sensor networks
• Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
• Randomly colouring graphs (a combinatorial view)
• Load balanced distributed directories
• An analysis framework for distributed hierarchical directories
• Distributed transactional memory for general networks
• Fourier analysis and large independent sets in powers of complete graphs
• Bounds on Distance Distributions in Codes of Given Size

This page was built for publication: Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331949)