AI & ChatGPT searches , social queries for ALGORITHMICA
Search references for ALGORITHMICA. Phrases containing ALGORITHMICA
See searches and references containing ALGORITHMICA!
Search references for ALGORITHMICA. Phrases containing ALGORITHMICA
See searches and references containing ALGORITHMICA!ALGORITHMICA
Academic journal
Algorithmica is a monthly peer-reviewed scientific journal focusing on research and the application of computer science algorithms. The journal was established
Algorithmica
Topics referred to by the same term
property right in an algorithm Algorithmics, the science of algorithms Algorithmica, an academic journal for algorithm research Algorithmic efficiency, the
Algorithmic
Data structure hashing scheme
and efficient hash families suffice for cuckoo hashing with a stash." Algorithmica 70.3 (2014): 428-456. Mitzenmacher, Michael (2009-09-09). "Some Open
Cuckoo_hashing
Triangulation method
"Randomized incremental construction of Delaunay and Voronoi diagrams". Algorithmica. 7 (1–6): 381–413. doi:10.1007/BF01758770. S2CID 3770886. de Berg, Mark;
Delaunay_triangulation
Mathematical models of strategic interactions
(January 1994). "On the power of randomization in on-line algorithms". Algorithmica. 11 (1): 2–14. doi:10.1007/BF01294260. S2CID 26771869. Downs, Anthony
Game_theory
Algorithmic technique using hashing
"Locality-Preserving Hash Functions for General Purpose Parallel Computation" (PDF). Algorithmica. 12 (2–3): 170–181. doi:10.1007/BF01185209. S2CID 18108051. Gionis, A
Locality-sensitive_hashing
Canadian computer scientist
Geometry and Applications. He is also a member of the editorial board of Algorithmica, Discrete & Computational Geometry, and Computational Geometry: Theory
Timothy_M._Chan
Constant exchange between memory and storage
5–29. doi:10.1016/j.peva.2004.10.002. "Cache Associativity - Algorithmica". en.algorithmica.org. Retrieved 2025-08-18. "Binary search is a pathological
Thrashing_(computer_science)
Describes approximate behavior of a function
{\mathcal {O}}^{*}(2^{p})} -Time Algorithm and a Polynomial Kernel, Algorithmica 80 (2018), no. 12, 3844–3860. Note that the "size" of the input is typically
Big_O_notation
Unrelated vertices in graphs
Lapinskas, John (2019-10-01). "A Fixed-Parameter Perspective on #BIS". Algorithmica. 81 (10): 3844–3864. arXiv:1702.05543. doi:10.1007/s00453-019-00606-4
Independent set (graph theory)
Independent_set_(graph_theory)
Dumitrescu, Adrian; Jiang, Minghui (2010). "On covering problems of Rado". Algorithmica. 57 (3): 538–561. doi:10.1007/s00453-009-9298-z. MR 2609053. S2CID 6511998
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Unsolved problem in computer science
resolutions to the average-case complexity question. These range from "Algorithmica", where P = NP and problems like SAT can be solved efficiently in all
P_versus_NP_problem
was done by Devroye, Mucke and Zhu in mid-1990s (the paper appeared in Algorithmica, 1998). The analysis on 3D random Delaunay triangulation was done by
Jump-and-Walk_algorithm
Every simple polygon with more than three vertices has at least two ears
(2001), "FIST: fast industrial-strength triangulation of polygons", Algorithmica, 30 (4): 563–596, doi:10.1007/s00453-001-0028-4, MR 1829495, S2CID 1317227
Two_ears_theorem
Graph drawing with vertices in horizontal layers
Nicholas C. (1994), "Edge crossings in drawings of bipartite graphs", Algorithmica, 11 (4): 379–403, doi:10.1007/BF01187020, S2CID 22476033. Mäkinen, E
Layered_graph_drawing
Largest integer that divides given integers
Goldreich, O. (1990). "An improved parallel algorithm for integer GCD". Algorithmica. 5 (1–4): 1–10. doi:10.1007/BF01840374. S2CID 17699330. Adleman, L. M
Greatest_common_divisor
String searching algorithm
Maxime; et al. (1994). "Speeding Up Two String-Matching Algorithms". Algorithmica. 12 (24): 247–267. doi:10.1007/BF01185427. Haertel, Mike (21 August 2010)
Boyer–Moore string-search algorithm
Boyer–Moore_string-search_algorithm
Polyhedron with 6 faces
Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra", Algorithmica, 61 (4): 1022–1076, doi:10.1007/s00453-011-9570-x, MR 2852056
Hexahedron
Algorithm to be run on quantum computers
Nayak, A. (2007). "Quantum Complexity of Testing Group Commutativity". Algorithmica. 48 (3): 221–232. arXiv:quant-ph/0506265. doi:10.1007/s00453-007-0057-8
Quantum_algorithm
Cryptographic attack
Naughton, Jeffrey F. (March 1993). "Clocked adversaries for hashing". Algorithmica. 9 (3): 239–252. doi:10.1007/BF01190898. S2CID 19163221. Reparaz, Oscar;
Timing_attack
Procedure for finding a stable matching
"Almost stable matchings by truncating the Gale–Shapley algorithm". Algorithmica. 58 (1): 102–118. arXiv:0812.4893. doi:10.1007/s00453-009-9353-9. Manne
Gale–Shapley_algorithm
Canadian cryptographer (born c. 1970)
ISBN 978-0-19-857049-3 Algorithmica: Special Issue on Quantum Computation and Cryptography. (2002). Michele Mosca and Alain Tapp, Eds. Algorithmica 34 (4). List
Michele_Mosca
Unsolved problem in graph theory
(1992-06-01). "A proof of the Gilbert-Pollak conjecture on the Steiner ratio". Algorithmica. 7 (1): 121–135. doi:10.1007/BF01758755. ISSN 0178-4617. S2CID 36038781
Gilbert–Pollak_conjecture
Branch of computer science
Surveys ACM Transactions on Graphics Acta Informatica Advances in Geometry Algorithmica Ars Combinatoria Computational Geometry: Theory and Applications Communications
Computational_geometry
3D printing technique
Wilfong, G.; Zhu, B. (1997). "Feasibility of Design in Stereolithography". Algorithmica. 19 (1): 61–83. doi:10.1007/PL00014421. ISSN 0178-4617. Crivello, James
Stereolithography
Problem in graph theory
Mnich, M. (2015), "Max-cut parameterized above the Edwards–Erdős bound", Algorithmica, 72 (3): 734–757, doi:10.1007/s00453-014-9870-z, S2CID 14973734. Dunning
Maximum_cut
American computer scientist
Journal, March, 1998. Pairing Heaps: A New Form of Self-Adjusting Heap. Algorithmica 1, 1, 1986. The Analysis of Quicksort Programs. Acta Informatica 7, 1977
Robert Sedgewick (computer scientist)
Robert_Sedgewick_(computer_scientist)
Tree containing all suffixes of a given text
(1988), "Parallel construction of a suffix tree with applications", Algorithmica, 3 (1–4): 347–365, doi:10.1007/bf01762122, S2CID 5024136. Baeza-Yates
Suffix_tree
Mathematical problem
"Inapproximability results for guarding polygons and terrains" (PDF), Algorithmica, 31 (1): 79–113, doi:10.1007/s00453-001-0040-8, S2CID 14532511, archived
Art_gallery_problem
Shell command for comparing file content
E. Myers (1986). "An O(ND) Difference Algorithm and Its Variations". Algorithmica. 1 (2): 251–266. CiteSeerX 10.1.1.4.6927. doi:10.1007/BF01840446. S2CID 6996809
Diff
Subgraph with contracted edges
Dimitrios M. (2012-09-01). "Fast Minor Testing in Planar Graphs" (PDF). Algorithmica. 64 (1): 69–84. doi:10.1007/s00453-011-9563-9. ISSN 0178-4617. S2CID 6204674
Graph_minor
Search algorithm finding the position of a target value within a sorted array
complexities of ordered searching, sorting, and element distinctness". Algorithmica. 34 (4): 429–448. arXiv:quant-ph/0102078. doi:10.1007/s00453-002-0976-3
Binary_search
Algorithms, San Francisco, CA, 22–24 January 1990, pp. 301-309. Also in Algorithmica, 11(6): 542-571, 1994. http://courses.csail.mit.edu/6.895/fall03/handouts/papers/karlin
Ski_rental_problem
Number denoting a graph's closeness to a tree
(2007). Amir, Eyal (2010), "Approximation algorithms for treewidth", Algorithmica, 56 (4): 448–479, doi:10.1007/s00453-008-9180-4, MR 2581059, S2CID 5874913
Treewidth
French computer scientist (1948–2011)
Combinatorics and Analysis of Algorithms" by H. Prodinger and W. Szpankowski, Algorithmica 22 (1998), 366–387. At the time of his death from a serious illness,
Philippe_Flajolet
Algorithm for the kth smallest element in an array
Luc (2001). "On the probabilistic worst-case time of 'find'" (PDF). Algorithmica. 31 (3): 291–303. doi:10.1007/s00453-001-0046-2. MR 1855252. Blum-style
Quickselect
Problem of finding the longest simple path for a given graph
Ramkumar, G. D. S. (1997), "On approximating the longest path in a graph", Algorithmica, 18 (1): 82–98, doi:10.1007/BF02523689, MR 1432030, S2CID 3241830. Alon
Longest_path_problem
Graph that can be embedded in the plane
algorithm to find a rectangular dual of a planar triangulated graph", Algorithmica, 3 (1–4): 247–278, doi:10.1007/BF01762117, S2CID 2709057. Hakimi, S.
Planar_graph
Concept in computer science
(1986). "The pairing heap: a new form of self-adjusting heap" (PDF). Algorithmica. 1 (1): 111–129. doi:10.1007/BF01840439. Cormen, Thomas H.; Leiserson
Left-child right-sibling binary tree
Left-child_right-sibling_binary_tree
Size of bounding box of graph drawing
T. M. (2002), "A near-linear area bound for drawing binary trees", Algorithmica, 34 (1): 1–13, doi:10.1007/s00453-002-0937-x, MR 1912924, S2CID 5122671
Area_(graph_drawing)
Type of computational problem
Dumitrescu, Adrian; Jiang, Minghui (2010), "On covering problems of Rado", Algorithmica, 57 (3): 538–561, doi:10.1007/s00453-009-9298-z, MR 2609053; preliminary
Covering_problems
Dominating set that induces a connected subgraph
S. (1998), "Approximation algorithms for connected dominating sets", Algorithmica, 20 (4): 374–387, doi:10.1007/PL00009201, hdl:1903/830, S2CID 263230631
Connected_dominating_set
Intersection graph for a set of arcs on a circle
(2011-11-01). "A Simpler Linear-Time Recognition of Circular-Arc Graphs". Algorithmica. 61 (3): 694–737. CiteSeerX 10.1.1.76.2480. doi:10.1007/s00453-010-9432-y
Circular-arc_graph
Linear programming algorithm
"A Modification of Karmarkar's Linear Programming Algorithm" (PDF). Algorithmica. 1 (1–4): 395–407. doi:10.1007/BF01840454. S2CID 779577. "Karmarkar Algorithm"
Karmarkar's_algorithm
Combinatorial optimization graph problem
Hassin, R. (1999), "Approximation algorithms for minimum k-cut" (PDF), Algorithmica, pp. 198–207 Comellas, Francesc; Sapena, Emili (2006), "A multiagent
Minimum_k-cut
Algorithmic problem of finding non-crossing drawings
Phase of the Hopcroft and Tarjan Planarity Testing Algorithm" (PDF), Algorithmica, 16 (2): 233–242, doi:10.1007/bf01940648, hdl:11858/00-001M-0000-0014-B51D-B
Planarity_testing
Rooted binary tree data structure
standard deletion algorithms in exact fit domain binary search trees". Algorithmica. 5 (1–4). Springer Publishing, University of Waterloo: 297. doi:10.1007/BF01840390
Binary_search_tree
Maximal biconnected subgraph
"Maintaining bridge-connected and biconnected components on-line". Algorithmica. 7 (1–6): 433–464. doi:10.1007/BF01758773. Tarjan, R.; Vishkin, U. (1985)
Biconnected_component
Belgian computer scientist and mathematician
Q. Iacono, John; Langerman, Stefan (2005), "Queaps", Algorithmica, 42 (1): 49–56, doi:10.1007/s00453-004-1139-5, MR 2131828
Stefan_Langerman
Cycles in a graph that generate all cycles
Romeo (2009), "Minimum weakly fundamental cycle bases are hard to find", Algorithmica, 53 (3): 402–424, doi:10.1007/s00453-007-9112-8, MR 2482112, S2CID 12675654
Cycle_basis
Geometric shape formed from squares
upper bounds on the growth constants of polyominoes and polycubes". Algorithmica. 84 (12): 3559–3586. arXiv:1906.11447. doi:10.1007/s00453-022-00948-6
Polyomino
Combinatorial optimization problem
Approximations for k-Center Problems in Low Highway Dimension Graphs" (PDF). Algorithmica. 81 (3): 1031–1052. doi:10.1007/s00453-018-0455-0. ISSN 1432-0541. S2CID 46886829
Metric_k-center
"Average-Case Analysis of the Modified Harmonic Algorithm for Bin Packing". Algorithmica. Springer. doi:10.1007/BF01553906. S2CID 1031272. "Kazuhiro Tsuga Bloomberg
Kazuhiro_Tsuga
Planar graph with convex polygon faces
Kant, G. (1996), "Drawing planar graphs using the canonical ordering", Algorithmica, 16 (1): 4–32, doi:10.1007/s004539900035, hdl:1874/16676, MR 1394492
Convex_drawing
Field of study of computational systems
Conference on Computer Vision International Conference on Machine Learning Algorithmica Symposium on Foundations of Computer Science) European Symposium on Algorithms
Informatics
Data structure for priority queue operations
(1986). "The pairing heap: a new form of self-adjusting heap" (PDF). Algorithmica. 1 (1–4): 111–129. doi:10.1007/BF01840439. S2CID 23664143. http://www
Fibonacci_heap
Abstract data type
Robert (1987). "Geometric applications of a matrix-searching algorithm". Algorithmica. 2 (1–4): 195–208. doi:10.1007/BF01840359. MR 0895444. S2CID 7932878
Stack_(abstract_data_type)
Shape bounded by non-intersecting line segments
visibility and shortest path problems inside triangulated simple polygons". Algorithmica. 2 (2): 209–233. doi:10.1007/BF01840360. MR 0895445. El Gindy, Hossam;
Simple_polygon
Problem in combinatorial optimization
September 2014). "Online Unweighted Knapsack Problem with Removal Cost". Algorithmica. 70 (1): 76–91. doi:10.1007/s00453-013-9822-z. ISSN 1432-0541. Han, Xin;
Knapsack_problem
1996. Eugene Myers, An O(ND) Difference Algorithm and Its Variations, Algorithmica Vol. 1 No. 2, pp. 251-266, 1986. Gregor Kiczales, Jim Des Rivieres, Daniel
Gauche (Scheme implementation)
Gauche_(Scheme_implementation)
Construct in computational geometry
refined. Chew, L. Paul (1989), "Constrained Delaunay triangulations", Algorithmica, 4 (1): 97–108, doi:10.1007/BF01553881, MR 0983658, S2CID 189918468 Shewchuk
Constrained Delaunay triangulation
Constrained_Delaunay_triangulation
Sorting algorithm using the heap data structure
"A tight lower bound for the worst case of Bottom-Up-Heapsort" (PDF). Algorithmica. 11 (2): 104–115. doi:10.1007/bf01182770. hdl:11858/00-001M-0000-0014-7B02-C
Heapsort
Academic journal
Journals with similar scope include: ACM Transactions on Algorithms Algorithmica Journal of Algorithms (Elsevier) Iwama, Kazuo (2008). "Editor's Foreword"
Algorithms_(journal)
Maximum number of colors in a greedy graph coloring
publisher (link) Irani, Sandy (1994), "Coloring inductive graphs on-line", Algorithmica, 11 (1): 53–72, doi:10.1007/BF01294263, MR 1247988, S2CID 181800. Narayanaswamy
Grundy_number
Intersection graph for curves in the plane
Rzążewski, Paweł (2019), "Optimality program in segment and string graphs", Algorithmica, 81 (7): 3047–3073, doi:10.1007/s00453-019-00568-7, MR 3948280. Chalopin
String_graph
(2007). "Algorithms for graphs embeddable with few crossings per edge". Algorithmica. 49 (1): 1–11. CiteSeerX 10.1.1.61.3576. doi:10.1007/s00453-007-0010-x
List_of_NP-complete_problems
Graph which can be made planar by removing a single node
"Diameter and treewidth in minor-closed graph families, revisited", Algorithmica, 40 (3): 211–215, doi:10.1007/s00453-004-1106-1 (inactive 30 January
Apex_graph
Indian-American computer scientist
and has previously served on the editorial boards of SICOMP, ACM TALG, Algorithmica, JCSS, and as an area editor for Encyclopaedia of Algorithms. In 2018
Sanjeev_Khanna
American computer scientist
Rudolph, Larry; Sleator, Daniel D. (1988), "Competitive snoopy caching", Algorithmica, 3 (1): 79–119, doi:10.1007/BF01762111, MR 0925479, S2CID 33446072 Fox
Daniel_Sleator
Computer programming method for hashing
(PDF), Algorithmica, 22 (4): 490–515, doi:10.1007/PL00009236, MR 1701625, S2CID 5436036 Knuth, D. E. (1998), "Linear probing and graphs", Algorithmica, 22
Linear_probing
Measurement of graph sparsity
"Forests, frames, and games: algorithms for matroid sums and applications", Algorithmica, 7 (1): 465–497, doi:10.1007/BF01758774, S2CID 40358357 Gaertler, Marco;
Degeneracy_(graph_theory)
Approximations for k-Center Problems in Low Highway Dimension Graphs". Algorithmica. 81 (3): 1031–1052. arXiv:1605.02530. doi:10.1007/s00453-018-0455-0.
Highway_dimension
All even-degree subgraphs of a graph
Romeo (2009), "Minimum weakly fundamental cycle bases are hard to find", Algorithmica, 53 (3): 402–424, doi:10.1007/s00453-007-9112-8, MR 2482112. Diestel
Cycle_space
American mathematician (1935–2020)
"Scheduling partially ordered jobs faster than 2 n {\displaystyle 2^{n}} ". Algorithmica. 68 (3): 692–714. arXiv:1108.0810. doi:10.1007/s00453-012-9694-7. MR 3160651
Ronald_Graham
Problem in computational complexity theory
1145/3185378, MR 3795516 Freund, Ari (2017), "Improved Subquadratic 3SUM", Algorithmica, 44 (2): 440–458, doi:10.1007/s00453-015-0079-6, S2CID 253979651. Gold
3SUM
payoff games and discounted payoff games are all LP-type problems", Algorithmica, 49 (1): 37–50, doi:10.1007/s00453-007-0175-3, MR 2344393, S2CID 8183965
LP-type_problem
Concept in computer science
(1994). "On the Power of Randomization in On-line Algorithms" (PDF). Algorithmica. 11: 2–14. doi:10.1007/BF01294260. Bibliography of papers on online algorithms
Adversary_model
Sharpest angle between edges at a vertex
Kant, G. (1996), "Drawing planar graphs using the canonical ordering", Algorithmica, 16 (1): 4–32, doi:10.1007/s004539900035, hdl:1874/16676, MR 1394492
Angular resolution (graph drawing)
Angular_resolution_(graph_drawing)
Type of algorithm
Approximations for k-Center Problems in Low Highway Dimension Graphs". Algorithmica. 81 (3): 1031–1052. arXiv:1605.02530. doi:10.1007/s00453-018-0455-0.
Parameterized approximation algorithm
Parameterized_approximation_algorithm
Statistical method for fitting a line
"Efficient randomized algorithms for the repeated median line estimator", Algorithmica, 20 (2): 136–150, doi:10.1007/PL00009190, MR 1484533, S2CID 17362967
Theil–Sen_estimator
Stanford University. Retrieved 26 April 2025. "Eytzinger Binary Search - Algorithmica". Retrieved 2023-04-09. Montanaro, Ashley (2016). "Quantum algorithms:
List_of_algorithms
Indian mathematician
Linear Threshold functions," with A. Blum, A. Frieze and S. Vempala, Algorithmica 22:35–52, 1998. "Covering Minima and lattice point free convex bodies
Ravindran_Kannan
SIGSPATIAL, the Journal of Discrete Algorithms, Information Systems and Algorithmica. He created the Workshop on Compression, Text and Algorithms (WCTA) in
Gonzalo_Navarro
List of academic journals focused on software programming
Software Engineering and Methodology ACM Transactions on Algorithms Algorithmica Algorithms (journal) Information Processing Letters Journal of Algorithms
List of software programming journals
List_of_software_programming_journals
Binary operation in graph theory
(2021), "A fast algorithm for the product structure of planar graphs", Algorithmica, 83 (5): 1544–1558, arXiv:2004.02530, doi:10.1007/s00453-020-00793-5
Strong_product_of_graphs
Academic journal
(2005–2008) Susanne Albers (2008–2014) Aravind Srinivasan (2014–2021) Algorithmica Algorithms (journal) Gabow, Hal. "Journal of Algorithms Resignation"
ACM Transactions on Algorithms
ACM_Transactions_on_Algorithms
Australian computer scientist
1988. 1993. "An opportunistic global path planner". With M. C. Lin. In: Algorithmica vol. 10, no. 2–4, pp. 102–120, Aug. 1993. 2007. "MultiView: Improving
John_Canny
Quantum key distribution protocol - B92
3390/photonics12030220. Inamori, H. (2002). "Security of practical B92 quantum key distribution". Algorithmica. 34 (4): 340–365. doi:10.1007/BF00191318.
B92_protocol
Problem of computing shortest paths around geometric obstacles
(2001), "Approximating shortest paths on weighted polyhedral surfaces", Algorithmica, pp. 527–562. Lee, D. T.; Preparata, F. P. (1984), "Euclidean shortest
Euclidean_shortest_path
Finnish theoretical computer scientist (born 1950)
(2014). Ukkonen, E. (1995). "On-line construction of suffix trees". Algorithmica. 14 (3): 249–260. CiteSeerX 10.1.1.10.751. doi:10.1007/BF01206331. ISSN 0178-4617
Esko_Ukkonen
Engineering and Methodology Acta Informatica Adaptive Behavior ALGOL Bulletin Algorithmica Algorithms Applied Artificial Intelligence Archives of Computational
List of computer science journals
List_of_computer_science_journals
Graph representing leaves of a given tree graph
"Parameterized Leaf Power Recognition via Embedding into Graph Products". Algorithmica. 82 (8): 2337–2359. arXiv:1810.02452. doi:10.1007/s00453-020-00720-8
Leaf_power
Austrian-American mathematician (1927–2026)
(2012). "The Steiner ratio Gilbert-Pollak conjecture is still open". Algorithmica. 62 (1–2): 630–632. doi:10.1007/s00453-011-9508-3. MR 2886059. Albers
Henry_O._Pollak
American computer scientist
implementing the push-relabel method for the maximum flow problem", Algorithmica, 19 (4): 390–410, doi:10.1007/PL00009180, MR 1470042, S2CID 10774110
Andrew_V._Goldberg
Edge whose deletion would disconnect a graph
"Maintaining bridge-connected and biconnected components on-line", Algorithmica, 7 (5–6): 433–464, doi:10.1007/BF01758773, MR 1154584. Robbins, H. E
Bridge_(graph_theory)
Subset of a graph's nodes such that all other nodes link to at least one
(1998), "Approximation algorithms for connected dominating sets" (PDF), Algorithmica, 20 (4): 374–387, doi:10.1007/PL00009201, hdl:1903/830, S2CID 1249122
Dominating_set
Optimization problem in computer science
Yannis (1 February 2002). "Scheduling Independent Multiprocessor Tasks". Algorithmica. 32 (2): 247–261. doi:10.1007/s00453-001-0076-9. ISSN 1432-0541. S2CID 17256951
Parallel_task_scheduling
Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields", Algorithmica, vol. 24, no. 3–4, pp. 311–348, CiteSeerX 10.1.1.17.7470, doi:10.1007/PL00008266
Matrix-free_methods
American computer scientist
M. (April 1998), "String matching in Lempel-Ziv compressed strings", Algorithmica, 20 (4): 388–404, CiteSeerX 10.1.1.45.5484, doi:10.1007/PL00009202, MR 1600834
Martin_Farach-Colton
On linear-time algorithms for graph logic
descriptions of problems on recursively constructed graph families", Algorithmica, 7 (5–6): 555–581, doi:10.1007/BF01758777, MR 1154588, S2CID 22623740
Courcelle's_theorem
ALGORITHMICA
ALGORITHMICA
ALGORITHMICA
ALGORITHMICA
ALGORITHMICA
ALGORITHMICA
ALGORITHMICA
ALGORITHMICA
ALGORITHMICA