Wear Leveling Revisited (Englisch)
Freier Zugriff
- Neue Suche nach: Onodera, Taku
- Neue Suche nach: Shibuya, Tetsuo
- Neue Suche nach: Onodera, Taku
- Neue Suche nach: Shibuya, Tetsuo
- Neue Suche nach: Cao, Yixin
- Weitere Informationen zu Cao, Yixin:
- https://orcid.org/0000-0002-6927-438X
- Neue Suche nach: Cheng, Siu-Wing
- Weitere Informationen zu Cheng, Siu-Wing:
- https://orcid.org/0000-0002-3557-9935
- Neue Suche nach: Li, Minming
- Weitere Informationen zu Li, Minming:
- https://orcid.org/0000-0002-7370-6237
In:
LIPIcs, Volume 181, ISAAC 2020
: 31st International Symposium on Algorithms and Computation (ISAAC 2020)
;
181
;
65:1-65:17
;
2020
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Wear Leveling Revisited
-
Beteiligte:Onodera, Taku ( Autor:in ) / Shibuya, Tetsuo ( Autor:in ) / Cao, Yixin ( Herausgeber:in ) / Cheng, Siu-Wing ( Herausgeber:in ) / Li, Minming ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 181, ISAAC 2020 : 31st International Symposium on Algorithms and Computation (ISAAC 2020) ; 181 ; 65:1-65:17Leibniz International Proceedings in Informatics (LIPIcs) ; 181 ; 65:1-65:17
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:04.12.2020
-
Format / Umfang:17 pages , 569704 byte
-
Anmerkungen:LIPIcs, Vol. 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020), pages 65:1-65:17
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
How to Decompose a Graph into a Tree-Like Structure (Invited Talk)Oum, Sang-il et al. | 2020
- 2
-
Worst-Case Optimal Join Algorithms (Invited Talk)Yi, Ke et al. | 2020
- 3
-
(In)approximability of Maximum Minimal FVSDublois, Louis / Hanaka, Tesshu / Khosravian Ghadikolaei, Mehdi / Lampis, Michael / Melissinos, Nikolaos et al. | 2020
- 4
-
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence ProblemAgrawal, Anadi / Gawrychowski, Paweł et al. | 2020
- 5
-
A Unified Framework of FPT Approximation Algorithms for Clustering ProblemsFeng, Qilong / Zhang, Zhen / Huang, Ziyun / Xu, Jinhui / Wang, Jianxin et al. | 2020
- 6
-
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence LengthSakai, Yoshifumi / Inenaga, Shunsuke et al. | 2020
- 7
-
Algorithms and Complexity for Geodetic Sets on Planar and Chordal GraphsChakraborty, Dibyayan / Das, Sandip / Foucaud, Florent / Gahlawat, Harmender / Lajou, Dimitri / Roy, Bodhayan et al. | 2020
- 8
-
An SPQR-Tree-Like Embedding Representation for Level PlanarityBrückner, Guido / Rutter, Ignaz et al. | 2020
- 9
-
Approximating the Packedness of Polygonal CurvesGudmundsson, Joachim / Sha, Yuan / Wong, Sampson et al. | 2020
- 10
-
Approximation Algorithms for Generalized Path SchedulingPang, Haozhou / Salavatipour, Mohammad R. et al. | 2020
- 11
-
Approximations for Throughput MaximizationHyatt-Denesik, Dylan / Rahgoshay, Mirmahdi / Salavatipour, Mohammad R. et al. | 2020
- 12
-
Arithmetic Expression ConstructionAlcock, Leo / Asif, Sualeh / Bosboom, Jeffrey / Brunner, Josh / Chen, Charlotte / Demaine, Erik D. / Epstein, Rogers / Hesterberg, Adam / Hirschfeld, Lior / Hu, William et al. | 2020
- 13
-
Between Shapes, Using the Hausdorff Distancevan Kreveld, Marc / Miltzow, Tillmann / Ophelders, Tim / Sonke, Willem / Vermeulen, Jordi L. et al. | 2020
- 14
-
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with CostsNguyen, Trung Thanh / Rothe, Jörg et al. | 2020
- 15
-
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of CutsAsano, Takao / Umeda, Hiroyuki et al. | 2020
- 16
-
Compact Routing in Unit Disk GraphsMulzer, Wolfgang / Willert, Max et al. | 2020
- 17
-
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is HardBrunner, Josh / Demaine, Erik D. / Hendrickson, Dylan / Wellman, Julian et al. | 2020
- 18
-
Complexity of Scheduling Few Types of Jobs on Related and Unrelated MachinesKoutecký, Martin / Zink, Johannes et al. | 2020
- 19
-
Complexity of StabilityFrei, Fabian / Hemaspaandra, Edith / Rothe, Jörg et al. | 2020
- 20
-
Computing Dense and Sparse Subgraphs of Weakly Closed GraphsKoana, Tomohiro / Komusiewicz, Christian / Sommer, Frank et al. | 2020
- 21
-
Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location ProblemKim, Kangsan / Shin, Yongho / An, Hyung-Chan et al. | 2020
- 22
-
Contracting to a Longest Path in H-Free GraphsKern, Walter / Paulusma, Daniël et al. | 2020
- 23
-
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in GraphsDudek, Bartłomiej / Gawrychowski, Paweł et al. | 2020
- 24
-
Discriminating Codes in Geometric SetupsDey, Sanjana / Foucaud, Florent / Nandy, Subhas C. / Sen, Arunabha et al. | 2020
- 25
-
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct TreesHe, Meng / Munro, J. Ian / Nekrich, Yakov / Wild, Sebastian / Wu, Kaiyu et al. | 2020
- 26
-
Diverse Pairs of MatchingsFomin, Fedor V. / Golovach, Petr A. / Jaffke, Lars / Philip, Geevarghese / Sagunov, Danil et al. | 2020
- 27
-
Efficient Labeling for Reachability in Directed Acyclic GraphsDulęba, Maciej / Gawrychowski, Paweł / Janczewski, Wojciech et al. | 2020
- 28
-
Efficiently Computing All Delaunay Triangles Occurring over All Contiguous SubsequencesFunke, Stefan / Weitbrecht, Felix et al. | 2020
- 29
-
Enumerating Range ModesSumigawa, Kentaro / Chakraborty, Sankardeep / Sadakane, Kunihiko / Satti, Srinivasa Rao et al. | 2020
- 30
-
Finding Temporal Paths Under Waiting Time ConstraintsCasteigts, Arnaud / Himmel, Anne-Sophie / Molter, Hendrik / Zschoche, Philipp et al. | 2020
- 31
-
Flexible List Colorings in Graphs with Special Degeneracy ConditionsBradshaw, Peter / Masařk, Tomáš / Stacho, Ladislav et al. | 2020
- 32
-
Geometric Pattern Matching Reduces to k-SUMAronov, Boris / Cardinal, Jean et al. | 2020
- 33
-
Gourds: A Sliding-Block Puzzle with TurningHamersma, Joep / van Kreveld, Marc / Uno, Yushi / van der Zanden, Tom C. et al. | 2020
- 34
-
Improved FPT Algorithms for Deletion to Forest-Like StructuresGowda, Kishen N. / Lonkar, Aditya / Panolan, Fahad / Patel, Vraj / Saurabh, Saket et al. | 2020
- 35
-
Indexing Isodirectional Pointer SequencesKim, Sung-Hwan / Cho, Hwan-Gue et al. | 2020
- 36
-
Length-Bounded Cuts: Proper Interval Graphs and Structural ParametersBentert, Matthias / Heeger, Klaus / Knop, Dušan et al. | 2020
- 37
-
Linear Transformations Between Dominating Sets in the TAR-ModelBousquet, Nicolas / Joffard, Alice / Ouvrard, Paul et al. | 2020
- 38
-
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related ProblemsGeorgiadis, Loukas / Kosinas, Evangelos et al. | 2020
- 39
-
Market Pricing for Matroid Rank ValuationsBérczi, Kristóf / Kakimura, Naonori / Kobayashi, Yusuke et al. | 2020
- 40
-
Minimization and Parameterized Variants of Vertex Partition Problems on GraphsTamura, Yuma / Ito, Takehiro / Zhou, Xiao et al. | 2020
- 41
-
Multicommodity Flows in Planar Graphs with Demands on FacesKumar, Nikhil et al. | 2020
- 42
-
Multiparty SelectionChen, Ke / Dumitrescu, Adrian et al. | 2020
- 43
-
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal GraphsFluschnik, Till / Niedermeier, Rolf / Schubert, Carsten / Zschoche, Philipp et al. | 2020
- 44
-
On Girth and the Parameterized Complexity of Token Sliding and Token JumpingBartier, Valentin / Bousquet, Nicolas / Dallard, Clément / Lomer, Kyle / Mouawad, Amer E. et al. | 2020
- 45
-
Online Primal-Dual Algorithms with Configuration Linear ProgramsThắng, Nguyễn Kim et al. | 2020
- 46
-
Partial Function Extension with Applications to Learning and Property TestingBhaskar, Umang / Kumar, Gunjan et al. | 2020
- 47
-
Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the DimensionChia, Nai-Hui / Gilyén, András / Lin, Han-Hsuan / Lloyd, Seth / Tang, Ewin / Wang, Chunhao et al. | 2020
- 48
-
Random Access in Persistent StringsBille, Philip / Gørtz, Inge Li et al. | 2020
- 49
-
Recency Queries with Succinct RepresentationHolland, William L. / Wirth, Anthony / Zobel, Justin et al. | 2020
- 50
-
Recursed Is Not Recursive: A Jarring ResultDemaine, Erik D. / Kopinsky, Justin / Lynch, Jayson et al. | 2020
- 51
-
Shared vs Private Randomness in Distributed Interactive ProofsMontealegre, Pedro / Ramírez-Romero, Diego / Rapaport, Ivan et al. | 2020
- 52
-
Shortest-Path Queries in Geometric NetworksOh, Eunjin et al. | 2020
- 53
-
Signal Passing Self-Assembly Simulates Tile AutomataCantu, Angel A. / Luchsinger, Austin / Schweller, Robert / Wylie, Tim et al. | 2020
- 54
-
Size, Depth and Energy of Threshold Circuits Computing Parity FunctionUchizawa, Kei et al. | 2020
- 55
-
Sorting by Prefix Block-InterchangesLabarre, Anthony et al. | 2020
- 56
-
Space Hardness of Solving Structured Linear SystemsHuang, Xuangui et al. | 2020
- 57
-
Sparse Hop Spanners for Unit Disk GraphsDumitrescu, Adrian / Ghosh, Anirban / Tóth, Csaba D. et al. | 2020
- 58
-
Sparsification Lower Bounds for List H-ColoringChen, Hubie / Jansen, Bart M. P. / Okrasa, Karolina / Pieterse, Astrid / Rzążewski, Paweł et al. | 2020
- 59
-
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored GraphsBellitto, Thomas / Li, Shaohua / Okrasa, Karolina / Pilipczuk, Marcin / Sorge, Manuel et al. | 2020
- 60
-
The Online Broadcast Range-Assignment Problemde Berg, Mark / Markovic, Aleksandar / Umboh, Seeun William et al. | 2020
- 61
-
The k-Server Problem with Delays on the Uniform Metric SpaceKrnetić, Predrag / Melnyk, Darya / Wang, Yuyi / Wattenhofer, Roger et al. | 2020
- 62
-
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex DeletionAhn, Jungho / Kim, Eun Jung / Lee, Euiwoong et al. | 2020
- 63
-
Update Query Time Trade-Off for Dynamic Suffix ArraysAmir, Amihood / Boneh, Itai et al. | 2020
- 64
-
Weakly Submodular Function Maximization Using Local Submodularity RatioSantiago, Richard / Yoshida, Yuichi et al. | 2020
- 65
-
Wear Leveling RevisitedOnodera, Taku / Shibuya, Tetsuo et al. | 2020