The following pages link to Marcos A. Kiwi (Q1261470):
Displaying 38 items.
- (Q299047) (redirect page) (← links)
- (Q1349713) (redirect page) (← links)
- Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048) (← links)
- Repetition-free longest common subsequence of random sequences (Q299053) (← links)
- Electronic jury voting protocols (Q596143) (← links)
- On-line approximate string matching with bounded errors (Q653329) (← links)
- The chilean highway problem (Q703556) (← links)
- Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs (Q1010870) (← links)
- A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer (Q1184549) (← links)
- Games on line graphs and sand piles (Q1261471) (← links)
- No polynomial bound for the period of the parallel chip firing game on graphs (Q1349717) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Spectral gap of random hyperbolic graphs and related parameters (Q1650095) (← links)
- Satisfying states of triangulations of a convex \(n\)-gon (Q2380473) (← links)
- Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings (Q2449125) (← links)
- A concentration bound for the longest increasing subsequence of a randomly chosen involution (Q2500530) (← links)
- Expected length of the longest common subsequence for large alphabets (Q2573406) (← links)
- Approximate testing with relative error (Q2819533) (← links)
- Counting perfect matchings in the geometric dual (Q2840713) (← links)
- FIFO Queues Are Bad for Rumor Spreading (Q2989648) (← links)
- (Q3044343) (← links)
- Linearity testing in characteristic two (Q3129465) (← links)
- Adaptive Rumor Spreading (Q3460795) (← links)
- On-Line Approximate String Matching with Bounded Errors (Q3506948) (← links)
- (Q4218415) (← links)
- (Q4252728) (← links)
- (Q4736880) (← links)
- Largest planar matching in random bipartite graphs (Q4803315) (← links)
- (Q4890454) (← links)
- A Bound for the Diameter of Random Hyperbolic Graphs (Q5194791) (← links)
- On the Second Largest Component of Random Hyperbolic Graphs (Q5244122) (← links)
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)
- LATIN 2004: Theoretical Informatics (Q5901650) (← links)
- Quasi-random words and limits of word sequences (Q5918087) (← links)
- Quasi-random words and limits of word sequences (Q5918511) (← links)
- Min-max-boundary domain decomposition (Q5941438) (← links)
- Alternation in interaction (Q5946704) (← links)
- Cover and hitting times of hyperbolic random graphs (Q6591880) (← links)
- Cover and hitting times of hyperbolic random graphs (Q6641071) (← links)
