Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Berman
Person information
- affiliation: Pennsylvania State University, University Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c95]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache:
Testing Connectedness of Images. APPROX/RANDOM 2023: 66:1-66:15- 2022
- [j52]Piotr Berman
, Meiram Murzabulatov, Sofya Raskhodnikova:
Tolerant Testers of Image Properties. ACM Trans. Algorithms 18(4): 37:1-37:39 (2022)
2010 – 2019
- 2019
- [j51]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
The Power and Limitations of Uniform Samples in Testing Properties of Figures. Algorithmica 81(3): 1247-1266 (2019) - [j50]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Testing convexity of figures under the uniform distribution. Random Struct. Algorithms 54(3): 413-443 (2019) - 2016
- [c94]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Testing Convexity of Figures Under the Uniform Distribution. SoCG 2016: 17:1-17:15 - [c93]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
The Power and Limitations of Uniform Samples in Testing Properties of Figures. FSTTCS 2016: 45:1-45:14 - [c92]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Tolerant Testers of Image Properties. ICALP 2016: 90:1-90:14 - 2015
- [i31]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Constant-Time Testing and Learning of Image Properties. CoRR abs/1503.01363 (2015) - [i30]Piotr Berman, Junichiro Fukuyama:
The Distributed Selection Problem and the AKS Sorting Network. CoRR abs/1511.00715 (2015) - 2014
- [j49]Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On the Computational Complexity of Measuring Global Stability of Banking Networks. Algorithmica 70(4): 595-647 (2014) - [j48]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner transitive-closure spanners of low-dimensional posets. Comb. 34(3): 255-277 (2014) - [j47]Piotr Berman, Sofya Raskhodnikova:
Approximation Algorithms for Min-Max Generalization Problems. ACM Trans. Algorithms 11(1): 5:1-5:23 (2014) - [j46]Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam:
HybridPlan: a capacity planning technique for projecting storage requirements in hybrid storage systems. J. Supercomput. 67(1): 277-303 (2014) - [c91]Piotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Lp-testing. STOC 2014: 164-173 - 2013
- [j45]Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Approximation algorithms for spanner problems and Directed Steiner Forest. Inf. Comput. 222: 93-107 (2013) - 2012
- [j44]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Algorithmica 64(2): 295-310 (2012) - [c90]Piotr Berman, Grigory Yaroslavtsev:
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs. APPROX-RANDOM 2012: 50-60 - [c89]Orhan Kislal, Piotr Berman, Mahmut T. Kandemir:
Improving the performance of k-means clustering through computation skipping and data locality optimizations. Conf. Computing Frontiers 2012: 273-276 - 2011
- [j43]Guiling Wang, Mary Jane Irwin, Haoying Fu, Piotr Berman, Wensheng Zhang, Tom La Porta:
Optimizing sensor movement planning for energy efficiency. ACM Trans. Sens. Networks 7(4): 33:1-33:17 (2011) - [c88]Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam:
O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74 - [c87]Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Improved Approximation for the Directed Spanner Problem. ICALP (1) 2011: 1-12 - [c86]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner Transitive-Closure Spanners of Low-Dimensional Posets. ICALP (1) 2011: 760-772 - [c85]Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam:
HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs. MASCOTS 2011: 227-236 - [i29]Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On Approximating Four Covering and Packing Problems. CoRR abs/1102.1006 (2011) - [i28]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems Via Randomized Winnowing. CoRR abs/1102.4005 (2011) - [i27]Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On Systemic Stability of Banking Networks. CoRR abs/1110.3546 (2011) - 2010
- [c84]Piotr Berman, Sofya Raskhodnikova:
Approximation Algorithms for Min-Max Generalization Problems. APPROX-RANDOM 2010: 53-66 - [c83]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. COCOON 2010: 226-234 - [c82]Piotr Berman, Sofya Raskhodnikova, Ge Ruan:
Finding Sparser Directed Spanners. FSTTCS 2010: 424-435 - [c81]Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky:
Efficient Alignments of Metabolic Networks with Bounded Treewidth. ICDM Workshops 2010: 687-694 - [c80]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2. ISAAC (1) 2010: 15-24 - [c79]Piotr Berman:
Successes and Failures of Elegant Algorithms in Computational Biology. ISBRA 2010: 2 - [i26]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner Transitive-Closure Spanners of d-Dimensional Posets. CoRR abs/1011.6100 (2010)
2000 – 2009
- 2009
- [j42]Piotr Berman, Jieun K. Jeong:
Consistent Sets of Secondary Structures in Proteins. Algorithmica 53(1): 16-34 (2009) - [j41]Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On approximating four covering and packing problems. J. Comput. Syst. Sci. 75(5): 287-302 (2009) - [c78]Minmei Hou, Cathy Riemer, Piotr Berman, Ross C. Hardison, Webb Miller:
Aligning Two Genomic Sequences That Contain Duplications. RECOMB-CG 2009: 98-110 - [c77]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitive Reductions for Directed Networks. WADS 2009: 74-85 - [c76]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. WADS 2009: 86-97 - [i25]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications. CoRR abs/0904.2310 (2009) - 2008
- [j40]Jieun K. Jeong, Piotr Berman:
On cycles in the transcription network of Saccharomyces cerevisiae. BMC Syst. Biol. 2: 12 (2008) - [j39]Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka:
Improving Strand Pairing Prediction through Exploring Folding Cooperativity. IEEE ACM Trans. Comput. Biol. Bioinform. 5(4): 484-491 (2008) - [j38]Piotr Berman, Bhaskar DasGupta:
Approximating the online set multicover problems via randomized winnowing. Theor. Comput. Sci. 393(1-3): 54-71 (2008) - [c75]Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky:
Fast Alignments of Metabolic Networks. BIBM 2008: 147-152 - [c74]Kelly Westbrooks, Irina Astrovskaya, David S. Campo, Yuri Khudyakov, Piotr Berman, Alexander Zelikovsky:
HCV Quasispecies Assembly Using Network Flows. ISBRA 2008: 159-170 - [i24]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitivity in Directed Networks. CoRR abs/0809.0188 (2008) - [i23]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. CoRR abs/0810.1851 (2008) - [i22]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two. CoRR abs/0812.2137 (2008) - [i21]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j37]Piotr Berman, Bhaskar DasGupta, Jie Liang:
Foreword. Algorithmica 48(4): 301 (2007) - [j36]Minmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris:
HomologMiner: looking for homologous genomic groups in whole genomes. Bioinform. 23(8): 917-925 (2007) - [j35]Piotr Berman, Marek Karpinski, Alexander D. Scott:
Computational complexity of some restricted instances of 3-SAT. Discret. Appl. Math. 155(5): 649-653 (2007) - [j34]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The inverse protein folding problem on 2D and 3D lattices. Discret. Appl. Math. 155(6-7): 719-732 (2007) - [j33]Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag:
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discret. Appl. Math. 155(6-7): 733-749 (2007) - [j32]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang:
On constructing an optimal consensus clustering from multiple clusterings. Inf. Process. Lett. 104(4): 137-145 (2007) - [j31]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Approximating Huffman codes in parallel. J. Discrete Algorithms 5(3): 479-490 (2007) - [j30]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Optimal trade-off for Merkle tree traversal. Theor. Comput. Sci. 372(1): 26-36 (2007) - [j29]Guiling Wang, Guohong Cao, Piotr Berman, Thomas F. La Porta:
Bidding Protocols for Deploying Mobile Sensors. IEEE Trans. Mob. Comput. 6(5): 563-576 (2007) - [c73]Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar:
Packing to angles and sectors. SPAA 2007: 171-180 - [c72]Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka:
Bringing Folding Pathways into Strand Pairing Prediction. WABI 2007: 38-48 - [c71]Piotr Berman, Shiva Prasad Kasiviswanathan:
Faster Approximation of Distances in Graphs. WADS 2007: 541-552 - [i20]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems Via Randomized Winnowing. Electron. Colloquium Comput. Complex. TR07 (2007) - [i19]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitive Reductions for Directed Networks. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c70]Piotr Berman, Martin Fürer, Alexander Zelikovsky:
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. CSR 2006: 70-79 - [c69]Piotr Berman, Marek Karpinski:
8/7-approximation algorithm for (1, 2)-TSP. SODA 2006: 641-648 - [c68]Minmei Hou, Piotr Berman, Louxin Zhang, Webb Miller:
Controlling Size When Aligning Multiple Genomic Sequences with Duplications. WABI 2006: 138-149 - [c67]Nikola Stojanovic, Piotr Berman:
A Linear-Time Algorithm for Studying Genetic Variation. WABI 2006: 344-354 - [i18]Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar:
Packing to angles and sectors. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j28]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71(2): 145-162 (2005) - [c66]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Optimal Trade-Off for Merkle Tree Traversal. ICETE (Selected Papers) 2005: 150-162 - [c65]Guiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta:
Optimizing sensor movement planning for energy efficiency. ISLPED 2005: 215-220 - [c64]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems via Randomized Winnowing. WADS 2005: 110-121 - [c63]Piotr Berman, Surajit K. Das:
On the Vehicle Routing Problem. WADS 2005: 360-371 - [i17]Piotr Berman, Marek Karpinski:
8/7-Approximation Algorithm for (1,2)-TSP. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j27]Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. J. Comput. Biol. 11(4): 766-785 (2004) - [c62]Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag:
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. APPROX-RANDOM 2004: 39-50 - [c61]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. CPM 2004: 244-253 - [c60]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT 2004: 39-50 - [c59]Piotr Berman, Gruia Calinescu, C. Shah, Alexander Zelikovsky:
Power efficient monitoring management in sensor networks. WCNC 2004: 2329-2334 - [i16]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Optimal Trade-Off for Merkle Tree Traversal. Electron. Colloquium Comput. Complex. TR04 (2004) - [i15]Piotr Berman, Marek Karpinski, Alexander D. Scott:
Computational Complexity of Some Restricted Instances of 3SAT. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j26]Vamsi Veeramachaneni, Piotr Berman, Webb Miller:
Aligning two fragmented sequences. Discret. Appl. Math. 127(1): 119-143 (2003) - [j25]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Approximation algorithms for MAX-MIN tiling. J. Algorithms 47(2): 122-134 (2003) - [c58]Piotr Berman, Piotr Krysta:
Optimizing misdirection. SODA 2003: 192-201 - [i14]Piotr Berman, Marek Karpinski:
Improved Approximation Lower Bounds on Small Occurrence Optimization. Electron. Colloquium Comput. Complex. TR03 (2003) - [i13]Piotr Berman, Marek Karpinski, Alex D. Scott:
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT. Electron. Colloquium Comput. Complex. TR03 (2003) - [i12]Piotr Berman, Marek Karpinski, Alex D. Scott:
Approximation Hardness of Short Symmetric Instances of MAX-3SAT. Electron. Colloquium Comput. Complex. TR03 (2003) - [i11]Piotr Berman, Marek Karpinski:
Approximability of Hypergraph Minimum Bisection. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j24]Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. 65(2): 332-350 (2002) - [j23]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discret. Math. 15(2): 252-267 (2002) - [c57]Piotr Berman, Sridhar Hannenhalli, Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals. ESA 2002: 200-210 - [c56]Piotr Berman, Marek Karpinski:
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ICALP 2002: 623-632 - [c55]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Approximating Huffman Codes in Parallel. ICALP 2002: 845-855 - [c54]Vamsi Veeramachaneni, Piotr Berman, Webb Miller:
Aligning Two Fragmented Sequences. IPDPS 2002 - [c53]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Slice and dice: a simple, improved approximate tiling recipe. SODA 2002: 455-464 - [c52]Piotr Berman, Marek Karpinski:
Approximating minimum unsatisfiability of linear equations. SODA 2002: 514-516 - [c51]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Simple approximation algorithm for nonoverlapping local alignments. SODA 2002: 677-678 - [c50]Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. WABI 2002: 419-433 - [i10]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Approximating Huffman Codes in Parallel. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j22]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41(2): 443-470 (2001) - [c49]Piotr Berman, Junichiro Fukuyama:
An Online Algorithm for the Postman Problem with a Small Penalty. RANDOM-APPROX 2001: 48-54 - [c48]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Improved approximation algorithms for rectangle tiling and packing. SODA 2001: 427-436 - [i9]Piotr Berman, Marek Karpinski:
Approximating Minimum Unsatisfiability of Linear Equations. Electron. Colloquium Comput. Complex. TR01 (2001) - [i8]Piotr Berman, Marek Karpinski:
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. Electron. Colloquium Comput. Complex. TR01 (2001) - [i7]Piotr Berman, Sridhar Hannenhalli, Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals. Electron. Colloquium Comput. Complex. TR01 (2001) - [i6]Piotr Berman, Marek Karpinski:
Efficient Amplifiers and Bounded Degree Optimization. Electron. Colloquium Comput. Complex. TR01 (2001) - [i5]Piotr Berman, Amir Ben-Dor, Itsik Pe'er, Roded Sharan, Ron Shamir:
On the Complexity of Positional Sequencing by Hybridization. Electron. Colloquium Comput. Complex. TR01 (2001) - [i4]Piotr Berman, Marek Karpinski:
Improved Approximations for General Minimum Cost Scheduling. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j21]Piotr Berman, Moses Charikar, Marek Karpinski:
On-Line Load Balancing for Related Machines. J. Algorithms 35(1): 108-121 (2000) - [j20]Piotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller:
Winnowing Sequences from a Database Search. J. Comput. Biol. 7(1-2): 293-302 (2000) - [j19]Piotr Berman, Bhaskar DasGupta:
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. J. Comb. Optim. 4(3): 307-323 (2000) - [j18]Piotr Berman:
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. Nord. J. Comput. 7(3): 178-184 (2000) - [j17]Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky:
Optimal phase conflict removal for layout of dark field alternatingphase shifting masks. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(2): 175-187 (2000) - [c47]Piotr Berman, Junichiro Fukuyama:
Variable length sequencing with two lengths. APPROX 2000: 51-59 - [c46]Piotr Berman, Bhaskar DasGupta:
Improvements in throughout maximization for real-time scheduling. STOC 2000: 680-687 - [c45]Piotr Berman:
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. SWAT 2000: 214-219 - [i3]Piotr Berman, Moses Charikar, Marek Karpinski:
On-Line Load Balancing for Related Machines. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j16]Zheng Zhang, Piotr Berman, Thomas Wiehe, Webb Miller:
Post-processing long pairwise alignments. Bioinform. 15(12): 1012-1019 (1999) - [j15]Piotr Berman, Toshihiro Fujito:
On Approximation Properties of the Independent Set Problem for Low Degree Graphs. Theory Comput. Syst. 32(2): 115-132 (1999) - [j14]Piotr Berman, Chris Coulston:
Speed is More Powerful than Clairvoyance. Nord. J. Comput. 6(2): 181-193 (1999) - [j13]Vineet Bafna, Piotr Berman, Toshihiro Fujito:
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. SIAM J. Discret. Math. 12(3): 289-297 (1999) - [c44]Piotr Berman, Marek Karpinski:
On Some Tighter Inapproximability Results (Extended Abstract). ICALP 1999: 200-209 - [c43]