Hadas Shachnai
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
- [j64]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Improved Parameterized Algorithms for Network Query Problems. Algorithmica 81(6): 2270-2316 (2019) - [j63]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Flexible Resource Allocation to Interval Jobs. Algorithmica 81(8): 3217-3244 (2019) - [j62]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained submodular maximization via greedy local search. Oper. Res. Lett. 47(1): 1-6 (2019) - [c62]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA 2019: 69:1-69:15 - [i14]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR abs/1907.01745 (2019) - [i13]Ariel Kulik, Hadas Shachnai:
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. CoRR abs/1911.02653 (2019) - 2018
- [j61]Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica 80(2): 576-607 (2018) - [j60]Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3): 895-905 (2018) - [j59]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93: 30-40 (2018) - [j58]Hadas Shachnai, Ariella Voloshin
, Shmuel Zaks:
Flexible bandwidth assignment with application to optical networks. J. Scheduling 21(3): 327-336 (2018) - [c61]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM 2018: 24:1-24:18 - [c60]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA 2018: 343-345 - [p1]Hadas Shachnai, Tami Tamir:
Polynomial Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 125-156 - [i12]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The Preemptive Resource Allocation Problem. CoRR abs/1811.07413 (2018) - 2017
- [j57]Hadas Shachnai, Meirav Zehavi
:
A multivariate framework for weighted FPT algorithms. J. Comput. Syst. Sci. 89: 157-189 (2017) - [j56]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Optimizing bandwidth allocation in elastic optical networks with application to scheduling. J. Discrete Algorithms 45: 1-13 (2017) - [j55]Hadas Shachnai, Meirav Zehavi
:
Parameterized Algorithms for Graph Partitioning Problems. Theory Comput. Syst. 61(3): 721-738 (2017) - [c59]Keren Censor-Hillel, Rina Levy, Hadas Shachnai:
Fast Distributed Approximation for Max-Cut. ALGOSENSORS 2017: 41-56 - [i11]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained Submodular Maximization via Greedy Local Search. CoRR abs/1705.06319 (2017) - [i10]Keren Censor-Hillel, Rina Levy, Hadas Shachnai:
Fast Distributed Approximation for Max-Cut. CoRR abs/1707.08496 (2017) - 2016
- [j54]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
:
Deterministic parameterized algorithms for the Graph Motif problem. Discrete Applied Mathematics 213: 162-178 (2016) - [j53]Hadas Shachnai, Meirav Zehavi
:
Representative families: A unified tradeoff-based approach. J. Comput. Syst. Sci. 82(3): 488-502 (2016) - [j52]Ron Adany, Moran Feldman
, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir:
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms 12(3): 38:1-38:25 (2016) - [j51]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom
, Shmuel Zaks:
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621: 22-36 (2016) - [j50]Michael R. Fellows, Danny Hermelin
, Frances A. Rosamond, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. TOCT 8(2): 6:1-6:12 (2016) - [c58]Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-Time k-bounded Preemptive Scheduling. ALENEX 2016: 127-137 - [c57]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. SPAA 2016: 225-226 - [i9]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Flexible Resource Allocation for Clouds and All-Optical Networks. CoRR abs/1605.04982 (2016) - 2015
- [j49]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
:
Partial Information Network Queries. J. Discrete Algorithms 31: 129-145 (2015) - [j48]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-time scheduling to minimize machine busy times. J. Scheduling 18(6): 561-573 (2015) - [c56]Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf:
The Container Selection Problem. APPROX-RANDOM 2015: 416-434 - [c55]Hadas Shachnai, Meirav Zehavi
:
A Multivariate Approach for Weighted FPT Algorithms. ESA 2015: 965-976 - [i8]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW 2015: 201-204 - [i7]Ariel Kulik, Hadas Shachnai, Gal Tamir:
On Lagrangian Relaxation and Reoptimization Problems. CoRR abs/1512.06736 (2015) - 2014
- [j47]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir:
Packing resizable items with application to video delivery over wireless networks. Theor. Comput. Sci. 553: 91-105 (2014) - [c54]Hadas Shachnai, Meirav Zehavi
:
Representative Families: A Unified Tradeoff-Based Approach. ESA 2014: 786-797 - [c53]Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir:
Scheduling jobs with dwindling resource requirements in clouds. INFOCOM 2014: 601-609 - [c52]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling. IPDPS 2014: 862-871 - [c51]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
:
Improved Parameterized Algorithms for Network Query Problems. IPEC 2014: 294-306 - [c50]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi
:
Deterministic Parameterized Algorithms for the Graph Motif Problem. MFCS (2) 2014: 589-600 - [c49]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). MFCS (2) 2014: 613-624 - [c48]Hadas Shachnai, Meirav Zehavi
:
Parameterized Algorithms for Graph Partitioning Problems. WG 2014: 384-395 - [i6]Hadas Shachnai, Meirav Zehavi:
Faster Computation of Representative Families for Uniform Matroids with Applications. CoRR abs/1402.3547 (2014) - [i5]Hadas Shachnai, Meirav Zehavi:
Parameterized Algorithms for Graph Partitioning Problems. CoRR abs/1403.0099 (2014) - [i4]Dor Arad, Yael Mordechai, Hadas Shachnai:
Tighter Bounds for Makespan Minimization on Unrelated Machines. CoRR abs/1405.2530 (2014) - [i3]Hadas Shachnai, Meirav Zehavi:
FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted. CoRR abs/1407.2033 (2014) - 2013
- [j46]Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai:
Online selection of intervals and t-intervals. Inf. Comput. 233: 1-11 (2013) - [j45]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. 38(4): 729-739 (2013) - [j44]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Corrigendum: Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 9(4): 34:1-34:7 (2013) - [c47]Michael R. Fellows
, Danny Hermelin
, Frances A. Rosamond
, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA 2013: 457-468 - [c46]Ron Adany, Moran Feldman
, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir:
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO 2013: 13-24 - [c45]Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. IPCO 2013: 290-301 - 2012
- [j43]Hadas Shachnai, Tami Tamir:
Approximation schemes for generalized two-dimensional vector packing with application to data placement. J. Discrete Algorithms 10: 35-48 (2012) - [j42]Keren Censor-Hillel, Hadas Shachnai:
Fast Information Spreading in Graphs with Large Weak Conductance. SIAM J. Comput. 41(6): 1451-1465 (2012) - [j41]Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal cost reconfiguration of data placement in a storage area network. Theor. Comput. Sci. 460: 42-53 (2012) - [c44]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir:
Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS 2012: 6-17 - [c43]Michael R. Fellows
, Ariel Kulik, Frances A. Rosamond
, Hadas Shachnai:
Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) 2012: 351-362 - [c42]Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. LATIN 2012: 618-630 - 2011
- [j40]Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh:
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Theor. Comput. Sci. 412(52): 7087-7098 (2011) - [c41]Keren Censor-Hillel, Hadas Shachnai:
Fast Information Spreading in Graphs with Large Weak Conductance. SODA 2011: 440-448 - [i2]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints. CoRR abs/1101.2940 (2011) - [i1]Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young:
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Dagstuhl Reports 1(2): 67-93 (2011) - 2010
- [j39]Hagit Attiya
, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010) - [j38]Ariel Kulik, Hadas Shachnai:
There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. 110(16): 707-710 (2010) - [j37]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40-42): 3553-3562 (2010) - [c40]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180 - [c39]Magnús M. Halldórsson, Hadas Shachnai:
Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. FUN 2010: 237-248 - [c38]Keren Censor-Hillel, Hadas Shachnai:
Partial information spreading with application to distributed maximum coverage. PODC 2010: 161-170 - [c37]Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai:
Online Selection of Intervals and t-Intervals. SWAT 2010: 383-394
2000 – 2009
- 2009
- [j36]Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai:
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica 55(4): 643-665 (2009) - [j35]Hadas Shachnai, Lisa Zhang, Tomomi Matsui
:
A note on generalized rank aggregation. Inf. Process. Lett. 109(13): 647-651 (2009) - [j34]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms 5(2): 18:1-18:17 (2009) - [j33]Jirí Sgall
, Hadas Shachnai, Tami Tamir:
Periodic scheduling with obligatory vacations. Theor. Comput. Sci. 410(47-49): 5112-5121 (2009) - [c36]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS 2009: 1-12 - [c35]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Maximizing submodular set functions subject to multiple linear constraints. SODA 2009: 545-554 - [c34]Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal Cost Reconfiguration of Data Placement in Storage Area Network. WAOA 2009: 229-241 - 2008
- [j32]Hadas Shachnai, Tami Tamir, Omer Yehezkely:
Approximation Schemes for Packing with Item Fragmentation. Theory Comput. Syst. 43(1): 81-98 (2008) - [j31]Hadas Shachnai, Lisa Zhang, Tomomi Matsui
:
Exact algorithms for the master ring problem. Networks 52(2): 98-107 (2008) - [j30]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms 4(1): 11:1-11:20 (2008) - [c33]Magnús M. Halldórsson, Hadas Shachnai:
Batch Coloring Flat Graphs and Thin. SWAT 2008: 198-209 - [c32]Ariel Kulik, Hadas Shachnai:
On Lagrangian Relaxation and Subset Selection Problems. WAOA 2008: 160-173 - 2007
- [j29]Joseph Naor, Hadas Shachnai, Tami Tamir:
Real-Time Scheduling with a Budget. Algorithmica 47(3): 343-364 (2007) - [c31]Hadas Shachnai, Omer Yehezkely:
Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs. FCT 2007: 482-493 - [r1]Hadas Shachnai, Tami Tamir:
Polynomial-Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j28]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling Split Intervals. SIAM J. Comput. 36(1): 1-15 (2006) - [j27]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 2(1): 116-129 (2006) - [c30]Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai:
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. APPROX-RANDOM 2006: 116-127 - [c29]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315 - 2005
- [j26]Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42(3-4): 309-334 (2005) - [c28]Jirí Sgall, Hadas Shachnai, Tami Tamir:
Fairness-Free Periodic Scheduling with Vacations. ESA 2005: 592-603 - [c27]Hadas Shachnai, Tami Tamir, Omer Yehezkely:
Approximation Schemes for Packing with Item Fragmentation. WAOA 2005: 334-347 - 2004
- [j25]Hagit Attiya
, Hadas Shachnai:
Tight bounds for FEC-based reliable multicast. Inf. Comput. 190(2): 117-135 (2004) - [j24]Alexander Gaysinsky, Alon Itai, Hadas Shachnai:
Strongly competitive algorithms for caching with pipelined prefetching. Inf. Process. Lett. 91(1): 19-27 (2004) - [j23]Hadas Shachnai, Aravind Srinivasan:
Finding Large Independent Sets in Graphs and Hypergraphs. SIAM J. Discrete Math. 18(3): 488-500 (2004) - [j22]Hadas Shachnai, Tami Tamir:
Tight bounds for online class-constrained packing. Theor. Comput. Sci. 321(1): 103-123 (2004) - [c26]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved Results for Data Migration and Open Shop Scheduling. ICALP 2004: 658-669 - [c25]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. WAOA 2004: 68-82 - [c24]Hadas Shachnai, Oded Shmueli, Robert Sayegh:
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. WAOA 2004: 111-125 - 2003
- [j21]Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. Algorithmica 37(3): 187-209 (2003) - [j20]Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003) - [j19]Prabhakar Raghavan
, Hadas Shachnai, Mira Yaniv:
Dynamic schemes for speculative execution of code. Perform. Eval. 53(2): 125-142 (2003) - [c23]Joseph Naor, Hadas Shachnai, Tami Tamir:
Real-Time Scheduling with a Budget. ICALP 2003: 1123-1137 - [c22]Hadas Shachnai, Tami Tamir:
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. RANDOM-APPROX 2003: 165-177 - 2002
- [j18]Hadas Shachnai, Tami Tamir:
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica 32(4): 651-678 (2002) - [j17]Alon Itai, Michael Rodeh, Hadas Shachnai:
The passport control problem or how to keep a dynamic service system load balanced? Theor. Comput. Sci. 282(2): 303-318 (2002) - [c21]Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. ESA 2002: 859-871 - [c20]Hadas Shachnai, Tami Tamir:
Tight Bounds for Online Class-Constrained Packing. LATIN 2002: 569-583 - [c19]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling split intervals. SODA 2002: 732-741 - [c18]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. SODA 2002: 742-751 - 2001
- [j16]Hadas Shachnai, Tami Tamir:
On Two Class-Constrained Versions of the Multiple Knapsack Problem. Algorithmica 29(3): 442-467 (2001) - [j15]Micha Hofri, Hadas Shachnai:
Efficient Reorganization of Binary Search Trees. Algorithmica 31(3): 378-402 (2001) - [j14]Eli Almog, Hadas Shachnai:
Scheduling memory accesses through a shared bus. Perform. Eval. 46(2-3): 193-218 (2001) - [c17]Alexander Gaysinsky, Alon Itai, Hadas Shachnai:
Strongly Competitive Algorithms for Caching with Pipelined Prefetching. ESA 2001: 49-61 - [c16]Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Minimizing Average Completion of Dedicated Tasks and Interval Graphs. RANDOM-APPROX 2001: 114-126 - [c15]Hadas Shachnai, Aravind Srinivasan:
Finding large independent sets of hypergraphs in parallel. SPAA 2001: 163-168 - 2000
- [j13]Erol Gelenbe
, Hadas Shachnai:
On G-networks and resource allocation in multimedia systems. European Journal of Operational Research 126(2): 308-318 (2000) - [j12]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multicoloring of Graphs. J. Algorithms 37(2): 422-450 (2000) - [c14]Hadas Shachnai, Tami Tamir:
Polynominal time approximation schemes for class-constrained packing problem. APPROX 2000: 238-249
1990 – 1999
- 1999
- [j11]Hadas Shachnai, John Turek:
Multiresource Malleable Task Scheduling to Minimize Response Time. Inf. Process. Lett. 70(1): 47 (1999) - [j10]Hagit Attiya, Hadas Shachnai, Tami Tamir:
Local Labeling and Resource Allocation Using Preprocessing. SIAM J. Comput. 28(4): 1397-1414 (1999) - [c13]Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multi-coloring Trees. COCOON 1999: 271-280 - [c12]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multi-coloring of Graphs. ESA 1999: 390-401 - [c11]Yuval Hershko, Daniel Segal, Hadas Shachnai:
Self-Tuning Synchronization Mechanisms in Network Operating Systems. SIGMETRICS 1999: 224-225 - 1998
- [j9]Hadas Shachnai, Micha Hofri:
The List Update Problem: Improved Bounds for the Counter Scheme. Algorithmica 22(4): 650-659 (1998) - [j8]