2009 | ||
---|---|---|
135 | EE | Piotr Berman, Jieun K. Jeong: Consistent Sets of Secondary Structures in Proteins. Algorithmica 53(1): 16-34 (2009) |
134 | EE | Piotr Berman, Marek Karpinski, Andrzej Lingas: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications CoRR abs/0904.2310: (2009) |
133 | EE | 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) |
2008 | ||
132 | EE | Kelly Westbrooks, Irina Astrovskaya, David Campo, Yuri Khudyakov, Piotr Berman, Alexander Zelikovsky: HCV Quasispecies Assembly Using Network Flows. ISBRA 2008: 159-170 |
131 | EE | Piotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitivity in Directed Networks CoRR abs/0809.0188: (2008) |
130 | EE | 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) |
129 | EE | 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) |
128 | EE | Piotr Berman, Marek Karpinski, Alexander Zelikovsky: 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. Electronic Colloquium on Computational Complexity (ECCC) 15(094): (2008) |
127 | EE | Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka: Improving Strand Pairing Prediction through Exploring Folding Cooperativity. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 484-491 (2008) |
126 | EE | Piotr Berman, Bhaskar DasGupta: Approximating the online set multicover problems via randomized winnowing. Theor. Comput. Sci. 393(1-3): 54-71 (2008) |
2007 | ||
125 | EE | Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar: Packing to angles and sectors. SPAA 2007: 171-180 |
124 | EE | Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka: Bringing Folding Pathways into Strand Pairing Prediction. WABI 2007: 38-48 |
123 | EE | Piotr Berman, Shiva Prasad Kasiviswanathan: Faster Approximation of Distances in Graphs. WADS 2007: 541-552 |
122 | EE | Piotr Berman, Bhaskar DasGupta, Jie Liang: Foreword. Algorithmica 48(4): 301 (2007) |
121 | EE | Minmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris: HomologMiner: looking for homologous genomic groups in whole genomes. Bioinformatics 23(8): 917-925 (2007) |
120 | EE | Piotr Berman, Marek Karpinski, Alexander D. Scott: Computational complexity of some restricted instances of 3-SAT. Discrete Applied Mathematics 155(5): 649-653 (2007) |
119 | EE | 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. Discrete Applied Mathematics 155(6-7): 719-732 (2007) |
118 | EE | Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discrete Applied Mathematics 155(6-7): 733-749 (2007) |
117 | EE | Piotr Berman, Bhaskar DasGupta: Approximating the Online Set Multicover Problems Via Randomized Winnowing. Electronic Colloquium on Computational Complexity (ECCC) 14(092): (2007) |
116 | EE | Piotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitive Reductions for Directed Networks. Electronic Colloquium on Computational Complexity (ECCC) 14(119): (2007) |
115 | EE | 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) |
114 | EE | 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) |
113 | EE | Piotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman codes in parallel. J. Discrete Algorithms 5(3): 479-490 (2007) |
112 | EE | Piotr Berman, Marek Karpinski, Yakov Nekrich: Optimal trade-off for Merkle tree traversal. Theor. Comput. Sci. 372(1): 26-36 (2007) |
2006 | ||
111 | EE | Piotr Berman, Martin Fürer, Alexander Zelikovsky: Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. CSR 2006: 70-79 |
110 | EE | Piotr Berman, Marek Karpinski: 8/7-approximation algorithm for (1, 2)-TSP. SODA 2006: 641-648 |
109 | EE | Minmei Hou, Piotr Berman, Louxin Zhang, Webb Miller: Controlling Size When Aligning Multiple Genomic Sequences with Duplications. WABI 2006: 138-149 |
108 | EE | Nikola Stojanovic, Piotr Berman: A Linear-Time Algorithm for Studying Genetic Variation. WABI 2006: 344-354 |
107 | EE | Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar: Packing to angles and sectors. Electronic Colloquium on Computational Complexity (ECCC) 13(030): (2006) |
2005 | ||
106 | EE | Guiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta: Optimizing sensor movement planning for energy efficiency. ISLPED 2005: 215-220 |
105 | EE | Piotr Berman, Bhaskar DasGupta: Approximating the Online Set Multicover Problems via Randomized Winnowing. WADS 2005: 110-121 |
104 | EE | Piotr Berman, Surajit K. Das: On the Vehicle Routing Problem. WADS 2005: 360-371 |
103 | EE | Piotr Berman, Marek Karpinski: 8/7-Approximation Algorithm for (1,2)-TSP Electronic Colloquium on Computational Complexity (ECCC)(069): (2005) |
102 | EE | 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) |
2004 | ||
101 | EE | 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 |
100 | EE | 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 |
99 | EE | Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao: Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT 2004: 39-50 |
98 | EE | Piotr Berman, Marek Karpinski, Yakov Nekrich: Optimal Trade-Off for Merkle Tree Traversal Electronic Colloquium on Computational Complexity (ECCC)(049): (2004) |
97 | EE | Piotr Berman, Marek Karpinski, Alexander D. Scott: Computational Complexity of Some Restricted Instances of 3SAT Electronic Colloquium on Computational Complexity (ECCC)(111): (2004) |
96 | EE | 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. Journal of Computational Biology 11(4): 766-785 (2004) |
2003 | ||
95 | EE | Piotr Berman, Piotr Krysta: Optimizing misdirection. SODA 2003: 192-201 |
94 | Vamsi Veeramachaneni, Piotr Berman, Webb Miller: Aligning two fragmented sequences. Discrete Applied Mathematics 127(1): 119-143 (2003) | |
93 | EE | Piotr Berman, Marek Karpinski: Improved Approximation Lower Bounds on Small Occurrence Optimization Electronic Colloquium on Computational Complexity (ECCC) 10(008): (2003) |
92 | EE | Piotr Berman, Marek Karpinski, Alex D. Scott: Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT Electronic Colloquium on Computational Complexity (ECCC) 10(022): (2003) |
91 | EE | Piotr Berman, Marek Karpinski, Alex D. Scott: Approximation Hardness of Short Symmetric Instances of MAX-3SAT Electronic Colloquium on Computational Complexity (ECCC)(049): (2003) |
90 | EE | Piotr Berman, Marek Karpinski: Approximability of Hypergraph Minimum Bisection Electronic Colloquium on Computational Complexity (ECCC)(056): (2003) |
89 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Approximation algorithms for MAX-MIN tiling. J. Algorithms 47(2): 122-134 (2003) |
2002 | ||
88 | EE | Piotr Berman, Sridhar Hannenhalli, Marek Karpinski: 1.375-Approximation Algorithm for Sorting by Reversals. ESA 2002: 200-210 |
87 | EE | Piotr Berman, Marek Karpinski: Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ICALP 2002: 623-632 |
86 | EE | Piotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman Codes in Parallel. ICALP 2002: 845-855 |
85 | EE | Vamsi Veeramachaneni, Piotr Berman, Webb Miller: Aligning Two Fragmented Sequences. IPDPS 2002 |
84 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Slice and dice: a simple, improved approximate tiling recipe. SODA 2002: 455-464 |
83 | EE | Piotr Berman, Marek Karpinski: Approximating minimum unsatisfiability of linear equations. SODA 2002: 514-516 |
82 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Simple approximation algorithm for nonoverlapping local alignments. SODA 2002: 677-678 |
81 | EE | 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 |
80 | EE | Piotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman Codes in Parallel Electronic Colloquium on Computational Complexity (ECCC)(018): (2002) |
79 | EE | 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) |
78 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discrete Math. 15(2): 252-267 (2002) |
2001 | ||
77 | EE | Piotr Berman, Junichiro Fukuyama: An Online Algorithm for the Postman Problem with a Small Penalty. RANDOM-APPROX 2001: 48-54 |
76 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami: Improved approximation algorithms for rectangle tiling and packing. SODA 2001: 427-436 |
75 | EE | Piotr Berman, Marek Karpinski: Improved Approximations for General Minimum Cost Scheduling Electronic Colloquium on Computational Complexity (ECCC)(097): (2001) |
74 | EE | Piotr Berman, Marek Karpinski: Approximating Minimum Unsatisfiability of Linear Equations Electronic Colloquium on Computational Complexity (ECCC) 8(25): (2001) |
73 | EE | Piotr Berman, Marek Karpinski: Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION Electronic Colloquium on Computational Complexity (ECCC) 8(26): (2001) |
72 | EE | Piotr Berman, Sridhar Hannenhalli, Marek Karpinski: 1.375-Approximation Algorithm for Sorting by Reversals Electronic Colloquium on Computational Complexity (ECCC) 8(47): (2001) |
71 | EE | Piotr Berman, Marek Karpinski: Efficient Amplifiers and Bounded Degree Optimization Electronic Colloquium on Computational Complexity (ECCC) 8(53): (2001) |
70 | EE | Piotr Berman, Amir Ben-Dor, Itsik Pe'er, Roded Sharan, Ron Shamir: On the Complexity of Positional Sequencing by Hybridization Electronic Colloquium on Computational Complexity (ECCC) 8(54): (2001) |
69 | EE | 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) |
2000 | ||
68 | EE | Piotr Berman, Junichiro Fukuyama: Variable length sequencing with two lengths. APPROX 2000: 51-59 |
67 | EE | Piotr Berman, Bhaskar DasGupta: Improvements in throughout maximization for real-time scheduling. STOC 2000: 680-687 |
66 | EE | Piotr Berman: A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. SWAT 2000: 214-219 |
65 | EE | Piotr Berman, Moses Charikar, Marek Karpinski: On-Line Load Balancing for Related Machines Electronic Colloquium on Computational Complexity (ECCC) 7(1): (2000) |
64 | EE | 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. on CAD of Integrated Circuits and Systems 19(2): 175-187 (2000) |
63 | Piotr Berman, Moses Charikar, Marek Karpinski: On-Line Load Balancing for Related Machines. J. Algorithms 35(1): 108-121 (2000) | |
62 | Piotr Berman, Bhaskar DasGupta: Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. J. Comb. Optim. 4(3): 307-323 (2000) | |
61 | Piotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller: Winnowing Sequences from a Database Search. Journal of Computational Biology 7(1-2): 293-302 (2000) | |
60 | Piotr Berman: A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. Nord. J. Comput. 7(3): 178-184 (2000) | |
1999 | ||
59 | EE | Piotr Berman, Marek Karpinski: On Some Tighter Inapproximability Results (Extended Abstract). ICALP 1999: 200-209 |
58 | EE | Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky: Optimal phase conflict removal for layout of dark field alternating phase shifting masks. ISPD 1999: 121-126 |
57 | EE | Piotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller: Winnowing sequences from a database search. RECOMB 1999: 50-58 |
56 | EE | Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky: The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. WADS 1999: 25-36 |
55 | Zheng Zhang, Piotr Berman, Thomas Wiehe, Webb Miller: Post-processing long pairwise alignments. Bioinformatics 15(12): 1012-1019 (1999) | |
54 | Piotr Berman, Chris Coulston: Speed is More Powerful than Clairvoyance. Nord. J. Comput. 6(2): 181-193 (1999) | |
53 | EE | Vineet Bafna, Piotr Berman, Toshihiro Fujito: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. SIAM J. Discrete Math. 12(3): 289-297 (1999) |
52 | EE | Piotr Berman, Toshihiro Fujito: On Approximation Properties of the Independent Set Problem for Low Degree Graphs. Theory Comput. Syst. 32(2): 115-132 (1999) |
1998 | ||
51 | EE | Piotr Berman, Juan A. Garay: Adaptability and the Usefulness of Hints (Extended Abstract). ESA 1998: 271-282 |
50 | EE | Zheng Zhang, Piotr Berman, Webb Miller: Alignments without low-scoring regions. RECOMB 1998: 294-301 |
49 | EE | Piotr Berman, Chris Coulston: Speed is More Powerful than Claivoyance. SWAT 1998: 255-263 |
48 | EE | Piotr Berman, Marek Karpinski: On Some Tighter Inapproximability Results Electronic Colloquium on Computational Complexity (ECCC) 5(29): (1998) |
47 | EE | Piotr Berman, Marek Karpinski: On Some Tighter Inapproximability Results, Further Improvements Electronic Colloquium on Computational Complexity (ECCC) 5(65): (1998) |
46 | Zheng Zhang, Piotr Berman, Webb Miller: Alignments without Low-Scoring Regions. Journal of Computational Biology 5(2): 197-210 (1998) | |
1997 | ||
45 | Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter: On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM 1997: 40-51 | |
44 | Piotr Berman, Juan A. Garay: Competing against Specialists. PODC 1997: 284 | |
43 | EE | Piotr Berman, Chris Coulston: On-Line Algorithms for Steiner Tree Problems (Extended Abstract). STOC 1997: 344-353 |
42 | Piotr Berman, Moses Charikar, Marek Karpinski: On-line Load Balancing for Related Machines. WADS 1997: 116-125 | |
41 | Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller: A Linear-Time Algorithm for the 1-Mismatch Problem. WADS 1997: 126-135 | |
40 | Piotr Berman, Bhaskar DasGupta: Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. Algorithmica 17(4): 331-356 (1997) | |
39 | Piotr Berman, Krzysztof Diks, Andrzej Pelc: Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. J. Algorithms 22(2): 199-211 (1997) | |
38 | EE | Piotr Berman, Andrzej Lingas: A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. Theor. Comput. Sci. 174(1-2): 193-202 (1997) |
1996 | ||
37 | Piotr Berman, Sridhar Hannenhalli: Fast Sorting by Reversal. CPM 1996: 168-185 | |
36 | Piotr Berman: On-line Searching and Navigation. Online Algorithms 1996: 232-241 | |
35 | Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks: Randomized Robot Navigation Algorithms. SODA 1996: 75-84 | |
1995 | ||
34 | Vineet Bafna, Piotr Berman, Toshihiro Fujito: Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. ISAAC 1995: 142-151 | |
33 | Piotr Berman, Toshihiro Fujito: On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. WADS 1995: 449-460 | |
1994 | ||
32 | Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky: Approaching the 5/4-Approximation for Rectilinear Steiner Trees. ESA 1994: 60-71 | |
31 | Piotr Berman, Martin Fürer: Approximating Maximum Independent Set in Bounded Degree Graphs. SODA 1994: 365-371 | |
30 | Piotr Berman, Andrzej Lingas: A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. SWAT 1994: 73-82 | |
29 | EE | Mirjana Spasojevic, Piotr Berman: Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. IEEE Trans. Parallel Distrib. Syst. 5(1): 64-73 (1994) |
28 | Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan: Online Navigation in a Room. J. Algorithms 17(3): 319-341 (1994) | |
27 | Piotr Berman, Viswanathan Ramaiyer: Improved Approximations for the Steiner Tree Problem. J. Algorithms 17(3): 381-408 (1994) | |
1993 | ||
26 | Piotr Berman, Juan A. Garay: Randomized Distributed Agreement Revisited. FTCS 1993: 412-419 | |
25 | Piotr Berman, Anupam A. Bharali: Quick Atomic Broadcast (Extended Abstract). WDAG 1993: 189-203 | |
24 | Piotr Berman, Juan A. Garay: Fast Consensus in Networks of Bounded Degree. Distributed Computing 7(2): 67-73 (1993) | |
23 | Piotr Berman, Juan A. Garay: Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds. Mathematical Systems Theory 26(1): 3-19 (1993) | |
1992 | ||
22 | Piotr Berman, Anupam A. Bharali: Distributed Consensus in Semi-Synchronous Systems. IPPS 1992: 632-635 | |
21 | EE | Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan: On-Line Navigation in a Room. SODA 1992: 237-249 |
20 | EE | Piotr Berman, Viswanathan Ramaiyer: Improved Approximations for the Steiner Tree Problem. SODA 1992: 325-334 |
19 | Piotr Berman, Juan A. Garay, Kenneth J. Perry: Optimal Early Stopping in Distributed Consensus (Extended Abstract). WDAG 1992: 221-237 | |
18 | Piotr Berman, Georg Schnitger: On the Complexity of Approximating the Independent Set Problem Inf. Comput. 96(1): 77-94 (1992) | |
1991 | ||
17 | Piotr Berman, Juan A. Garay: Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). WDAG 1991: 129-142 | |
1990 | ||
16 | Piotr Berman, Howard J. Karloff, Gábor Tardos: A Competitive 3-Server Algorithm. SODA 1990: 280-290 | |
15 | Mirjana Obradovic, Piotr Berman: Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. SRDS 1990: 126-135 | |
14 | Mirjana Obradovic, Piotr Berman: Weighted Voting for Operation Dependent Management of Replicated Data. WDAG 1990: 263-276 | |
13 | Piotr Berman, Juan A. Garay: Fast Consensus in Networks of Bounded Degree (Extended Abstract). WDAG 1990: 321-333 | |
1989 | ||
12 | Piotr Berman, Juan A. Garay, Kenneth J. Perry: Towards Optimal Distributed Consensus (Extended Abstract) FOCS 1989: 410-415 | |
11 | Piotr Berman, Juan A. Garay: Asymptotically Optimal Distributed Consensus (Extended Abstract). ICALP 1989: 80-94 | |
10 | Piotr Berman, Juan A. Garay: Efficient Agreement on Bounded-Degree Networks. ICPP (1) 1989: 188-191 | |
9 | Piotr Berman, Georg Schnitger: On the Complexity of Approximating the Independent Set Problem. STACS 1989: 256-268 | |
1988 | ||
8 | Piotr Berman, Janos Simon: Investigations of Fault-Tolerant Networks of Computers (Preliminary Version) STOC 1988: 66-77 | |
1987 | ||
7 | Piotr Berman, Robert Roos: Learning One-Counter Languages in Polynomial Time (Extended Abstract) FOCS 1987: 61-67 | |
6 | Piotr Berman, Robert Roos: A Learning Algorithm for a Class of Context-Free Languages (Extended Abstract). ISMIS 1987: 317-324 | |
1983 | ||
5 | Piotr Berman: Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. FCT 1983: 14-25 | |
4 | Piotr Berman, Janos Simon: Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) FOCS 1983: 304-311 | |
1982 | ||
3 | Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn: On the Power of Nondeterminism in Dynamic Logic. ICALP 1982: 48-60 | |
1980 | ||
2 | Piotr Berman: A Note on Sweeping Automata. ICALP 1980: 91-97 | |
1978 | ||
1 | Piotr Berman: Relationship Between Density and Deterministic Complexity of NP-Complete Languages. ICALP 1978: 63-71 |