Comment: Just being a full Professor does not prove notability. There is nothing here about his awards or citations that show that he passes WP:NPROF, as his name is quite common. This must be proved. Ldm1954 (talk) 00:14, 21 June 2025 (UTC)
 | This is a draft article. It is a work in progress open to editing by anyone. Please ensure core content policies are met before publishing it as a live Wikipedia article. Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL Last edited by Citation bot (talk | contribs) 2 months ago. (Update)
Finished drafting? or |
Arne Andersson | |
|---|---|
| Born | Arne Andersson December 7, 1957 |
| Education | PhD |
| Known for | Algorithms and data structures |
| Spouse | Kerstin Andersson |
| Scientific career | |
| Fields | Computer science |
| Institutions | Lund University Uppsala University |
| Thesis | Efficient Search Trees (1990) |
| Doctoral advisor | Svante Carlsson |
| Website | user |
Arne Andersson (born December 7, 1957) is a Swedish computer scientist. He is mostly known for work in data structures, sorting and searching.
Personal life, education and Career
editHe was born in Västervik, Sweden. Earning High School Degree (studentexamen) in 1976, he continued to earn a Teacher's Certificate in the sciences in 1981. He served as a high-school teacher from 1981 to 1984. He obtained his PhD degree in 1990, at Lund University, for his dissertation Efficient Search Trees. He was a researcher in Lund University from 1990 to 1998, and then moved to Uppsala University, where he is a professor.
Notable Works
editAmong Andersson's most cited publications are:
- Andersson, Arne (1993). "Balanced search trees made simple". Workshop on algorithms and data structures. Springer. pp. 60–71., where he presented AA trees
- Andersson, Arne; Nilsson, Stefan (1994). "A New Efficient Radix Sort". 35th Annual Symposium on Foundations of Computer Science. IEEE. pp. 714–721., which introduced Forward Radix Sort, a version of radix sort with attractive complexity when sorting strings
- Andersson, Arne; Hagerup, Torben; Nilsson, Stefan; Raman, Rajeev (1995). "Sorting in linear time?". Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. ACM. pp. 427–436., where a word RAM sorting algorithm is given, which runs in time, or randomized linear time when words are large enough.
External links
edit- Arne Andersson at DBLP Bibliography Server
- Arne Andersson's home page at Uppsala.
- Arne Andersson at the Mathematics Genealogy Project