The following pages link to Maria M. Klawe (Q1058850):
Displayed 39 items.
- Item:Q1058850 (redirect page) (← links)
- On pseudosimilarity in trees (Q791542) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- Item:Q1058850 (redirect page) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- Improved lower bounds for the cycle detection problem (Q1058851) (← links)
- Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- Generalized Ramsey theory for graphs, X: Double stars (Q1139609) (← links)
- Dimensions of the sets of invariant means of semigroups (Q1141310) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Semidirect product of semigroups in relation to amenability, cancellation properties, and strong Folner conditions (Q1249308) (← links)
- Optimal strategies for a fair betting game (Q1259519) (← links)
- Shallow grates (Q1314391) (← links)
- Supporting Women in Mathematics and computer science (Q2098547) (← links)
- On the Ramsey numbers of odd-linked double stars (Q2144597) (← links)
- Double-interval societies (Q2939699) (← links)
- Bounding Fan-out in Logical Networks (Q3030723) (← links)
- An Almost Linear Time Algorithm for Generalized Matrix Searching (Q3031930) (← links)
- (Q3138928) (← links)
- (Q3140420) (← links)
- Traditional Galleries Require Fewer Watchmen (Q3315525) (← links)
- Limitations on Explicit Constructions of Expanding Graphs (Q3323289) (← links)
- (Q3664859) (← links)
- Alphabetic Minimax Trees (Q3680759) (← links)
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks (Q3689205) (← links)
- (Q3722545) (← links)
- A tight bound for black and white pebbles on the pyramid (Q3769962) (← links)
- Residually-Complete Graphs (Q3897076) (← links)
- (Q3910555) (← links)
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle (Q3956422) (← links)
- Isomorphism Testing in Hookup Classes (Q3968949) (← links)
- Superlinear bounds for matrix searching problems (Q3990615) (← links)
- A Tight Lower Bound on the Size of Planar Permutation Networks (Q4030194) (← links)
- On the Dimension of Left Invariant Means and Left Thick Subsets (Q4147101) (← links)
- (Q4201938) (← links)
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees (Q4863980) (← links)