New bounds for randomized busing (Q1770380): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buses for anonymous message delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Walks on Regular and Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic defense against traffic analysis / rank
 
Normal rank

Latest revision as of 20:15, 7 June 2024

scientific article
Language Label Description Also known as
English
New bounds for randomized busing
scientific article

    Statements

    New bounds for randomized busing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    0 references
    Anonymous communication
    0 references
    Randomized busing
    0 references
    Random walk
    0 references
    Hitting time
    0 references
    Complete graph
    0 references
    \(r\)-partite directed collar
    0 references
    0 references