Amanote Research

Amanote Research

    RegisterSign In

Trie Size in a Dynamic List Structure

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-56610-4_100
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1993

Authors
G. Louchard
Publisher

Springer Berlin Heidelberg


Related search

A Multibit Trie Structure Designed for Peer-To-Peer (P2P) Live Video Streaming

English

Dynamic Incentives in Wait List Mechanisms

AEA Papers and Proceedings
2018English

Dynamic List of Clusters in Secondary Memory

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

List Size and Quality of Practice

BMJ
1986English

Towards a Software Product Line of Trie-Based Collections

2016English

Map Updates in a Dynamic Voronoi Data Structure

2012English

Constant-Size Dynamic K-Taa

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

The Development of Size Structure in a youngFucus Serratuspopulation

European Journal of Phycology
Plant ScienceAquatic Science
1996English

Dynamic Finite-Size Scaling After a Quench at Quantum Transitions

Physical review. E
Nonlinear PhysicsProbabilityStatisticsCondensed Matter PhysicsStatistical
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy