The following pages link to Piotr Berman (Q397069):
Displaying 50 items.
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- Optimal trade-off for Merkle tree traversal (Q870836) (← links)
- Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
- The inverse protein folding problem on 2D and 3D lattices (Q876470) (← links)
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks (Q876471) (← links)
- Consistent sets of secondary structures in proteins (Q1017911) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon (Q1269914) (← links)
- On approximation properties of the independent set problem for low degree graphs (Q1281930) (← links)
- Fast consensus in networks of bounded degree. (Q1312604) (← links)
- Multi-phase algorithms for throughput maximization for real-time scheduling (Q1587588) (← links)
- Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← links)
- Aligning two fragmented sequences (Q1868717) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- Approximation algorithms for spanner problems and directed Steiner forest (Q1951575) (← links)
- On constructing an optimal consensus clustering from multiple clusterings (Q2380012) (← links)
- Approximating Huffman codes in parallel (Q2466011) (← links)
- Approximating the online set multicover problems via randomized winnowing (Q2481951) (← links)
- Tight approximability results for test set problems in bioinformatics (Q2485280) (← links)
- (Q2708231) (← links)
- (Q2721980) (← links)
- (Q2743973) (← links)
- (Q2753726) (← links)
- Finding sparser directed spanners (Q2908874) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets (Q3012848) (← links)
- (Q3024759) (← links)
- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 (Q3060717) (← links)
- O(1)-Approximations for Maximum Movement Problems (Q3088082) (← links)
- Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures (Q3128191) (← links)
- (Q3128896) (← links)
- Testing Convexity of Figures Under the Uniform Distribution (Q3132850) (← links)
- (Q3138905) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs (Q3167384) (← links)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)
- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 (Q3183443) (← links)
- Improvements in throughout maximization for real-time scheduling (Q3192041) (← links)
- (Q3334975) (← links)
- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees (Q3434683) (← links)
- On the Performance of the Minimum Degree Ordering for Gaussian Elimination (Q3482751) (← links)
- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems (Q3578321) (← links)
- 8/7-approximation algorithm for (1,2)-TSP (Q3581504) (← links)
- Approximation Algorithms for Min-Max Generalization Problems (Q3588399) (← links)
- Faster Approximation of Distances in Graphs (Q3603556) (← links)
- (Q3853607) (← links)
- (Q3938525) (← links)
- (Q3957927) (← links)
