English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We recall the occupancy problem introduced by Konheim & Weiss in 1966 and weconsider parking functions as hash maps. Each car $c_i$ prefers parking space$p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an indexinto an array), if $p_i$ is occupied then $c_i$ the next available parkingspace (the hash table implementation using an open addressing strategy). Thispaper considers some others hash table implementations like hash tables withlinked lists (with parking functions as hash maps). Using the Species Theory,we enumerate by Lagrange inversion those hash tables structures via a bijectionwith tree-like structures. This bijection provides a generalization of theFoata-Riordan bijection between parking functions and (forests of) rootedtrees. Finally we show the number of hash tables with linked lists on a set ofkeys of cardinality $n$ is $n!C_n$, so the number of labeled binary trees with$n$ nodes.

Bijection: Parking-like structures and Tree-like structures