Related Research Articles
A triangulation of a set of points in the Euclidean space is a simplicial complex that covers the convex hull of , and whose vertices belong to . In the plane, triangulations are made up of triangles, together with their edges and vertices. Some authors require that all the points of are vertices of its triangulations. In this case, a triangulation of a set of points in the plane can alternatively be defined as a maximal set of non-crossing edges between points of . In the plane, triangulations are special cases of planar straight-line graphs.
David Arthur Eppstein is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
A sorting algorithm falls into the adaptive sort family if it takes advantage of existing order in its input. It benefits from the presortedness in the input sequence – or a limited amount of disorder for various definitions of measures of disorder – and sorts faster. Adaptive sorting is usually performed by modifying existing sorting algorithms.
Algorithmic Number Theory Symposium (ANTS) is a biennial academic conference, first held in Cornell in 1994, constituting an international forum for the presentation of new research in computational number theory. They are devoted to algorithmic aspects of number theory, including elementary number theory, algebraic number theory, analytic number theory, geometry of numbers, arithmetic geometry, finite fields, and cryptography.
The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track, of the convex hull for input data undergoing a sequence of discrete changes, i.e., when input data elements may be inserted, deleted, or modified. It should be distinguished from the kinetic convex hull, which studies similar problems for continuously moving points. Dynamic convex hull problems may be distinguished by the types of the input data and the allowed types of modification of the input data.
Andrew Zisserman is a British computer scientist and a professor at the University of Oxford, and a researcher in computer vision. As of 2014 he is affiliated with DeepMind.
Jörg-Rüdiger Wolfgang Sack is a professor of computer science at Carleton University, where he is Chancellor's Professor. </ref> Sack received a master's degree from the University of Bonn in 1979 and a Ph.D. in 1984 from McGill University, under the supervision of Godfried Toussaint. He is co-editor-in-chief and executive editor of the journal Computational Geometry: Theory and Applications, co-editor of the Handbook of Computational Geometry, and co-editor of the proceedings of the biennial Algorithms and Data Structures Symposium (WADS). He was a co-founding editor-in-chief of the open access Journal of Spatial Information Science but is no longer an editor there. Sack's research interests include computational geometry, data structures and geographic information systems.
In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of the random-access machine in which the machine word size is assumed to match the problem size. The model was proposed by Michael Fredman and Dan Willard, who chose its name "because the dichotomy between the machine model and the problem size is crossed in a reasonable manner."
Peter D. Eades is an Australian computer scientist, an emeritus professor in the School of Information Technologies at the University of Sydney, known for his expertise in graph drawing.
RP, the International Conference on Reachability Problems is an annual academic conference in the field of computer science.
FCT, the International Symposia on Fundamentals of Computation Theory is a biennial series of conferences in the field of theoretical computer science. It was established in 1977 for researchers interested in all aspects of theoretical computer science, and in particular algorithms, computational complexity, formal and logical methods. FCT was previously held at the following institutions.
Gad Menahem Landau is an Israeli computer scientist noted for his contributions to combinatorial pattern matching and string algorithms and is the founding department chair of the Computer Science Department at the University of Haifa.
Deborah A. Joseph is an American computer scientist known for her research in computational geometry, computational biology, and computational complexity theory. She is a professor emeritus of computer science at the University of Wisconsin–Madison.
In economics, a budget-additive valuation is a kind of a utility function. It corresponds to a person that, when given a set of items, evaluates them in the following way:
Hartmut Ehrig was a German computer scientist and professor of theoretical computer science and formal specification. He was a pioneer in algebraic specification of abstract data types, and in graph grammars.
Pagh's problem is a datastructure problem often used when studying lower bounds in computer science named after Rasmus Pagh. Mihai Pătrașcu was the first to give lower bounds for the problem. In 2021 it was shown that, given popular conjectures, the naive linear time algorithm is optimal.
References
- Chazelle, Bernard; et al. (1996), "Application Challenges to Computational Geometry: CG Impact Task Force Report", in Chazelle, Bernard; Goodman, Jacob E.; Pollack, Richard (eds.), Advances in Discrete and Computational Geometry: Proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry–Ten Years Later, July 14–18, 1996, Mount Holyoke College, American Mathematical Soc., ISBN 978-0-8218-0674-6 . Also available as a Princeton University technical report TR-521-96. Section 13.2 mentions the following conferences (in this order) as examples of "major algorithms conferences" with "a large amount of geometry": SODA, ISAAC, ESA, WADS, SWAT.
- Navarro, Gonzalo; Raffinot, Mathieu (2002), Flexible Pattern Matching in Strings, Cambridge University Press, ISBN 978-0-521-81307-5 . Section 7.3.2 mentions the following conferences (in this order) as examples of conferences that publish articles on pattern matching (in addition to more narrow conferences CPM, COCOON, RECOMB, SPIRE, ISMB): DCC, ESA, FOCS, FSTTCS, ICALP, ISAAC, MFCS, SODA, STACS, STOC, SWAT, WAE, WADS.
- The 2007 Australian Ranking of ICT Conferences. Conferences on tier A ("... would add to the author's respect...") include SWAT and WADS.
