A 2-approximation algorithm for the undirected feedback vertex set problem. Zbl 0932.68054
Bafna, Vineet; Berman, Piotr; Fujito, Toshihiro |
|
1999
|
On the complexity of approximating the independent set problem. Zbl 0804.90121
Berman, Piotr; Schnitger, Georg |
|
1992
|
On-line load balancing for related machines. Zbl 0954.68050
Berman, Piotr; Charikar, Moses; Karpinski, Marek |
|
2000
|
Improved approximations for the Steiner tree problem. Zbl 0820.68049
Berman, Piotr; Ramaiyer, Viswanathan |
|
1994
|
\(8/7\)-approximation algorithm for \((1,2)\)-TSP. Zbl 1192.90158
Berman, Piotr; Karpinski, Marek |
|
2006
|
1. 375-approximation algorithm for sorting by reversals. Zbl 1019.68817
Berman, Piotr; Hannenhalli, Sridhar; Karpinski, Marek |
|
2002
|
On-line algorithms for Steiner tree problems. (Extended abstract). Zbl 0963.68152
Berman, Piotr; Coulston, Chris |
|
1999
|
On complexity of regular languages in terms of finite automata. Zbl 0364.68057
Berman, Piotr; Lingas, Andrzej |
|
1977
|
On approximation properties of the independent set problem for low degree graphs. Zbl 0916.68109
Berman, P.; Fujito, T. |
|
1999
|
\(L_p\)-testing. Zbl 1315.68278
Berman, Piotr; Raskhodnikova, Sofya; Yaroslavtsev, Grigory |
|
2014
|
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs. Zbl 0972.68127
Berman, Piotr |
|
2000
|
Relationship between density and deterministic complexity of NP-complete languages. Zbl 0382.68068
Berman, Piotr |
|
1978
|
Approximating maximum independent set in bounded degree graphs. Zbl 0873.68163
Berman, Piotr; Fürer, Martin |
|
1994
|
On approximation properties of the independent set problem for degree 3 graphs. Zbl 1502.68207
Berman, Piotr; Fujito, Toshihiro |
|
1995
|
Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (extended abstract). Zbl 1512.68189
Bafna, Vineet; Berman, Piotr; Fujito, Toshihiro |
|
1995
|
Approximation algorithms for spanner problems and directed Steiner forest. Zbl 1267.68317
Berman, Piotr; Bhattacharyya, Arnab; Makarychev, Konstantin; Raskhodnikova, Sofya; Yaroslavtsev, Grigory |
|
2013
|
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs. Zbl 0966.68609
Berman, Piotr |
|
2000
|
Tight approximability results for test set problems in bioinformatics. Zbl 1076.68113
Berman, Piotr; Dasgupta, Bhaskar; Kao, Ming-Yang |
|
2005
|
Efficient approximation algorithms for tiling and packing problems with rectangles. Zbl 0999.68248
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta |
|
2001
|
Cloture votes: \(n/4\)-resilient distributed consensus in \(t+1\) rounds. Zbl 0766.68004
Berman, Piotr; Garay, Juan A. |
|
1993
|
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Zbl 1163.68045
Berman, Piotr; Dasgupta, Bhaskar; Sontag, Eduardo |
|
2007
|
Faster approximation of distances in graphs. Zbl 1209.05238
Berman, Piotr; Kasiviswanathan, Shiva Prasad |
|
2007
|
Improvements in throughout maximization for real-time scheduling. Zbl 1296.90040
Berman, Piotr; DasGupta, Bhaskar |
|
2000
|
On the complexity of pattern matching for highly compressed two-dimensional texts. Zbl 1059.68098
Berman, Piotr; Karpinski, Marek; Larmore, Lawrence L.; Plandowski, Wojciech; Rytter, Wojciech |
|
2002
|
Online navigation in a room. Zbl 1321.68430
Bar-Eli, Eldad; Berman, Piotr; Fiat, Amos; Yan, Peiyuan |
|
1994
|
Improved approximations for the Steiner tree problem. Zbl 0829.68063
Berman, Piotr; Ramaiyer, Viswanathan |
|
1992
|
Reliable broadcasting in logarithmic time with Byzantine link failures. Zbl 0866.68011
Berman, Piotr; Diks, Krzryztof; Pelc, Andrzej |
|
1997
|
Multi-phase algorithms for throughput maximization for real-time scheduling. Zbl 0991.90061
Berman, Piotr; Dasgupta, Bhaskar |
|
2000
|
Algorithms for the least distance problem. Zbl 0968.90501
Berman, Piotr; Kovoor, Nainan; Pardalos, Panos M. |
|
1993
|
A note on sweeping automata. Zbl 0479.68081
Berman, Piotr |
|
1980
|
Tolerant testers of image properties. Zbl 1388.68281
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2016
|
Randomized robot navigation algorithms. Zbl 0960.68593
Berman, Piotr; Blum, Avrim; Fiat, Amos; Karloff, Howard; Rosén, Adi; Saks, Michael |
|
1996
|
A competitive 3-server algorithm. Zbl 0800.68452
Berman, P.; Karloff, H.; Tardos, G. |
|
1990
|
A linear-time algorithm for the 1-mismatch problem. Zbl 1497.68606
Stojanovic, Nikola; Berman, Piotr; Gumucio, Deborah; Hardison, Ross; Miller, Webb |
|
1997
|
\(O(1)\)-approximations for maximum movement problems. Zbl 1343.68306
Berman, Piotr; Demaine, Erik D.; Zadimoghaddam, Morteza |
|
2011
|
Testing convexity of figures under the uniform distribution. Zbl 1387.68239
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2016
|
Fast consensus in networks of bounded degree. Zbl 1282.68092
Berman, Piotr; Garay, Juan A. |
|
1993
|
The power and limitations of uniform samples in testing properties of figures. Zbl 1391.68106
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2016
|
Improved approximation for the directed spanner problem. Zbl 1332.68283
Berman, Piotr; Bhattacharyya, Arnab; Makarychev, Konstantin; Raskhodnikova, Sofya; Yaroslavtsev, Grigory |
|
2011
|
Complexities of efficient solutions of rectilinear polygon cover problems. Zbl 0869.68058
Berman, P.; DasGupta, B. |
|
1997
|
Speed is more powerful than clairvoyance. Zbl 0946.68157
Berman, Piotr; Coulston, Chris |
|
1999
|
On the power of nondeterminism in dynamic logic. Zbl 0494.68032
Berman, Piotr; Halpern, Joseph Y.; Tiuryn, Jerzy |
|
1982
|
Computational complexity of some restricted instances of 3-SAT. Zbl 1111.68044
Berman, Piotr; Karpinski, Marek; Scott, Alexander D. |
|
2007
|
On the complexity of approximating the independent set problem (extended abstract). Zbl 1492.68060
Berman, Piotr; Schnitger, Georg |
|
1989
|
Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION. Zbl 1057.68646
Berman, Piotr; Karpinski, Marek |
|
2002
|
1.25-approximation algorithm for Steiner tree problem with distances 1 and 2. Zbl 1253.68355
Berman, Piotr; Karpinski, Marek; Zelikovsky, Alexander |
|
2009
|
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Zbl 1106.68432
Berman, Piotr; DasGupta, Bhaskar; Sontag, Eduardo |
|
2004
|
Approximating minimum unsatisfiability of linear equations. Zbl 1254.68348
Berman, Piotr; Karpinski, Marek |
|
2002
|
Approximating transitive reductions for directed networks. Zbl 1253.68354
Berman, Piotr; DasGupta, Bhaskar; Karpinski, Marek |
|
2009
|
Primal-dual approximation algorithms for node-weighted network design in planar graphs. Zbl 1358.68318
Berman, Piotr; Yaroslavtsev, Grigory |
|
2012
|
Optimizing misdirection. Zbl 1094.68604
Berman, Piotr; Krysta, Piotr |
|
2003
|
Exact size of binary space partitionings and improved rectangle tiling algorithms. Zbl 1050.68145
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S. |
|
2002
|
Finding sparser directed spanners. Zbl 1245.68246
Berman, Piotr; Raskhodnikova, Sofya; Ruan, Ge |
|
2010
|
The power and limitations of uniform samples in testing properties of figures. Zbl 1417.68225
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2019
|
Steiner transitive-closure spanners of low-dimensional posets. Zbl 1363.05094
Berman, Piotr; Bhattacharyya, Arnab; Grigorescu, Elena; Raskhodnikova, Sofya; Woodruff, David P.; Yaroslavtsev, Grigory |
|
2014
|
On approximation of the power-\(p\) and bottleneck Steiner trees. Zbl 0945.90046
Berman, Piotr; Zelikovsky, Alexander |
|
2000
|
On-line load balancing for related machines. Zbl 1497.68577
Berman, Piotr; Charikar, Moses; Karpinski, Marek |
|
1997
|
Approximation algorithms for MAX-MIN tiling. Zbl 1045.68149
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S. |
|
2003
|
Simple approximation algorithm for nonoverlapping local alignments. Zbl 1092.68733
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S. |
|
2002
|
Improved approximation algorithms for rectangle tiling and packing. Zbl 1113.68635
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta |
|
2001
|
Approximating the online set multicover problems via randomized winnowing. Zbl 1137.68061
Berman, Piotr; DasGupta, Bhaskar |
|
2008
|
Optimal trade-off for Merkle tree traversal. Zbl 1108.68047
Berman, Piotr; Karpinski, Marek; Nekrich, Yakov |
|
2007
|
On constructing an optimal consensus clustering from multiple clusterings. Zbl 1184.68630
Berman, Piotr; Dasgupta, Bhaskar; Kao, Ming-Yang; Wang, Jie |
|
2007
|
Steiner transitive-closure spanners of low-dimensional posets. Zbl 1333.68203
Berman, Piotr; Bhattacharyya, Arnab; Grigorescu, Elena; Raskhodnikova, Sofya; Woodruff, David P.; Yaroslavtsev, Grigory |
|
2011
|
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1252.68347
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej |
|
2012
|
On the computational complexity of measuring global stability of banking networks. Zbl 1307.91197
Berman, Piotr; DasGupta, Bhaskar; Kaligounder, Lakshmi; Karpinski, Marek |
|
2014
|
The \(T\)-join problem in sparse graphs: applications to phase assingment problem in VLSI mask layout. Zbl 1063.68612
Berman, Piotr; Kahng, Andrew B.; Vidhani, Devendra; Zelikovsky, Alexander |
|
1999
|
On the vehicle routing problem. Zbl 1161.68873
Berman, Piotr; Das, Surajit K. |
|
2005
|
On approximating four covering and packing problems. Zbl 1169.90017
Ashley, Mary; Berger-Wolf, Tanya; Berman, Piotr; Chaovalitwongse, Wanpracha; Dasgupta, Bhaskar; Kao, Ming-Yang |
|
2009
|
Testing convexity of figures under the uniform distribution. Zbl 1417.52002
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2019
|
A nearly parallel algorithm for the Voronoi diagram of a convex polygon. Zbl 0902.68202
Berman, Piotr; Lingas, Andrzej |
|
1997
|
Complexity of the theory of atomless Boolean algebras. Zbl 0421.03028
Berman, Piotr |
|
1979
|
A simple approximation algorithm for nonoverlapping local alignments (weighted independent sets of axis parallel rectangles). Zbl 1026.92022
Berman, Piotr; DasGupta, Bhaskar |
|
2002
|
Aligning two fragmented sequences. Zbl 1014.92012
Veeramachaneni, Vamsi; Berman, Piotr; Miller, Webb |
|
2003
|
Slice and dice: a simple, improved approximate tiling recipe. Zbl 1093.68606
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S. |
|
2002
|
On the performance of the minimum degree ordering for Gaussian elimination. Zbl 0703.65016
Berman, Piotr; Schnitger, Georg |
|
1990
|
Deterministic dynamic logic of recursive programs is weaker than dynamic logic. Zbl 0545.68020
Berman, Piotr |
|
1983
|
Tolerant testers of image properties. Zbl 07758431
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2022
|
Applications of the linear matroid parity algorithm to approximating Steiner trees. Zbl 1185.68460
Berman, Piotr; Fürer, Martin; Zelikovsky, Alexander |
|
2006
|
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1286.68461
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej |
|
2010
|
Tolerant testers of image properties. Zbl 07758431
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2022
|
The power and limitations of uniform samples in testing properties of figures. Zbl 1417.68225
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2019
|
Testing convexity of figures under the uniform distribution. Zbl 1417.52002
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2019
|
Tolerant testers of image properties. Zbl 1388.68281
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2016
|
Testing convexity of figures under the uniform distribution. Zbl 1387.68239
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2016
|
The power and limitations of uniform samples in testing properties of figures. Zbl 1391.68106
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya |
|
2016
|
\(L_p\)-testing. Zbl 1315.68278
Berman, Piotr; Raskhodnikova, Sofya; Yaroslavtsev, Grigory |
|
2014
|
Steiner transitive-closure spanners of low-dimensional posets. Zbl 1363.05094
Berman, Piotr; Bhattacharyya, Arnab; Grigorescu, Elena; Raskhodnikova, Sofya; Woodruff, David P.; Yaroslavtsev, Grigory |
|
2014
|
On the computational complexity of measuring global stability of banking networks. Zbl 1307.91197
Berman, Piotr; DasGupta, Bhaskar; Kaligounder, Lakshmi; Karpinski, Marek |
|
2014
|
Approximation algorithms for spanner problems and directed Steiner forest. Zbl 1267.68317
Berman, Piotr; Bhattacharyya, Arnab; Makarychev, Konstantin; Raskhodnikova, Sofya; Yaroslavtsev, Grigory |
|
2013
|
Primal-dual approximation algorithms for node-weighted network design in planar graphs. Zbl 1358.68318
Berman, Piotr; Yaroslavtsev, Grigory |
|
2012
|
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1252.68347
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej |
|
2012
|
\(O(1)\)-approximations for maximum movement problems. Zbl 1343.68306
Berman, Piotr; Demaine, Erik D.; Zadimoghaddam, Morteza |
|
2011
|
Improved approximation for the directed spanner problem. Zbl 1332.68283
Berman, Piotr; Bhattacharyya, Arnab; Makarychev, Konstantin; Raskhodnikova, Sofya; Yaroslavtsev, Grigory |
|
2011
|
Steiner transitive-closure spanners of low-dimensional posets. Zbl 1333.68203
Berman, Piotr; Bhattacharyya, Arnab; Grigorescu, Elena; Raskhodnikova, Sofya; Woodruff, David P.; Yaroslavtsev, Grigory |
|
2011
|
Finding sparser directed spanners. Zbl 1245.68246
Berman, Piotr; Raskhodnikova, Sofya; Ruan, Ge |
|
2010
|
Exact and approximation algorithms for geometric and capacitated set cover problems. Zbl 1286.68461
Berman, Piotr; Karpinski, Marek; Lingas, Andrzej |
|
2010
|
1.25-approximation algorithm for Steiner tree problem with distances 1 and 2. Zbl 1253.68355
Berman, Piotr; Karpinski, Marek; Zelikovsky, Alexander |
|
2009
|
Approximating transitive reductions for directed networks. Zbl 1253.68354
Berman, Piotr; DasGupta, Bhaskar; Karpinski, Marek |
|
2009
|
On approximating four covering and packing problems. Zbl 1169.90017
Ashley, Mary; Berger-Wolf, Tanya; Berman, Piotr; Chaovalitwongse, Wanpracha; Dasgupta, Bhaskar; Kao, Ming-Yang |
|
2009
|
Approximating the online set multicover problems via randomized winnowing. Zbl 1137.68061
Berman, Piotr; DasGupta, Bhaskar |
|
2008
|
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Zbl 1163.68045
Berman, Piotr; Dasgupta, Bhaskar; Sontag, Eduardo |
|
2007
|
Faster approximation of distances in graphs. Zbl 1209.05238
Berman, Piotr; Kasiviswanathan, Shiva Prasad |
|
2007
|
Computational complexity of some restricted instances of 3-SAT. Zbl 1111.68044
Berman, Piotr; Karpinski, Marek; Scott, Alexander D. |
|
2007
|
Optimal trade-off for Merkle tree traversal. Zbl 1108.68047
Berman, Piotr; Karpinski, Marek; Nekrich, Yakov |
|
2007
|
On constructing an optimal consensus clustering from multiple clusterings. Zbl 1184.68630
Berman, Piotr; Dasgupta, Bhaskar; Kao, Ming-Yang; Wang, Jie |
|
2007
|
\(8/7\)-approximation algorithm for \((1,2)\)-TSP. Zbl 1192.90158
Berman, Piotr; Karpinski, Marek |
|
2006
|
Applications of the linear matroid parity algorithm to approximating Steiner trees. Zbl 1185.68460
Berman, Piotr; Fürer, Martin; Zelikovsky, Alexander |
|
2006
|
Tight approximability results for test set problems in bioinformatics. Zbl 1076.68113
Berman, Piotr; Dasgupta, Bhaskar; Kao, Ming-Yang |
|
2005
|
On the vehicle routing problem. Zbl 1161.68873
Berman, Piotr; Das, Surajit K. |
|
2005
|
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Zbl 1106.68432
Berman, Piotr; DasGupta, Bhaskar; Sontag, Eduardo |
|
2004
|
Optimizing misdirection. Zbl 1094.68604
Berman, Piotr; Krysta, Piotr |
|
2003
|
Approximation algorithms for MAX-MIN tiling. Zbl 1045.68149
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S. |
|
2003
|
Aligning two fragmented sequences. Zbl 1014.92012
Veeramachaneni, Vamsi; Berman, Piotr; Miller, Webb |
|
2003
|
1. 375-approximation algorithm for sorting by reversals. Zbl 1019.68817
Berman, Piotr; Hannenhalli, Sridhar; Karpinski, Marek |
|
2002
|
On the complexity of pattern matching for highly compressed two-dimensional texts. Zbl 1059.68098
Berman, Piotr; Karpinski, Marek; Larmore, Lawrence L.; Plandowski, Wojciech; Rytter, Wojciech |
|
2002
|
Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION. Zbl 1057.68646
Berman, Piotr; Karpinski, Marek |
|
2002
|
Approximating minimum unsatisfiability of linear equations. Zbl 1254.68348
Berman, Piotr; Karpinski, Marek |
|
2002
|
Exact size of binary space partitionings and improved rectangle tiling algorithms. Zbl 1050.68145
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S. |
|
2002
|
Simple approximation algorithm for nonoverlapping local alignments. Zbl 1092.68733
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S. |
|
2002
|
A simple approximation algorithm for nonoverlapping local alignments (weighted independent sets of axis parallel rectangles). Zbl 1026.92022
Berman, Piotr; DasGupta, Bhaskar |
|
2002
|
Slice and dice: a simple, improved approximate tiling recipe. Zbl 1093.68606
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S. |
|
2002
|
Efficient approximation algorithms for tiling and packing problems with rectangles. Zbl 0999.68248
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta |
|
2001
|
Improved approximation algorithms for rectangle tiling and packing. Zbl 1113.68635
Berman, Piotr; DasGupta, Bhaskar; Muthukrishnan, S.; Ramaswami, Suneeta |
|
2001
|
On-line load balancing for related machines. Zbl 0954.68050
Berman, Piotr; Charikar, Moses; Karpinski, Marek |
|
2000
|
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs. Zbl 0972.68127
Berman, Piotr |
|
2000
|
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs. Zbl 0966.68609
Berman, Piotr |
|
2000
|
Improvements in throughout maximization for real-time scheduling. Zbl 1296.90040
Berman, Piotr; DasGupta, Bhaskar |
|
2000
|
Multi-phase algorithms for throughput maximization for real-time scheduling. Zbl 0991.90061
Berman, Piotr; Dasgupta, Bhaskar |
|
2000
|
On approximation of the power-\(p\) and bottleneck Steiner trees. Zbl 0945.90046
Berman, Piotr; Zelikovsky, Alexander |
|
2000
|
A 2-approximation algorithm for the undirected feedback vertex set problem. Zbl 0932.68054
Bafna, Vineet; Berman, Piotr; Fujito, Toshihiro |
|
1999
|
On-line algorithms for Steiner tree problems. (Extended abstract). Zbl 0963.68152
Berman, Piotr; Coulston, Chris |
|
1999
|
On approximation properties of the independent set problem for low degree graphs. Zbl 0916.68109
Berman, P.; Fujito, T. |
|
1999
|
Speed is more powerful than clairvoyance. Zbl 0946.68157
Berman, Piotr; Coulston, Chris |
|
1999
|
The \(T\)-join problem in sparse graphs: applications to phase assingment problem in VLSI mask layout. Zbl 1063.68612
Berman, Piotr; Kahng, Andrew B.; Vidhani, Devendra; Zelikovsky, Alexander |
|
1999
|
Reliable broadcasting in logarithmic time with Byzantine link failures. Zbl 0866.68011
Berman, Piotr; Diks, Krzryztof; Pelc, Andrzej |
|
1997
|
A linear-time algorithm for the 1-mismatch problem. Zbl 1497.68606
Stojanovic, Nikola; Berman, Piotr; Gumucio, Deborah; Hardison, Ross; Miller, Webb |
|
1997
|
Complexities of efficient solutions of rectilinear polygon cover problems. Zbl 0869.68058
Berman, P.; DasGupta, B. |
|
1997
|
On-line load balancing for related machines. Zbl 1497.68577
Berman, Piotr; Charikar, Moses; Karpinski, Marek |
|
1997
|
A nearly parallel algorithm for the Voronoi diagram of a convex polygon. Zbl 0902.68202
Berman, Piotr; Lingas, Andrzej |
|
1997
|
Randomized robot navigation algorithms. Zbl 0960.68593
Berman, Piotr; Blum, Avrim; Fiat, Amos; Karloff, Howard; Rosén, Adi; Saks, Michael |
|
1996
|
On approximation properties of the independent set problem for degree 3 graphs. Zbl 1502.68207
Berman, Piotr; Fujito, Toshihiro |
|
1995
|
Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (extended abstract). Zbl 1512.68189
Bafna, Vineet; Berman, Piotr; Fujito, Toshihiro |
|
1995
|
Improved approximations for the Steiner tree problem. Zbl 0820.68049
Berman, Piotr; Ramaiyer, Viswanathan |
|
1994
|
Approximating maximum independent set in bounded degree graphs. Zbl 0873.68163
Berman, Piotr; Fürer, Martin |
|
1994
|
Online navigation in a room. Zbl 1321.68430
Bar-Eli, Eldad; Berman, Piotr; Fiat, Amos; Yan, Peiyuan |
|
1994
|
Cloture votes: \(n/4\)-resilient distributed consensus in \(t+1\) rounds. Zbl 0766.68004
Berman, Piotr; Garay, Juan A. |
|
1993
|
Algorithms for the least distance problem. Zbl 0968.90501
Berman, Piotr; Kovoor, Nainan; Pardalos, Panos M. |
|
1993
|
Fast consensus in networks of bounded degree. Zbl 1282.68092
Berman, Piotr; Garay, Juan A. |
|
1993
|
On the complexity of approximating the independent set problem. Zbl 0804.90121
Berman, Piotr; Schnitger, Georg |
|
1992
|
Improved approximations for the Steiner tree problem. Zbl 0829.68063
Berman, Piotr; Ramaiyer, Viswanathan |
|
1992
|
A competitive 3-server algorithm. Zbl 0800.68452
Berman, P.; Karloff, H.; Tardos, G. |
|
1990
|
On the performance of the minimum degree ordering for Gaussian elimination. Zbl 0703.65016
Berman, Piotr; Schnitger, Georg |
|
1990
|
On the complexity of approximating the independent set problem (extended abstract). Zbl 1492.68060
Berman, Piotr; Schnitger, Georg |
|
1989
|
Deterministic dynamic logic of recursive programs is weaker than dynamic logic. Zbl 0545.68020
Berman, Piotr |
|
1983
|
On the power of nondeterminism in dynamic logic. Zbl 0494.68032
Berman, Piotr; Halpern, Joseph Y.; Tiuryn, Jerzy |
|
1982
|
A note on sweeping automata. Zbl 0479.68081
Berman, Piotr |
|
1980
|
Complexity of the theory of atomless Boolean algebras. Zbl 0421.03028
Berman, Piotr |
|
1979
|
Relationship between density and deterministic complexity of NP-complete languages. Zbl 0382.68068
Berman, Piotr |
|
1978
|
On complexity of regular languages in terms of finite automata. Zbl 0364.68057
Berman, Piotr; Lingas, Andrzej |
|
1977
|