How to read the markscited by a repository's recordstated by Wikidata or indexed by OpenAlexclaimed on an ORCID list, or inferred
Theses1
- cited by a thesis record
Scalable Machine Learning through Approximation and Distributed Computing
2019 · KTH · doctoral · Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Beräkningsvetenskap och beräkningsteknik (CST) · in English · the thesis's own page ›also named on this thesis
- cited by a thesis recordIndre Žliobaitėopponent
Advisors4
- cited by a thesis record
Henrik Boström“Scalable Machine Learning through Approximation and Distributed Computing”
2019 · KTH · doctoral - cited by a thesis record
Daniel Gillblad“Scalable Machine Learning through Approximation and Distributed Computing”
2019 · KTH · doctoral - cited by a thesis record
Anders Holst“Scalable Machine Learning through Approximation and Distributed Computing”
2019 · KTH · doctoral - cited by a thesis record
Seif Haridi“Scalable Machine Learning through Approximation and Distributed Computing”
2019 · KTH · doctoral
The line above and below2 steps
The advisors of their advisors, four steps up at most, in the thesis records and on Wikidata, each kind marked; a person in both is listed once.
- 1 step up
cited by a thesis recordAnders Holstcited by a thesis recordDaniel Gillbladcited by a thesis recordHenrik Boströmcited by a thesis recordSeif Haridi
- 2 steps up
cited by a thesis recordAnders Lansner
Works1
2019 · held from 1 repository · a work missing?
- cited by DiVA's record
Scalable Machine Learning through Approximation and Distributed Computing
2019 · doctoral thesis · DiVA
What their ORCID record lists
The works their own ORCID record lists, as they claim them: shown apart from the record's works, never checked or counted with them.
ORCID is asked for the list when this part is opened.