The following pages link to Teresa M. Przytycka (Q1350903):
Displaying 30 items.
- (Q242872) (redirect page) (← links)
- A simple, efficient algorithm for maximum finding on rings (Q671266) (← links)
- Grid intersection graphs and boxicity (Q685652) (← links)
- Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- On the agreement of many trees (Q1352115) (← links)
- A simple construction of high representativity triangulations (Q1367040) (← links)
- Parallel construction of binary trees with near optimal weighted path length (Q1907235) (← links)
- A parallel algorithm for optimum height-limited alphabetic binary trees (Q1923383) (← links)
- A sticky multinomial mixture model of strand-coordinated mutational processes in cancer (Q2415277) (← links)
- Scale-free networks versus evolutionary drift (Q2490535) (← links)
- An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees (Q2706115) (← links)
- (Q3024773) (← links)
- Parallel algorithms for parity graphs (Q3201757) (← links)
- On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs (Q3480059) (← links)
- An Important Connection Between Network Motifs and Parsimony Models (Q3596305) (← links)
- Asymptotically Optimal Election on Weighted Rings (Q4210174) (← links)
- The Optimal Alphabetic Tree Problem Revisited (Q4216143) (← links)
- (Q4273836) (← links)
- (Q4273852) (← links)
- A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees (Q4327425) (← links)
- (Q4375747) (← links)
- (Q4526970) (← links)
- The Optimal Alphabetic Tree problem revisited (Q4632431) (← links)
- (Q4818874) (← links)
- Constructing Huffman Trees in Parallel (Q4862791) (← links)
- When and How the Perfect Phylogeny Model Explains Evolution (Q4979478) (← links)
- Asymptotically optimal election on weighted rings (Q5054762) (← links)
- Optimal cost-sensitive distributed minimum spanning tree algorithm (Q5054817) (← links)
- On the complexity of string folding (Q5961626) (← links)
