Heribert Vollmer 个人学术档案

引用次数

	总计	2019 年至今
引用	3838	870
h 指数	33	16
i10 指数	65	25

220

110

165

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202416 31 21 63 60 62 58 67 57 112 110 131 96 144 150 184 191 135 199 141 166 171 172 201 155 188 145 129 151 171 86

开放获取的出版物数量

查看全部

34 篇文章

4 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Arne MeierPrivatdozent, Institute of Theoretical Computer Science, Leibniz Universität Hannover在 thi.uni-hannover.de 的电子邮件经过验证
Henning SchnoorResearcher of Computer Science, Dept. of Computer Science, Kiel University在 ti.informatik.uni-kiel.de 的电子邮件经过验证
Juha KontinenProfessor, University of Helsinki, Finland在 helsinki.fi 的电子邮件经过验证
Thomas SchwentickProfessor of Computer Science, TU Dortmund University在 udo.edu 的电子邮件经过验证
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, Germany在 uni-jena.de 的电子邮件经过验证
Thomas SchneiderDept. of Mathematics and Computer Science, University of Bremen, Germany在 uni-bremen.de 的电子邮件经过验证
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of Rochester在 cs.rochester.edu 的电子邮件经过验证
Eric AllenderRutgers University在 cs.rutgers.edu 的电子邮件经过验证
Jonni VirtemaLecturer, University of Sheffield, UK在 sheffield.ac.uk 的电子邮件经过验证
Samir DattaProfessor of Computer Science, Chennai Mathematical Institute在 cmi.ac.in 的电子邮件经过验证
Edith HemaspaandraProfessor of Computer Science, RIT在 cs.rit.edu 的电子邮件经过验证
Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, India在 imsc.res.in 的电子邮件经过验证
Miika HannulaUniversity of Helsinki在 helsinki.fi 的电子邮件经过验证
Antti KuusistoAcademy Research Fellow, Tampere University在 tuni.fi 的电子邮件经过验证
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)在 buffalo.edu 的电子邮件经过验证
Raghavendra Rao B VIIT Madras在 cse.iitm.ac.in 的电子邮件经过验证
Georg GottlobProfessor of Informatics, University of Calabria在 unical.it 的电子邮件经过验证
Frederic GreenClark University在 clarku.edu 的电子邮件经过验证
Manindra AgrawalProfessor of Computer Science, IIT Kanpur在 iitk.ac.in 的电子邮件经过验证
Alan SelmanProfessor emeritus of computer science and engineering, University at Buffalo

关注

Heribert Vollmer

Professor für Theoretische Informatik, Leibniz Universität Hannover

在 thi.uni-hannover.de 的电子邮件经过验证 - 首页

Komplexitätstheorie Logik


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Introduction to circuit complexity: a uniform approach H Vollmer Springer Science & Business Media, 1999	797	1999
Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory E Bohler ACM SIGACT News 34 (4), 38-52, 2003	149	2003
On the power of polynomial time bit-reductions U Hertrampf, C Lautemann, T Schwentick, H Vollmer, KW Wagner [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993	136	1993
The satanic notations: counting classes beyond# P and other definitional adventures LA Hemaspaandra, H Vollmer ACM SIGACT News 26 (1), 2-13, 1995	126	1995
NondeterministicNC1Computation H Caussinus, P McKenzie, D Thérien, H Vollmer Journal of Computer and System Sciences 57 (2), 200-212, 1998	113	1998
A polynomial-time approximation scheme for base station positioning in UMTS networks M Galota, C Glaßer, S Reith, H Vollmer Proceedings of the 5th international workshop on Discrete algorithms and …, 2001	103	2001
The complexity of satisfiability problems: Refining Schaefer's theorem E Allender, M Bauland, N Immerman, H Schnoor, H Vollmer Journal of Computer and System Sciences 75 (4), 245-254, 2009	99*	2009
The complexity of base station positioning in cellular networks C Glaßer, S Reith, H Vollmer Discrete Applied Mathematics 148 (1), 1-12, 2005	93	2005
Playing with Boolean blocks, part II: Constraint satisfaction problems E Böhler, N Creignou, S Reith, H Vollmer ACM SIGACT-Newsletter 35 (1), 22-35, 2004	82	2004
Taschenbuch der Algorithmen B Vöcking, H Alt, M Dietzfelbinger, R Reischuk, C Scheideler, H Vollmer, ... Springer, 2008	81*	2008
Partially-ordered two-way automata: A new characterization of DA T Schwentick, D Thérien, H Vollmer International Conference on Developments in Language Theory, 239-250, 2001	80	2001
On the autoreducibility of random sequences T Ebert, W Merkle, H Vollmer SIAM Journal on Computing 32 (6), 1542-1569, 2003	72	2003
Bases for Boolean co-clones E Böhler, S Reith, H Schnoor, H Vollmer Information Processing Letters 96 (2), 59-66, 2005	62	2005
The complexity of generalized satisfiability for linear temporal logic M Bauland, T Schneider, H Schnoor, I Schnoor, H Vollmer Logical Methods in Computer Science 5, 2009	59	2009
The complexity of satisfiability for fragments of CTL and CTL⋆ A Meier, M Thomas, H Vollmer, M Mundhenk International Journal of Foundations of Computer Science 20 (05), 901-918, 2009	58	2009
The descriptive complexity approach to LOGCFL C Lautemann, P McKenzie, T Schwentick, H Vollmer Journal of Computer and System Sciences 62 (4), 629-652, 2001	57	2001
Lindström quantifiers and leaf language definability HJ Burtschick, H Vollmer International Journal of Foundations of Computer Science 9 (03), 277-294, 1998	56	1998
Paradigms for parameterized enumeration N Creignou, A Meier, JS Müller, J Schmidt, H Vollmer Theory of Computing Systems 60, 737-758, 2017	55	2017
Complexity results for modal dependence logic P Lohmann, H Vollmer Studia Logica 101, 343-366, 2013	55	2013
Complexity of constraints: an overview of current research themes N Creignou, PG Kolaitis, H Vollmer Springer Science & Business Media, 2008	52	2008

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用