On the list update problem with advice (Q515679): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+On the List Update Problem with Advice
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6275862
@@ Property / title @@
+On the List Update Problem with Advice (English)
@@ Property / title: On the List Update Problem with Advice (English) / rank @@
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68294
@@ Property / zbMATH Open document ID: 1362.68294 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-04921-2_17
@@ Property / DOI: 10.1007/978-3-319-04921-2_17 / rank @@
+Normal rank
@@ Property / published in @@
+Language and Automata Theory and Applications
@@ Property / published in: Language and Automata Theory and Applications / rank @@
+Normal rank
@@ Property / publication date @@
+March 2014Timestamp +2014-03-31T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2014-03-31T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 31 March 2014 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6275862
@@ Property / zbMATH DE Number: 6275862 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1803135286
@@ Property / OpenAlex ID: W1803135286 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2746357114
@@ Property / OpenAlex ID: W2746357114 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7357
@@ Property / arXiv ID: 1311.7357 / rank @@
+Normal rank
@@ Property / cites work @@
+A competitive analysis of the list update problem with lookahead
+Normal rank
@@ Property / cites work @@
+Improved Randomized On-Line Algorithms for the List Update Problem
+Normal rank
@@ Property / cites work @@
+Average case analyses of list update algorithms, with applications to data compression
+Normal rank
@@ Property / cites work @@
+A combined BIT and TIMESTAMP algorithm for the list update problem
+Normal rank
@@ Property / cites work @@
+Q2753921
@@ Property / cites work: Q2753921 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal lower bounds for projective list update algorithms
+Normal rank
@@ Property / cites work @@
+Online Bin Packing with Advice of Small Size
@@ Property / cites work: Online Bin Packing with Advice of Small Size / rank @@
+Normal rank
@@ Property / cites work @@
+On the competitive theory and practice of online list accessing algorithms
+Normal rank
@@ Property / cites work @@
+A locally adaptive data compression scheme
@@ Property / cites work: A locally adaptive data compression scheme / rank @@
+Normal rank
@@ Property / cites work @@
+Online Coloring of Bipartite Graphs with and without Advice
+Normal rank
@@ Property / cites work @@
+The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the k-Server Problem
@@ Property / cites work: On the Advice Complexity of the k-Server Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of Online Problems
@@ Property / cites work: On the Advice Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2965482
@@ Property / cites work: Q2965482 / rank @@
+Normal rank
@@ Property / cites work @@
+How Much Information about the Future Is Needed?
@@ Property / cites work: How Much Information about the Future Is Needed? / rank @@
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity of Online Coloring for Paths
@@ Property / cites work: Advice Complexity of Online Coloring for Paths / rank @@
+Normal rank
@@ Property / cites work @@
+On Advice Complexity of the k-server Problem under Sparse Metrics
+Normal rank
@@ Property / cites work @@
+Information Complexity of Online Problems
@@ Property / cites work: Information Complexity of Online Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Two results on the list update problem
@@ Property / cites work: Two results on the list update problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Algorithms and Models for List Update
@@ Property / cites work: A Survey of Algorithms and Models for List Update / rank @@
+Normal rank
@@ Property / cites work @@
+Advice Complexity and Barely Random Algorithms
@@ Property / cites work: Advice Complexity and Barely Random Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Off-line algorithms for the list update problem
@@ Property / cites work: Off-line algorithms for the list update problem / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized competitive algorithms for the list update problem
+Normal rank
@@ Property / cites work @@
+On Online Algorithms with Advice for the k-Server Problem
+Normal rank
@@ Property / cites work @@
+Advice Complexity of the Online Coloring Problem
@@ Property / cites work: Advice Complexity of the Online Coloring Problem / rank @@
+Normal rank