The following pages link to Srečko Brlek (Q265057):
Displaying 50 items.
- Efficient operations on discrete paths (Q265059) (← links)
- (Q350724) (redirect page) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- (Q423903) (redirect page) (← links)
- A parallelogram tile fills the plane by translation in at most two distinct ways (Q423904) (← links)
- Equations on palindromes and circular words (Q544873) (← links)
- Optimal word chains for the Thue-Morse word (Q582129) (← links)
- Complexity and palindromic defect of infinite words (Q620969) (← links)
- Two infinite families of polyominoes that tile the plane by translation in two distinct ways (Q638553) (← links)
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566) (← links)
- Palindromic complexity of codings of rotations (Q650872) (← links)
- Combinatorial variations on Cantor's diagonal (Q662034) (← links)
- Tilings by translation: enumeration by a rational language approach (Q815209) (← links)
- Combinatorial properties of smooth infinite words (Q818144) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Discrete sets with minimal moment of inertia (Q952455) (← links)
- On the tiling by translation problem (Q1003706) (← links)
- On the length of word chains (Q1108812) (← links)
- Efficient computation of addition chains (Q1340674) (← links)
- A note on differentiable palindromes. (Q1401323) (← links)
- Algorithms for polyominoes based on the discrete Green theorem (Q1775619) (← links)
- (Q1824699) (redirect page) (← links)
- Enumeration of factors in the Thue-Morse word (Q1824700) (← links)
- On a valuation of rational subsets of \(Z^{k}\) (Q1853733) (← links)
- A relative of the Thue-Morse sequence (Q1894002) (← links)
- Burrows-Wheeler transform of words defined by morphisms (Q2301759) (← links)
- Exhaustive generation of atomic combinatorial differential operators (Q2449048) (← links)
- Shuffle operations on discrete paths (Q2474227) (← links)
- Smooth words on 2-letter alphabets having same parity (Q2481962) (← links)
- Non-uniform random generation of generalized Motzkin paths (Q2491216) (← links)
- Cantorian tableaux and permanents (Q2565961) (← links)
- Smooth words over arbitrary alphabets (Q2566015) (← links)
- On the equivalence problem for succession rules (Q2566280) (← links)
- The discrete Green theorem and some applications in discrete geometry (Q2581344) (← links)
- Interactions between Digital Geometry and Combinatorics on Words (Q2789507) (← links)
- COMPLEXITY OF THE FIBONACCI SNOWFLAKE (Q2836505) (← links)
- Codings of rotations on two intervals are full (Q2851477) (← links)
- (Q2883386) (← links)
- (Q2888159) (← links)
- (Q3077342) (← links)
- Efficient Computation of the Outer Hull of a Discrete Path (Q3190071) (← links)
- Palindromic Complexity of Trees (Q3451098) (← links)
- Christoffel and Fibonacci Tiles (Q3648773) (← links)
- A Linear Time and Space Algorithm for Detecting Path Intersection (Q3648803) (← links)
- PCIF: An Algorithm for Lossless True Color Image Compression (Q3651617) (← links)
- (Q4428901) (← links)
- (Q4453472) (← links)
- (Q4591318) (← links)
- (Q4663912) (← links)
- Addition chains using continued fractions (Q4732098) (← links)