scientific article

zbMATH Open1034.68012MaRDI QIDQ3153939

Jan Villemson

Publication date: 10 November 2002

Title of this publication is not available (Why is that?)

zbMATH Keywords

time-stamping

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (3)

The space complexity of long-lived and one-shot timestamp implementations ⋮ A New Timestamping Scheme Based on Skip Lists ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The space complexity of unbounded timestamps 👍 👎
• Efficient indexing of interval time sequences 👍 👎
• Bounded time-stamps 👍 👎
• Self-stabilizing timestamps 👍 👎
• The Space Complexity of Unbounded Timestamps 👍 👎
• Effectiveness of Delaying Timestamp Computation 👍 👎

This page was built for publication:

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