BUDGE
发表于 2025-3-27 00:40:24
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures,ithms inspire compressed encodings or data structures. In particular, we describe the relation between searching in an ordered array and encoding integers; merging sets and encoding a sequence of symbols; and sorting and compressing permutations.
Myosin
发表于 2025-3-27 02:11:05
,A Survey of the Game “Lights Out!”,tch all lights off. The game can be generalized to arbitrary graphs instead of a grid. . has been studied independently by three different communities, graph theoreticians, gamers, and algorithmicists. In this paper, we survey the game and present the results in a unified framework.
擦试不掉
发表于 2025-3-27 07:34:05
http://reply.papertrans.cn/88/8733/873221/873221_33.png
calorie
发表于 2025-3-27 11:29:20
A Survey of Algorithms and Models for List Update,e assumptions, and several models have been proposed to capture locality of input sequences. This survey gives a brief overview of the main list update algorithms, the main alternative cost models, and the related results for list update with locality of reference. Open problems and directions for future work are included.
嬉耍
发表于 2025-3-27 17:30:50
http://reply.papertrans.cn/88/8733/873221/873221_35.png
Coordinate
发表于 2025-3-27 18:44:08
http://reply.papertrans.cn/88/8733/873221/873221_36.png
歪曲道理
发表于 2025-3-28 01:41:58
http://reply.papertrans.cn/88/8733/873221/873221_37.png
谷物
发表于 2025-3-28 02:39:12
http://reply.papertrans.cn/88/8733/873221/873221_38.png
ANTH
发表于 2025-3-28 09:38:05
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures,gorithms in the comparison or external memory models. We describe a few cases which illustrate this relation in a distinct direction, where fast algorithms inspire compressed encodings or data structures. In particular, we describe the relation between searching in an ordered array and encoding inte
并置
发表于 2025-3-28 14:11:52
Computing (and Life) Is All about Tradeoffs, Munro’s papers (e.g. in data structures, streaming algorithms). In one form or another, time space tradeoffs can be found in many settings. Another traditional research area concerns tradeoffs between performance (e.g. approximation bounds) vs complexity bounds. Newer areas of research consider var