Source: https://www.informatik.hu-berlin.de/de/forschung/gebiete/algorithmenII/Publikationen
Timestamp: 2019-04-19 14:17:15+00:00

Document:
Statistical Methodology 29: 10–17 (2016).
V. Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan.
Mathematical Foundations of Computer Science (Proceedings of 41st MFCS). LIPIcs, 2016.
V. Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán.
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky.
Journal of Descrete Algorithms 38 (2016).
Information and Computation 247: 266–277 (2016).
Christoph Berkholz, Andreas Krebs, Oleg Verbitsky.
ACM Transactions on Computational Logic (TOCL) 16(3): 21 (2015).
V. Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda.
Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe.
Journal of Discrete Algorithms 34: 108–117 (2015).
V. Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev.
Theoretical Computer Science 590: 38–54 (2015).
V. Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky.
Fundamentals of Computation Theory (Proceedings of 20th FCT) Pp. 339–350 (2015).
Mathematical Foundations of Computer Science (Proceedings of 40th MFCS) Pp. 26–37 (2015).
Stochastic Models, Statistics and Their Applications. Pp. 93–100 (2015).
Logic in Computer Science (LICS). Pp. 689–700 (2015).
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán.
Parameterized and Exact Computation (Proceedings of 9th IPEC) Pp. 39-50. LNCS 8894.
V. Arvind and Johannes Köbler.
Fundamentals of Computation Theory (Proceedings of 19th FCT). Pp. 16-27. LNCS 8070.
Computer Science Logic 2013. Pp. 61-80. LIPIcs 23.
Mathematical Foundations of Computer Science (Proceedings of 38th MFCS). Pp. 159-170. LNCS 8087.
Mathematical Foundations of Computer Science (Proceedings of 38th MFCS). Pp. 631-642. LNCS 8087.
Algorithms and Computation (Proceedings of 23rd ISAAC), pp. 517-526. LNCS 7676.
Proceedings of 32nd FSTTCS (2012). Pp. 387-399. LIPIcs 18.
V. Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev.
Mathematical Foundations of Computer Science 2012 (Proceedings of 37th MFCS), pp. 100-111. LNCS 7464.
Bulletin of the EATCS 107 (2012), pp. 44-71.
Information and Computation 217 (2012), pp. 1-11.
SIAM Journal on Computing 20.5 (2011), pp. 1292-1315.
Formation of translational risk score based on correlation coefficients as an alternative to Cox regression models for predicting outcome in patients with NSCLC.
Theoretical Biology and Medical Modelling , 2011, 8-28.
Proc. Conference on Foundations of Software Technology & Theoretical Computer Science (FST&TCS), Leibniz International Proceedings in Informatics (LIPIcs) 8, Pages 327-337, 2010.
To appear in Information and Computation.
Proceedings 37th International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag, LNCS 6198, 384-395, 2010.
An adaptive test for the two-sample scale problem based on U-statistics.
Communications in Statistics - Computation and Simulation , Vol. 39, 2010, 1785-1802.
Computational Statistics and Data Analysis , 54, 2010, 2053-2065.
Proceedings der 14. Konferenz der SAS-Anwender in Forschung und Entwicklung , Freie Universität Berlin (ed. Rendtel, U.), 2010, Shaker-Verlag Aachen, 127-147.
Theoretical Computer Science, Volume 410, Number 47 - 49, Pages 4928 - 4936, 2009.
Theoretical Computer Science, Volume 410, Number 38 - 40, Pages 3839 - 3855, 2009.
Proceedings 34th Mathematical Foundations of Computer Science (MFCS), Springer-Verlag, LNCS 5734, 537-548, 2009.
Proc. 3rd International Conference on Language and Automata Theory and Applications (LATA), Springer-Verlag, LNCS 5457, Pages 164 - 175, 2009.
Proceedings 3rd International Computer Science Symposium in Russia (CSR), Springer-Verlag, LNCS 5010, 216-227, 2008.
A Logspace Algorithm for Partial 2-Tree Canonization.
Proceedings 3rd International Computer Science Symposium in Russia (CSR), Springer-Verlag, LNCS 5010, 40-51, 2008.
Proc. 17th EACSL Annual Conference on Computer Science Logic (CSL), To appear.
Mathematical Logic Quarterly, To appear.
Proc. 5th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS 4978, To appear.
Theory of Computing Systems, To appear.
An adaptive test for the two-sample location problem based on U-statistics.
Journal of Computer and System Sciences (JCSS), 73(6): 924-940, 2007.
Proceedings 13th Intern. Conf. on Algorithmic Learning Theory (ALT), Springer-Verlag, LNCS 4754, 120-134, 2007.
Proc. 18th Intern. Symp. on Algorithms and Computation (ISAAC), Springer-Verlag, LNCS 4835, 822-833, 2007.
Proc. 27th Conference on Foundations of Software Technology & Theoretical Computer Science (FST&TCS), LNCS 4855, Pages 241-252, 2007.
Theoretical Computer Science, Volume 377, Issues 1-3, Pages 93-109, 2007.
Theoretical Computer Science (TCS) 350, 49-62, 2006.
Extended abstract in Proceedings 13th International Workshop on Algorithmic Learning Theory (ALT'02), Springer-Verlag, Lecture Notes in Artificial Intelligence, LNAI 2533, 149-163, 2002.
Proceedings Second Conference on Computability in Europe (CiE) 2006, Logical Approaches to Computational Barriers, Springer-Verlag, LNCS 3988, 241-256, 2006.
Symposium on Theoretical Aspects of Computer Science (STACS), Springer-Verlag, LNCS 3884, 384-395, 2006.
Proc. 3rd Conference on Theory and Applications of Models of Computation, Springer Verlag, LNCS 3959, 236-247, 2006.
Proc. 1st International Computer Science Symposium in Russia, Springer Verlag, LNCS 3967, 80-91, 2006.
Themen der Informatik im historischen Kontext, Springer Verlag, 2006.
The asymptotic efficacies and relative efficiencies for various linear rank tests for Independence.
Some c-Sample Rank Tests of Homogeneity Against Ordered Alternatives Based on U-Statistics.
Some c-Sample Rank Tests of Homogeneity Against Umbrella Alternatives with Unknown Peak.
Information and Computation 190(1), 1-17, 2004.
In Proceedings 24th Conference on the Foundations of Software Technology & Theoretical Computer Science (FST&TCS), Springer-Verlag, LNCS 3328, 122-1344, 2004.
Tests for Independence in Bivariate Distributions - Power Comparisons by Simulation.
Journal of Computer and System Sciences (JCSS) 66, 549-566, 2003.
Information and Computation 184, 71-92, 2003.
In Proceedings 13th International Workshop on Algorithmic Learning Theory (ALT'02), Springer-Verlag, Lecture Notes in Artificial Intelligence, LNAI 2533, 139-148, 2002.
Symposium on Theoretical Aspects of Computer Science (STACS), Springer-Verlag, LNCS 2285, 121-132, 2002.
Journal of Computer and System Sciences (JCSS), 65(2): 257-277, 2002.
Extended abstract in Symposium on Theoretical Aspects of Computer Science (STACS), Springer-Verlag, LNCS 1770, 431-442, 2000.
Theoretical Computer Science (TCS) 255 (1-2), 205-221, 2001.
Extended abstract in Proceedings 17th Conference on the Foundations of Software Technology & Theoretical Computer Science (FST&TCS), Springer-Verlag, LNCS 1346, 235-249, 1997.
International Journal of Foundations of Computer Science (IJFOCS) 11(4), 615-632, 2000.
Extended abstract in Proceedings 8th International Workshop on Algorithmic Learning Theory (ALT'97), Springer-Verlag, LNAI 1316, 277-290, 1997.
Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2000.
Symposium on Theoretical Aspects of Computer Science (STACS), Springer-Verlag, LNCS 1770, 314-323, 2000.
The Efficacy of Some c-Sample Rank Tests of Homogeneity Against Ordered Alternatives.
The Asymptotic Power and Relative Efficiency of Some c-Sample Rank Tests of Homogeneity Against Umbrella Alternatives.
Chicago Journal of Theoretical Computer Science 4:1-29, 1999.
Extended abstract in Symposium on Theoretical Aspects of Computer Science (STACS), Springer-Verlag, LNCS 1200, 375-386, 1997.
A new one-sided variable inspection plan for continuous distribution functions.
Rank tests in the two-sample scale problem with unequal and unknown locations.
The Asymptotic Power of Jonckheere-type tests for ordered alternatives.
SIAM Journal on Computing, 28:311-324, 1998.
Extended abstract in International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag, LNCS 944, 196-207, 1995.
Springer-Verlag, LNCS 1450, 493-502, 1998.
Proceedings 13th IEEE Conference on Computational Complexity (CCC), 132-140, 1998.
Proceedings 13th IEEE Conference on Computational Complexity (CCC), 182-185, 1998.
Adaptive Tests for Umbrella Alternatives.
In: D.-Z. Du, K.-I Ko (eds.), Advances in Languages, Algorithms, and Complexity. Kluwer Academic Publishers, 139-156, 1997.
Power of Some Tests for Umbrella Alternatives in the Multi-Sample Location Problem.
On the Non-Robustness of Maximum-Likelihood Sampling Plans by Variables.
Mathematical System Theory (MST) 29, 63-94, 1996.
RAIRO Theoretical Informatics and Applications 30(2), 155-179, 1996.
Extended abstract in Proceedings 17th Conference on the Foundations of Software Technology & Theoretical Computer Science (FST&TCS), Springer-Verlag, LNCS 652, 140-151, 1992.
Mathematical System Theory (MST) 29, 33-46, 1996.
Extended abstract in Proceedings 8th Structure in Complexity Theory Conference, 147-155, IEEE Computer Society, 1993.
Robustness and Efficiency of some Tests for ordered alternatives in the c-Sample Location Problem.
A Program to Split Computer Graphics Metafiles into Individual Graphs.
Proceedings 10th Structure in Complexity Theory Conference, 246-261, IEEE Computer Society, 1995.
Information Processing Letters (IPL) 56, 109-114, 1995.
Theoretical Computer Science (TCS) 137, 279-282, 1995.
Journal of Computer and System Sciences (JCSS) 50(3), 456-467, 1995.
Extended abstract in Proceedings 7th Structure in Complexity Theory Conference, 111-117, IEEE Computer Society, 1992.
On the Robustness of Lieberman-Resnikoff Sampling Plans by Variables.
Theoretical Computer Science (TCS) 134, 263-285, 1994.
Extended abstract in Symposium on Theoretical Aspects of Computer Science (STACS), Springer-Verlag, LNCS 665, 28-37, 1993.
International Journal of Foundations of Computer Science (IJFOCS) 6(2), 137-153, 1994.
Extended abstract in International Symposium on Algorithms and Computation (ISAAC), Springer-Verlag, LNCS 650, 249-258, 1992.
Workshop on Algebraic Methods in Complexity Theory, Technical Report IMSc-94/51, 39-57, 1994.
SIAM Journal on Computing 23(2), 261-275, 1994.
Extended abstract in Proceedings 5th Structure in Complexity Theory Conference, 305-315, IEEE Computer Society, 1990.
ExVar - Exact Variable Inspection Plans in Statistical Quality Control.
Computational Statistics & Data Analysis 17, 97-99, 1994.
Restrictive adaptive tests for the treatment of the two-sample scale problem.
Computational Statistics & Data Analysis 18, 513-524, 1994.
Springer-Verlag, LNCS 711, 232-241, 1993.
In: K. Ambos-Spies, S. Homer, and U. Schöning (eds.), Recent Developments in Complexity Theory. Cambridge University Press, 1993.
Extended abstract in Proceedings 19th International Colloquium on Automata, Languages and Programming (ICALP), Springer-Verlag, LNCS 623, 162-173, 1992.
Springer-Verlag, LNCS 652, 140-151, 1992.
Journal of Computer and System Sciences (JCSS) 44(2), 272-286, 1992.
Extended abstract in Proceedings 4th Structure in Complexity Theory Conference, 208-215, IEEE Computer Society, 1989.
Journal of Computational Complexity 2, 301-330, 1992.
Extended abstract in Symposium on Theoretical Aspects of Computer Science (STACS), Springer-Verlag, LNCS 577, 401-411, 1992.
Springer-Verlag, LNCS 650, 249-258, 1992.
Acta Informatica 26, 363-379, 1989.
Extended abstract in Proceedings 13th Colloquium on Trees in Algebra and Programming, Springer-Verlag, LNCS 299, 40-51, 1988.
ROSTAN - a programm package using rank and order statistics.
Statistical Software Newsletter, vol.15, 1989.
RAIRO Theoretical Informatics and Applications 21(4), 419-435, 1987.
Nonparametric Location Tests Against Restricted Alternatives.
182 + xii Seiten, Shaker Verlag Aachen (2006).
Nichtparametrische Lokationstests bei eingeschränkten Alternativen.

References: V. 

V. 

V. 

V. 

V. 

V. 

V.