Arfst Nickelsen

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On polynomially \(\mathcal{D}\)-verbose sets Lecture Notes in Computer Science	2022-11-09	Paper
Mathematical Foundations of Computer Science 2005 Lecture Notes in Computer Science	2006-10-20	Paper
One query reducibilities between partial information classes Theoretical Computer Science	2005-12-06	Paper
The Complexity of Finding Paths in Graphs with Bounded Independence Number SIAM Journal on Computing	2005-09-16	Paper
Mathematical Foundations of Computer Science 2004 Lecture Notes in Computer Science	2005-08-22	Paper
Algebraic Properties for Selector Functions SIAM Journal on Computing	2005-02-21	Paper
scientific article; zbMATH DE number 2090011 (Why is no real title available?)	2004-08-12	Paper
scientific article; zbMATH DE number 1848275 (Why is no real title available?)	2003-02-25	Paper
scientific article; zbMATH DE number 1834678 (Why is no real title available?)	2002-11-25	Paper
scientific article; zbMATH DE number 1796952 (Why is no real title available?)	2002-09-05	Paper
scientific article; zbMATH DE number 1361501 (Why is no real title available?)	1997-01-01	Paper
scientific article; zbMATH DE number 512828 (Why is no real title available?)	1994-04-07	Paper

Research outcomes over time

This page was built for person: Arfst Nickelsen