46381
2017
2017
eng
872
888
17
17
article
Cambridge Univ. Press
New York
1
--
--
--
Clingo goes linear constraints over reals and integers
The recent series 5 of the Answer Set Programming (ASP) system clingo provides generic means to enhance basic ASP with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints and elaborate upon its formal properties. Given this, we discuss the respective implementations, and present techniques for using these constraints in a reactive context. More precisely, we introduce extensions to clingo with difference and linear constraints over integers and reals, respectively, and realize them in complementary ways. Finally, we empirically evaluate the resulting clingo derivatives clingo[dl] and clingo[lp] on common language fragments and contrast them to related ASP systems.
Theory and practice of logic programming
10.1017/S1471068417000242
1471-0684
1475-3081
wos:2017
33rd International Conference on Logic Programming colocated with the 23rd International Conference on Principles and Practice of Constraint Programming / 20th International Conference on Theory and Applications of Satisfiability Testing
AUG 28-SEP 01, 2017
WOS:000412567800012
Melbourne, AUSTRALIA
Janhunen, T (reprint author), Aalto Univ, Aalto, Finland., tomi.janhunen@aalto.fi; kaminski@cs.uni-potsdam.de; ostrowsk@cs.uni-potsdam.de; seschell@cs.uni-potsdam.de; wanko@cs.uni-potsdam.de; torsten@cs.uni-potsdam.de
DFG [550/9, 11]; Academy of Finland [251170]
importub
2020-04-20T01:00:01+00:00
filename=package.tar
71d1c09a67b94fc153015e38586f0115
Tomi Janhunen
Roland Kaminski
Max Ostrowski
Sebastian Schellhorn
Philipp Wanko
Torsten H. Schaub
eng
uncontrolled
Constraint Answer Set Programming (CASP)
eng
uncontrolled
Answer Set Programming (ASP)
eng
uncontrolled
Constraint Processing (CP)
eng
uncontrolled
Theory Solving
Referiert
Institut für Informatik
Import
47028
2006
2006
eng
1909
1936
28
7
article
MIT Press
Cambridge, Mass.
1
--
2006-09-07
--
Incremental support vector learning: analysis, implementation and applications
Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM learning, with the aim of providing a fast, numerically stable and robust implementation. A detailed analysis of convergence and of algorithmic complexity of incremental SVM learning is carried out. Based on this analysis, a new design of storage and numerical operations is proposed, which speeds up the training of an incremental SVM by a factor of 5 to 20. The performance of the new algorithm is demonstrated in two scenarios: learning with limited resources and active learning. Various applications of the algorithm, such as in drug discovery, online monitoring of industrial devices and and surveillance of network traffic, can be foreseen.
Journal of machine learning research
1532-4435
wos:2006
WOS:000245389400005
Laskov, P (reprint author), Fraunhofer First Ida, Kekulestr 7, D-12489 Berlin, Germany., LASKOV@FIRST.FHG.DE; CGEHL@FIRST.FHG.DE; KRUEGERS@FIRST.FHG.DE; KLAUS@FIRST.FHG.DE
importub
2020-06-02T10:12:11+00:00
filename=package.tar
b6cfaacd34b314e32ece81d3fbfb102b
false
true
Pavel Laskov
Christian Gehl
Stefan Krüger
Klaus-Robert Müller
eng
uncontrolled
incremental SVM
eng
uncontrolled
online learning
eng
uncontrolled
drug discovery
eng
uncontrolled
intrusion detection
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
Import
13985
2004
2004
eng
article
1
--
--
--
A compiler for nested logic programming
3-540- 20721-x
allegro:1991-2014
10096232
Logic programming and nonmonotonic reasoning : 7th international conference, LPNMR 2004, Fort Lauderale, Fl, USA, Januar 6 -8, 2004 ; proceedings / LPNMR 2004. Hrsg.: Vladimir Lifschitz ; Ilka Niemelä. - Berlin [u.a.] : Springer, 2004. - (Lecture notes in computer science ; 2923 : Lecture notes in artificial intelligence). - ISBN 3-540- 20721-x. - S. 361 - 364
Vladimir Sarsakov
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
14297
2004
2004
eng
article
1
--
--
--
On Acyclic and head-cycle free nested logic programs
3-540-22671-01
allegro:1991-2014
10096934
Logic programming : 20th international conference, ICLP 2004, Saint-Malo, France, September 6 - 10, 2004 ; proceedings / Hrsg.: Bart Demoen ; Vladimir Lifschitz. - Berlin : Springer, 2004. - ISBN: 3-540-22671-01. - (Lecture notes in computer science ; 3132). - S. 225 - 239
Thomas Linke
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik
14299
2004
2004
eng
article
1
--
--
--
On acyclic and head-cycle free nested logic programs
allegro:1991-2014
10096936
Non-monotonic reasoning : proceedings / 10th international workshop on Non-monotonic reasoning, Whistler, Canada, Juni 6 - 8, 2004. - Berlin : Springer, 2004. - S. 267 - 275
Thomas Linke
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik
15225
2004
2004
eng
article
1
--
--
--
On Computing belief change operations using quantifield boolean formulas
In this paper, we show how an approach to belief revision and belief contraction can be axiomatized by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change. The essential idea is that for a belief change scenario (K, R, C), the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with the result. By restricting the form of a belief change scenario, one obtains specific belief change operators including belief revision, contraction, update, and merging. For both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This then leads to further insight into the belief change framework. Second, this axiomatization allows us to identify strict complexity bounds for the considered reasoning tasks. Third, we have implemented these different forms of belief change by means of existing solvers for quantified Boolean formulas. As well, it appears that this approach may be straightforwardly applied to other specific approaches to belief change
0955-792X
allegro:1991-2014
10096930
Journal of logic and computation. - ISSN 0955-792X. - 14 (2004), 6, S. 801 - 826
James Patrick Delgrande
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
18140
2001
2001
eng
article
1
--
--
--
On computing solutions to belief change scenarios
3-540- 42464-4
allegro:1991-2014
10093902
Symbolic and quantitative approaches to reasoning with uncertainty : 6th European conference, ECSQARU 2001, Toulouse, France, September 19 - 21, 2001 ; proceedings / Hrsg.: Salem Benferhat ; Philippe Besnard. - Berlin [u.a.] : Springer, 2001. - (Lecture notes in computer science ; 2143 : Lecture notes in artificial intelligence). - ISBN 3-540- 42464-4. - S. 510 - 521
James Patrick Delgrande
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
16948
2002
2002
eng
article
1
--
--
--
A polynomial translation of logic programs with nested expressions into disjunctive logic programs
3-540-43930-7
allegro:1991-2014
10093915
Logic programming : 18th international conference, ICLP 2002, Copenhagen, Denmark, July 29 - August 1, 2002 ; proceedings / Hrsg.: Peter J. Stuckey. - Berlin [u.a.] : Springer, 2002. - (Lecture notes in computer science ; 2401). - ISBN 3-540-43930-7. - S. 405 - 420
David Pearce
Vladimir Sarsakov
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
16937
2002
2002
eng
article
1
--
--
--
Paraconsistent reasoning via quantified boolean formulas
3-540-44190-5
allegro:1991-2014
10093865
Logics in artificial intelligence : 8th European conference, JELIA 2002, Cosenza, Italy, September 23 - 26, 2002 ; proceedings / Hrsg.: Sergio Flesca ; Giovambattista Ianni. - Berlin [u.a.] : Springer, 2002. - (Lecture notes in computer science ; 2424 : Lecture notes in artificial intelligence) - ISBN 3-540-44190-5. - S. 320 - 331
Philippe Besnard
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
30054
2007
2007
eng
article
1
--
--
--
"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description
allegro:1991-2014
10105911
Proceedings of the International Workshop on Software Engineering for Answer Set Programming (SEA'07) / Hrsg.: M. de Vos ; Torsten Schaub. - 2007. - S. 26 - 37
Martin Brain
Martin Gebser
Jörg Pührer
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
16946
2002
2002
eng
article
1
--
--
--
A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report
allegro:1991-2014
10093916
Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning, April 19 - 21, 2002, Toulouse, France (NMR2002) / ed. Salem Benferhat ; Enrico Giunchiglia. - Toulouse, 2002. - S. 57 - 66
David Pearce
Vladimir Sarsakov
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
45724
2016
2016
eng
1
25
25
147
article
IOS Press
Amsterdam
1
--
--
--
Shift Design with Answer Set Programming
Answer Set Programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many different domains. Recently, ASP has also proved successful for hard optimization problems like course timetabling and travel allotment. In this paper, we approach another important task, namely, the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees (which typically vary for different time periods) in such a way that over- and understaffing is minimized. We provide an ASP encoding of the shift design problem, which, to the best of our knowledge, has not been addressed by ASP yet. Our experimental results demonstrate that ASP is capable of improving the best known solutions to some benchmark problems. Other instances remain challenging and make the shift design problem an interesting benchmark for ASP-based optimization methods.
Fundamenta informaticae
10.3233/FI-2016-1396
0169-2968
1875-8681
wos2016:2019
WOS:000388719500002
Abseher, M (reprint author), TU Wien, Karlspl 13, A-1040 Vienna, Austria., abseher@dbai.tuwien.ac.at; musliu@dbai.tuwien.ac.at; woltran@dbai.tuwien.ac.at; gebser@cs.uni-potsdam.de; torsten@cs.uni-potsdam.de
AoF [251170]; DFG [550/9]; FWF [P25607-N23, P24814-N23, Y698-N23]
importub
2020-03-22T20:55:01+00:00
filename=package.tar
84e59557e085e69e4e1435cc80fe4797
Michael Abseher
Nysret Musliu
Stefan Woltran
Martin Gebser
Torsten H. Schaub
Referiert
Institut für Informatik
Import
15929
2003
2003
eng
article
1
--
--
--
Paraconsistent reasoning via quantified boolean formulas : Part II: Circumscribing inconsistent theories
3-540- 409494-5
allegro:1991-2014
10096236
Symbolic and quantitative approaches to reasoning with uncertainty : 7th European conference, ECSQARU 2003, Aalborg, Denmark, July 2-5, 2003 ; proceedings / Hrsg.: Thomas D. Nielsen, Nevin Lianwen Zhang. - Berlin [u.a.] : Springer, 2003. - (Lecture notes in computer science ; 2711 : Lecture notes in artificial intelligence). - ISBN 3-540- 409494-5. - S. 528 - 539
Philippe Besnard
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
34971
2013
2013
eng
46
2
14
article
Association for Computing Machinery
New York
1
--
--
--
A model-theoretic approach to belief change in answer set programming
We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs.
We first consider belief revision: for logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision.
We next consider approaches for merging a set of logic programs, P-1,...,P-n. Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program P-i those models of P-i that vary the least from models of the other programs. The second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. In this case, P-0 can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets.
Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism.
ACM transactions on computational logic
10.1145/2480759.2480766
1529-3785
wos:2011-2013
14
WOS:000320619600007
Delgrande, J (reprint author), Simon Fraser Univ, Burnaby, BC V5A 1S6, Canada., jim@cs.sfu.ca; torsten@cs.uni-potsdam.de; tompits@kr.tuwien.ac.at; woltran@dbai.tuwien.ac.at
Canadian NSERC Discovery Grant; German Science Foundation (DFG) [SCHA
550/8-2]; Austrian Science Fund (FWF) [P21698]; Vienna University of
Technology [9006.09/008]
James Delgrande
Torsten H. Schaub
Hans Tompits
Stefan Woltran
eng
uncontrolled
Theory
eng
uncontrolled
Answer set programming
eng
uncontrolled
belief revision
eng
uncontrolled
belief merging
eng
uncontrolled
program encodings
eng
uncontrolled
strong equivalence
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
30057
2007
2007
eng
article
1
--
--
--
Debugging ASP programs by means of ASP
978-3-540- 72199-4
allegro:1991-2014
10105915
Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07) / Hrsg.: C. Baral ; G. Brewka ; J. Schlipf. - Heidelberg [u.a.] : Springer, 2007. - ISBN 978-3-540- 72199-4. - S. 31 - 43
Martin Brain
Martin Gebser
Jörg Pührer
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
30056
2007
2007
eng
article
1
--
--
--
Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report
allegro:1991-2014
10105914
Proceedings of the Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT'07) / Hrsg.: D. Pearce ; A. Polleres ; A. Valverde ; S. Woltran. - 2007. - S. 37 - 48
Martin Gebser
Torsten H. Schaub
Hans Tompits
Stefan Woltran
Institut für Informatik und Computational Science
Institut für Informatik
46027
2006
2006
eng
67
81
15
1
369
article
Elsevier
Amsterdam
1
--
--
--
Iterated sequential transducers as language generating devices
Iterated finite state sequential transducers are considered as language generating devices. The hierarchy induced by the size of the state alphabet is proved to collapse to the fourth level. The corresponding language families are related to the families of languages generated by Lindenmayer systems and Chomsky grammars. Finally, some results on deterministic and extended iterated finite state transducers are established.
Theoretical computer science
10.1016/j.tcs.2006.07.059
0304-3975
wos:2006
WOS:000242765000004
Bordihn, H (reprint author), Univ Potsdam, Inst Informat, August Bebel Str 89, D-14482 Potsdam, Germany., henning@cs.uni-potsdam.de; henningfernau@yahoo.de; holzer@in.tum.de; mancav@di.unipi.it; cmv@astor.urv.es
importub
2020-04-14T18:14:59+00:00
filename=package.tar
236e0c8037afcca317198c56e02ca0f4
false
true
Henning Bordihn
Henning Fernau
Markus Holzer
Vincenzo Manca
Carlos Martin-Vide
eng
uncontrolled
finite state sequential transducers
eng
uncontrolled
state complexity
eng
uncontrolled
Lindenmayer systems
Informatik, Informationswissenschaft, allgemeine Werke
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
Import
24853
1997
1997
eng
article
1
--
--
--
And/Or reasoning graphs for determining prime implicants in multi-level combinational networks
allegro:1991-2014
10088761
Proceedings of the Asian and South Pacific Design Automation Conference 1997. - Piscataway : IEEE Order Dept., 1997
Dominik Stoffel
Wolfgang Kunz
Stefan Gerber
Institut für Informatik und Computational Science
Institut für Informatik
28656
1994
1994
eng
article
1
--
--
--
Detection of permanent faults of a floating point adder by pseudoduplication
allegro:1991-2014
10088775
Dependable computing : EDCC-1 ; European conference proceedings / Hrsg.: K. Echtle ... - Berlin : Springer, 1994. - (Lecture notes in computer science ; 852). - S. 327 - 335
Stefan Gerber
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
27194
1995
1995
eng
123 S.
doctoralthesis
1
--
--
--
Using software for fault detection in arithmetical circuits
allegro:1991-2014
10082101
Potsdam, Univ., Diss., 1996
Stefan Gerber
Institut für Informatik und Computational Science
Institut für Informatik
31780
2009
2009
eng
article
1
--
--
--
A variational approach to the Cauchy problem for nonlinear elliptic differential equations
We discuss the relaxation of a class of nonlinear elliptic Cauchy problems with data on a piece S of the boundary surface by means of a variational approach known in the optimal control literature as "equation error method". By the Cauchy problem is meant any boundary value problem for an unknown function y in a domain X with the property that the data on S, if combined with the differential equations in X, allow one to determine all derivatives of y on S by means of functional equations. In the case of real analytic data of the Cauchy problem, the existence of a local solution near S is guaranteed by the Cauchy-Kovalevskaya theorem. We also admit overdetermined elliptic systems, in which case the set of those Cauchy data on S for which the Cauchy problem is solvable is very "thin". For this reason we discuss a variational setting of the Cauchy problem which always possesses a generalised solution.
http://dx.doi.org/10.1515/jiip
10.1515/Jiip.2009.037
0928-0219
allegro:1991-2014
10108126
Journal of inverse and ill-posed problems. - ISSN 0928-0219. - 17 (2009), 6, S. 595 - 610
Ibrahim Ly
Nikolai Nikolaevich Tarkhanov
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
14112
2004
2004
eng
11 S.
2004, 1
book
Univ.
Potsdam
1
--
--
--
Necessary and Sufficient Conditions for the Existence of Self-Checking Circuits ba Use of Complementary Circuits
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10096529
V. V. Saposhnikov
Vl. V. Saposhnikov
Alexei Morozov
Michael Gössel
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik
12755
2005
2005
eng
2005, 1
book
Univ.
Potsdam
1
--
--
--
Self-checking Output-duplicated Booth-2 Multiplier
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10098822
Daniel Marienfeld
Egor S. Sogomonyan
V. Ocheretnij
Michael Gössel
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik
12596
2006
2006
deu
31, 8 S.
2006, 3
book
Univ.
Potsdam
1
--
--
--
Fehlerkorrektur und Fehlererkennung
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10101123
Egor S. Sogomonyan
Daniel Marienfeld
Michael Gössel
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik
12864
2005
2005
deu
95 S.
book
Univ.-Verl.
Potsdam
1
--
--
--
Grundlagen digitaler Systeme
978-3-937786-46-9
allegro:1991-2014
10098598
Ferdinand Börner
Michael Gössel
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
21333
2006
2006
eng
article
1
--
--
--
Modulo p=3 checking for a carry select adder
In this paper a self-checking carry select adder is proposed. The duplicated adder blocks which are inherent to a carry select adder without error detection are checked modulo 3. Compared to a carry select adder without error detection the delay of the MSB of the sum of the proposed adder does not increase. Compared to a self-checking duplicated carry select adder the area is reduced by 20%. No restrictions are imposed on the design of the adder blocks
http://www.springerlink.com/content/100286
10.1007/s10836-006-6260-8
allegro:1991-2014
10101588
Journal of electronic testing-theory and applications. - 22 (2006), 1, S. 101 - 107
Vitalij Ocheretnij
Michael Gössel
Egor S. Sogomonyan
Daniel Marienfeld
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
21834
1999
1999
eng
article
1
--
--
--
Testability evaluation of sequential designs incorporating the multi-mode scannable memory element
allegro:1991-2014
10088608
Proceedings / International test conference 1999. - Piscataway : IEEE Service Center, 1999. - S. 227 - 235
Adit D. Singh
Egor S. Sogomonyan
Michael Gössel
Markus Seuring
Institut für Informatik und Computational Science
Open Access
Institut für Informatik
21831
1999
1999
eng
article
1
--
--
--
Concurrent checking of sequential circuits by alternating inputs
allegro:1991-2014
10088597
Workshop Testmethoden und Zuverlässigkeit von Schaltungen und Sytemen <11,1999, Potsdam>. - Potsdam : Uni.- Bibl., 1999. - S. 8 - 11
Alexej Dimitriev
V. V. Saposhnikov
Vl. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
21832
1999
1999
eng
article
1
--
--
--
Fault-tolerant self-dual circuits
allegro:1991-2014
10088598
Workshop Testmethoden und Zuverlässigkeit von Schaltungen und Sytemen <11,1999, Potsdam>. - Potsdam : Uni.- Bibl., 1999. - S. 92 - 95
Vitalij Otscheretnij
Vl. V. Saposhnikov
V. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
21829
1999
1999
eng
article
1
--
--
--
Experimental results for self-dual multi-output combinational circuits
allegro:1991-2014
10088583
Journal of electronic testing : theory and applcations. - 15 (1999), S. 295 - 300
Vl. V. V. V. Saposhnikov
Vl. Moshanin
V. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
21828
1999
1999
eng
article
1
--
--
--
A method of construction of combinational self-checking units with detection of all single faults
allegro:1991-2014
10088582
Engineering simulation. - 16 (1999), S. 745 - 756
V. V. Saposhnikov
Vl. V. Saposhnikov
Michael Gössel
Andrej Morosov
Institut für Informatik und Computational Science
Institut für Informatik
21827
1999
1999
deu
article
1
--
--
--
Eine selbsttestende Struktur zur on-line Fehlererkennung in kombinatorischen Schaltungen
allegro:1991-2014
10088580
Avtomatika i telemechanika. - (1999), 11, S. 162 - 164
Michael Gössel
Alexej Dimitriev
V. V. Saposhnikov
Vl. V. Saposhnikov
Institut für Informatik und Computational Science
Institut für Informatik
21835
1999
1999
eng
article
1
--
--
--
Modified TMR-system with reduced hardware overhead
allegro:1991-2014
10088609
5th IEEE international on-line testing workshop. - IEEE Press, 1999. - S. 227 - 230
Vl. V. Saposhnikov
V. Ocheretnij
V. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
21826
1999
1999
eng
article
1
--
--
--
New totally self-checking ripple and carry look-ahead adders
allegro:1991-2014
10088762
3rd IEEE International on-line testing workshop. - Greec : IEEE Computer, 1997. - S. 36 - 40
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
19047
2000
2000
deu
61 S.
book
Univ.-Bibliothek Publ.-Stelle
Potsdam
1
--
--
--
Grundlagen digitaler Systeme
3-9806494-9-0
allegro:1991-2014
10089718
Ferdinand Börner
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
23364
1998
1998
deu
article
1
--
--
--
Ein strukturelles Verfahren zur Kompaktierung von Schaltungsausgaben für online-Fehlererkennungen und Selbstests
allegro:1991-2014
10088599
Workshop Testmethoden und Zuverlässigkeit von Schaltungen und Sytemen <10,1998, Potsdam>. - Cottbus : Uni.- Bibl., 1998
Markus Seuring
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
23360
1998
1998
eng
article
1
--
--
--
A new design method for self-checking unidirectional combinational circuits
allegro:1991-2014
10088585
Journal of electronic testing : theory and applications. - 12 (1998), S. 41 - 53
V. V. Saposhnikov
Andrej Morosov
Vl. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
21837
1999
1999
eng
article
1
--
--
--
A new totally error propagating compactor for arbitrary cores with digital interfaces
allegro:1991-2014
10088611
17th IEEE VLSI test symposium : proceedings. - IEEE Computer society press, 1999. - S. 49 - 56
Michael Gössel
Egor S. Sogomonyan
Andrej Morosov
Institut für Informatik und Computational Science
Institut für Informatik
21877
1999
1999
eng
article
1
--
--
--
A structural approach for space compaction for sequential circuits
allegro:1991-2014
10088755
Proceedings / 1999 IEEE International Symposium on Defect and Default Tolerance in VLSI Systems (DFTï99). - Los Alamitos : IEEE Computer Society Press, 1999. - S. 286 - 293
Markus Seuring
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
21836
1999
1999
eng
article
1
--
--
--
Reduced area overhead of the input party for code-disjoint circuits
allegro:1991-2014
10088610
5th IEEE international on-line testing workshop. - IEEE Press, 1999. - S. 126 - 167
Andrej Morosov
Michael Gössel
Hendrik Hartje
Institut für Informatik und Computational Science
Institut für Informatik
21838
1999
1999
eng
article
1
--
--
--
A structural method for output compaction of sequential automata implemented as circuits
allegro:1991-2014
10088613
4th Workshop on implementing automata : pre-proceedings. - Potsdam : Institut für Informatik, 1999. - S. 1 6
Markus Seuring
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
23359
1998
1998
deu
article
1
--
--
--
On-line Test auf der Grundlage eines die Parität erhaltenden Signaturanalysators
allegro:1991-2014
10088581
Avtomatika i telemechanika. - (1998), 5, S. 162 - 170
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
23363
1998
1998
eng
article
1
--
--
--
Self-Checking circuits with unidiectionally independent outputs
allegro:1991-2014
10088590
VLSI design. - 5 (1998), 4, S. 333 - 345
Andrej Morosov
V. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
22476
1998
1998
eng
16 Bl. : graph. Darst.
1998, 05
book
Univ.
Potsdam
1
--
--
--
A structural approach for space compaction for sequential circuits
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10084136
Markus Seuring
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
23788
1997
1997
eng
article
1
--
--
--
A linear code-preserving signature analyzer COPMISR
0-8186-7810-0
allegro:1991-2014
10091815
VLSI Test Symposium <15, 1997, Monterey, Calif.>: Proceedings / 15th IEEE VLSI Test Symposium : April 27 - May 1, 1997, Monterey, California. - Los Alamitos, Calif. [u.a.] : IEEE Computer Soc. Press, 1997. - ISBN 0-8186-7810-0. - S. 350 - 355
A. Hlawiczka
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
23408
1998
1998
eng
article
1
--
--
--
Design of Fault-Tolerant Circuits by self-dual Duplication
allegro:1991-2014
10088756
Design and diagnostics of electronic circuits and systems -DDECSï98 : proceedings / Second International Workshop / Hrsg.: Andrzej Hlawiczka ... - Gliwice : Silesian Techn. Univ. Press, 1998. - S. 129 - 136
Vl. V. Saposhnikov
Vitalij Otscheretnij
V. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
23410
1998
1998
eng
article
1
--
--
--
Built-in self-Test with an alternating output
0-8186-8359-7
allegro:1991-2014
10088758
Design, automation and test in Europe : February 23 - 26, 1998, Paris, France ; proceedings. - Los Alamitos [u.a.] : IEEE Computer Soc., 1998. - ISBN 0-8186-8359-7. - S. 180 - 184
Ted Bogue
Michael Gössel
Helmut Jürgensen
Yervant Zorian
Institut für Informatik und Computational Science
Institut für Informatik
23368
1998
1998
eng
article
1
--
--
--
Fault-tolerant self-dual circuits with error detection by parity- and group parity prediction
allegro:1991-2014
10088616
4th IEEE international on-line testing workshop : proceedings. - IEEE Press, 1998. - S. 124 - 130
Vitalij Otscheretnij
Michael Gössel
Vl. V. Saposhnikov
V. V. Saposhnikov
Institut für Informatik und Computational Science
Institut für Informatik
23396
1998
1998
eng
article
1
--
--
--
A multi-mode scannable memory element for high test application efficiency and delay testing
allegro:1991-2014
10088759
Proceedings / 16th IEEE VLSI Test Symposium. - Los Alamitos : IEEE Computer Society Press, 1998. - S. 324 - 331
Egor S. Sogomonyan
Adit D. Singh
Michael Gössel
Institut für Informatik und Computational Science
Open Access
Institut für Informatik
23412
1998
1998
eng
article
1
--
--
--
A structural approach for space compaction for concurrent checking and BIST
allegro:1991-2014
10088760
Proceedings / 16th IEEE VLSI Test Symposium. - Los Alamitos : IEEE Computer Society Press, 1998. - S. 354 - 361
Markus Seuring
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
23409
1998
1998
eng
article
1
--
--
--
Self-dual duplication for error detection
allegro:1991-2014
10088757
Proceedings / seventh Asian Test symposium (ASTï98). - Los Alamitos : IEEE Computer Society, 1998. - S. 296 - 300
Vl. V. Saposhnikov
V. V. Saposhnikov
Alexej Dimitriev
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
23411
1998
1998
eng
article
1
--
--
--
A scan based concrrent BIST approach for low cost on-line testing
allegro:1991-2014
10088614
4th IEEE international on-line testing workshop : proceedings. - IEEE Press, 1998. - S. 52 - 55
Egor S. Sogomonyan
Adit D. Singh
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
23780
1997
1997
eng
article
1
--
--
--
Synthesis of code-disjoint combinational circuits
allegro:1991-2014
10091850
European Test Workshop <1997, Cagliari, Italy>: Compendium of papers / European Test Workshop, Cagliari, Italy, 1997
Hendrik Hartje
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
25414
1996
1996
eng
article
1
--
--
--
Design of self-checking unidirectional combinational circuits with low area overhead
allegro:1991-2014
10091820
International On-Line Testing Workshop <2, 1996, Biarritz>: Proceedings / 2nd IEEE International On-Line Testing Workshop, Biarritz, 1996. - S. 56 - 67
Va. V. Saposhnikov
Andrej Morosov
Vl. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
24821
1997
1997
deu
article
1
--
--
--
Ein Transformationsalgorithmus einer kombinatorischen Schaltung in eine monotone Schaltung
allegro:1991-2014
10088602
Workshop Testmethoden und Zuverlässigkeit von Schaltungen und Sytemen <9,1997, Potsdam> : Tagungsband. - Potsdam : Uni.-Bibl., 1997. - S. 78 - 81
Andrej Morosov
V. V. Saposhnikov
Vl. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
24820
1997
1997
eng
article
1
--
--
--
On-line testing by self-dual duplication
allegro:1991-2014
10088600
Workshop Testmethoden und Zuverlässigkeit von Schaltungen und Sytemen <9,1997, Potsdam> : Tagungsband. - Potsdam : Uni.-Bibl., 1997. - S. 43 - 47
Alexej Dimitriev
Vl. V. Saposhnikov
Michael Gössel
V. V. Saposhnikov
Institut für Informatik und Computational Science
Institut für Informatik
24748
1997
1997
eng
article
1
--
--
--
Self-dual duplication - a new method for on-line testing
allegro:1991-2014
10088763
3rd IEEE International on-line testing workshop. - Greec : IEEE Computer, 1997. - S. 213 - 217
Alexej Dimitriev
Vl. V. Saposhnikov
Michael Gössel
V. V. Saposhnikov
Institut für Informatik und Computational Science
Institut für Informatik
23794
1997
1997
eng
article
1
--
--
--
Self-dual multi output combinational circuits with output data compaction
allegro:1991-2014
10091835
European Test Workshop <1997, Cagliari, Italy>: Compendium of papers / European Test Workshop, Cagliari, Italy, 1997
Vl. V. Saposhnikov
Vl. Moshanin
V. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
24779
1997
1997
eng
article
1
--
--
--
Design of self dual fault-secure combinational circuits
allegro:1991-2014
10088764
3rd IEEE International on-line testing workshop. - Greec : IEEE Computer, 1997. - S. 233 - 237
Andrej Morosov
Vl. V. Saposhnikov
V. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
23926
1997
1997
eng
19 S. : Ill.
1997, 01
book
Univ. Potsdam
Potsdam [u.a.]
1
--
--
--
A structural approach for space compaction for concurrent checking and BIST
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10092701
Markus Seuring
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
24823
1997
1997
eng
article
1
--
--
--
Code disjoint circuits for partity codes
allegro:1991-2014
10088606
Sixth asian test Symposium : proceedings. - Los Alamitos [u.a.] : IEEE Computer Society, 1997
Hendrik Hartje
Egor S. Sogomonyan
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
25437
1996
1996
eng
article
1
--
--
--
Synthesis of self-dual multi-output combinational circuits for on-line Teting
allegro:1991-2014
10091819
International On-Line Testing Workshop <2, 1996, Biarritz>: Proceedings / 2nd IEEE International On-Line Testing Workshop, Biarritz, 1996. - S. 107 - 111
Wladimir Moschanin
Vl. V. Saposhnikov
Va. V. Saposhnikov
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
26290
1996
1996
eng
article
1
--
--
--
Self-dual parity checking - a new method for on-line testing
allegro:1991-2014
10088773
Proceedings / 14th IEEE VLSI Test Symposium. - Los Alamitos : IEEE Computer Society Press, 1996. - S. 162 - 168
Vl. V. Saposhnikov
Alexej Dimitriev
Michael Gössel
Va. V. Saposhnikov
Institut für Informatik und Computational Science
Institut für Informatik
26287
1996
1996
eng
article
1
--
--
--
A new self-testing parity checker for ultra-reliable applications
allegro:1991-2014
10088765
Computer-aided design, test and evaluation for dependability / Hrsg.: Yinghua Min ; Dong Tang. - Beijing : International Academic Publishers, 1996. - S. 246 - 251
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
26286
1996
1996
eng
article
1
--
--
--
Concurrently self-testing embedded checkers for ultra-reliable fault-tolerant systems
allegro:1991-2014
10088772
Proceedings / 14th IEEE VLSI Test Symposium. - Los Alamitos : IEEE Computer Society Press, 1996. - S. 138 - 144
Egor S. Sogomonyan
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
26275
1996
1996
eng
article
1
--
--
--
A parity-preserving multi-input signature analyzer and it application for concurrent checking and BIST
allegro:1991-2014
10088587
Journal of electronic testing : theory and applcations. - 8 (1996), S. 165 - 177
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
28071
1994
1994
eng
article
1
--
--
--
Self-parity combinational-circuits for self-testing, concurrent fault-detection and parity scan design
allegro:1991-2014
10089577
VLSI 93. - 42 (1994), S. 103 - 111
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
26815
1995
1995
eng
article
1
--
--
--
A new parity preserving multi-input signature analyser
allegro:1991-2014
10091833
International On-Line Testing Workshop <1, 1995, Nice, France>: Proceedings / 1st IEEE International On-Line Testing Workshop, Nice, France, 1995. - S. 211 - 215
Egor S. Sogomonyan
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
26276
1996
1996
eng
article
1
--
--
--
Self-checking comparator with one periodiv output
allegro:1991-2014
10088594
IEEE transactions on computers. - 45 (1996), 3, S. 379 - 380
S. Kundu
Egor S. Sogomonyan
Michael Gössel
Steffen Tarnick
Institut für Informatik und Computational Science
Institut für Informatik
27641
1995
1995
eng
article
1
--
--
--
BIST with negligible aliasing through random cover circuits
allegro:1991-2014
10088776
Proceedings of the ASP-DAC ï95, CHDL ï95, VLSI ï95. - Tokyo, 1995
Ted Bogue
Helmut Jürgensen
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
35866
2012
2012
eng
950
957
8
6
31
article
Inst. of Electr. and Electronics Engineers
Piscataway
1
--
--
--
Highly efficient test response compaction using a hierarchical x-masking technique
This paper presents a highly effective compactor architecture for processing test responses with a high percentage of x-values. The key component is a hierarchical configurable masking register, which allows the compactor to dynamically adapt to and provide excellent performance over a wide range of x-densities. A major contribution of this paper is a technique that enables the efficient loading of the x-masking data into the masking logic in a parallel fashion using the scan chains. A method for eliminating the requirement for dedicated mask control signals using automated test equipment timing flexibility is also presented. The proposed compactor is especially suited to multisite testing. Experiments with industrial designs show that the proposed compactor enables compaction ratios exceeding 200x.
IEEE transactions on computer-aided design of integrated circuits and systems
10.1109/TCAD.2011.2181847
0278-0070
wos:2011-2013
WOS:000304244900012
Rabenalt, T (reprint author), Infineon Technol, D-85579 Neubiberg, Germany., trabenal@cs.uni-potsdam.de; miricht@cs.uni-potsdam.de; frank.poehl@intel.com; mgoessel@cs.uni-potsdam.de
MAYA, German Federal Ministry for Education and Research, [01M3063A]
Thomas Rabenalt
Michael Richter
Frank Pöhl
Michael Gössel
eng
uncontrolled
Design for testability (DFT)
eng
uncontrolled
test response compaction
eng
uncontrolled
X-masking
eng
uncontrolled
X-values
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
31694
2009
2009
eng
article
1
--
--
--
X-tolerant test data compaction with accelerated shift registers
Using the timing flexibility of modern automatic test equipment (ATE) test response data can be compacted without the need for additional X-masking logic. In this article the test response is compacted by several multiple input shift registers without feedback (NF-MISR). The shift registers are running on a k-times higher clock frequency than the test clock. For each test clock cycle only one out of the k outputs of each shift register is evaluated by the ATE. The impact of consecutive X values within the scan chains is reduced by a periodic permutation of the NF-MISR inputs. As a result, no additional external control signals or test set dependent control logic is required. The benefits of the proposed method are shown by the example of an implementation on a Verigy ATE. Experiments on three industrial circuits demonstrate the effectiveness of the proposed approach in comparison to a commercial DFT solution.
http://www.springerlink.com/content/100286
10.1007/s10836-009-5107-5
0923-8174
allegro:1991-2014
10108030
Journal of electronic testing. - ISSN 0923-8174. - 25 (2009), 4-5, S. 247 - 258
Martin Hilscher
Michael Braun
Michael Richter
Andreas Leininger
Michael Gössel
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
28101
1994
1994
eng
article
1
--
--
--
Design of cover circuits for monitoring the output of a MISR
0-8186-6307-3 , 0-8186-6306-5
allegro:1991-2014
10091875
International Symposium on Defect and Fault Tolerance in VLSI Systems <1994, Montréal>: 1994 proceedings / the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems, October 17 - 19, 1994, Montréal, Québec, Canada / sponsored by the IEEE Computer Society Technical Committee on Fault-Tolerant Computing. - Los Alamitos, Calif. [u.a.] : IEEE Computer Society Press, 1994. - ISBN 0-8186-6307-3 , 0-8186-6306-5. - S. 124 - 132
Ted Bogue
Helmut Jürgensen
Michael Gössel
Institut für Informatik und Computational Science
Institut für Informatik
28654
1994
1994
eng
article
1
--
--
--
Code disjoint self-parity combinational circuits for self-testing, concurrent fault detection and parity scan design
allegro:1991-2014
10088769
Proceedings / 12th IEEE VLSI test symposium. - Los Alamitos : IEEE Computer Soc. Press, 1994. - S. 151 - 157
Michael Gössel
Egor S. Sogomonyan
Institut für Informatik und Computational Science
Institut für Informatik
28647
1994
1994
eng
article
1
--
--
--
Design of combinational self-testing devices with unidirectionally independent outputs
allegro:1991-2014
10088579
Avtomatika i telemechanika. - (1994), 7, S. 148 - 160
Michael Gössel
Andrej Morosov
V. V. Saposhnikov
VL. V. Saposhnikov
Institut für Informatik und Computational Science
Institut für Informatik
10539
2008
2008
deu
x, 287 S. : graph. Darst.
doctoralthesis
Potsdam
1
--
--
--
Graphentheoretische Analyse der Evolution von Wiki-basierten Netzwerken für selbstorganisiertes Wissensmanagement
allegro:1991-2014
10104774
Potsdam, Univ., Diss., 2008
Claudia Müller
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
10515
2008
2008
eng
184 S. : graph. Darst.
doctoralthesis
Potsdam
1
--
--
--
Incremental answer set programming
allegro:1991-2014
10104833
Potsdam, Univ., Diss., 2008
Mona Gharib
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
10652
2008
2008
eng
98 S.
21
book
Universitätsverlag Potsdam
Potsdam
1
--
--
--
Proceedings of the 2nd International Workshop on e-learning and Virtual and Remote Laboratories
Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda
978-3-940793-17-1
1613-5652
allegro:1991-2014
10104573
Institut für Informatik und Computational Science
Institut für Informatik
10680
2008
2008
eng
8 S.
2008, 1
book
Univ.
Potsdam
1
--
--
--
Document authoring environments and authoring mathematics
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10104754
Jackson Marques de Carvalho
Helmut Jürgensen
Institut für Informatik und Computational Science
Institut für Informatik
10681
2008
2008
eng
250 S.
42
book
Springer
Dordrecht; Heidelberg
1
--
--
--
New methods of concurrent checking
Frontiers in electronic testing
10.1007/978-1-4020-8420-1
978-1-402-08419-5
allegro:1991-2014
10104755
Michael Goessel
Vitaly Ocheretny
Egor S. Sogomonyan
Daniel Marienfeld
Institut für Informatik und Computational Science
Institut für Informatik
10728
2008
2008
eng
13 S.
book
Univ.
Potsdam
1
--
--
--
The Mixed problem for a degenerate operator equation
Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell
1437-739X
allegro:1991-2014
10104938
Liparit Tepoyan
Institut für Informatik und Computational Science
Institut für Informatik
10829
2013
2013
deu
book
1
--
--
--
Ein konstruktivistischer Lehransatz für die Einführungsveranstaltung der Theoretische Informatik
978-3-86956-220-9
allegro:1991-2014
10110719
HDI 2012 - Informatik für eine nachhaltige Zukunft : 5. Fachtagung Hochschuldidaktik der Informatik : 06. - 07. November 2012, Universität Hamburg / Hrsg.: Peter Forbig ; Detlef Rick ; Axel Schmolitzky. - Potsdam : Universitätsverlag Potsdam, 2013. - (Commentarii informaticae didacticae ; 5). - ISBN 978-3-86956-220-9. - S. 21 - 32
Maria Knobelsdorf
Christoph Kreitz
Institut für Informatik und Computational Science
Institut für Informatik
10795
2008
2008
deu
195 S., graph. Darst.
doctoralthesis
Potsdam
1
--
--
--
Ausführung und Entwicklung Adaptiver Komponentenbasierter Anwendungen
978-3-86727-698-6
allegro:1991-2014
10105055
Potsdam, Univ., Diss., 2008
Andreas Rasche
Institut für Informatik und Computational Science
Institut für Informatik
10800
2008
2008
eng
124 S., ii-xi, : graph. Darst.
doctoralthesis
Potsdam
1
--
--
--
Modeling, Simulation and Evaluation of TCP/IP Networks
allegro:1991-2014
10105063
Potsdam, Univ., Diss., 2008
Nanjun Li
Institut für Informatik und Computational Science
Institut für Informatik
10777
2008
2008
deu
195 S.: graph. Darst.
doctoralthesis
Cuvillier
Göttingen
1
--
--
--
Ausführung und Entwicklung adaptiver komponentenbasierter Anwendungen
978-3-86727-698-6
allegro:1991-2014
10105027
Zugl.:Potsdam, Univ., Diss., 2008
Andreas Rasche
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
10778
2008
2008
deu
v, 174 S.: Ill., garph. Darst.
doctoralthesis
Cuvillier
Göttingen
1
--
--
--
Dynamische Ressourcenverwaltung für dienstbasierte Software-Systeme
978-3-86727-622-1
allegro:1991-2014
10105028
Zugl.: Potsdam, Univ., Diss., 2008
Peter Tröger
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
10782
2008
2008
eng
xi, 124 S.: graph. Drst.
doctoralthesis
1
--
--
--
Modeling, simulation and evaluation of TCP/IP Networks
allegro:1991-2014
10105034
Potsdam, Univ., Diss., 2008
Nanjun Li
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
10811
2008
2008
deu
174 S., graph. Darst.
doctoralthesis
Potsdam
1
--
--
--
Dynamische Ressourcenverwaltung für dienstbasierte Software-Systeme
allegro:1991-2014
10105076
Potsdam, Univ., Diss., 2008
Peter Tröger
Institut für Informatik und Computational Science
Institut für Informatik
10851
2008
2008
eng
83 S.
book
Univ.
Potsdam
1
--
--
--
Well-posedness of Einstein-Euler Systems in asymptotically flat spacetimes
Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell
1437-739X
allegro:1991-2014
10105163
Uwe Brauer
Lavi Karp
Institut für Informatik und Computational Science
Institut für Informatik
10980
2007
2007
deu
223 S. : graph. Darst.
doctoralthesis
Gito-Verl.
Berlin
1
--
--
--
Modellbasierte Analyse interorganisationaler Wissensflüsse
978-3-936771-92-3
allegro:1991-2014
10102134
Zugl.: Potsdam, Univ., Diss., 2006
Nane Kratzke
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
11070
2007
2007
eng
5 S.
2007, 1
other
Univ.
Potsdam
1
--
--
--
Flexible Structured Mathematics Notation : IADIS, International Conference Interfaces and Human Computer Interaction, Lisabon, 2007
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10102572
Jackson W. Marques de Carvalho
Helmut Jürgensen
Institut für Informatik und Computational Science
Institut für Informatik
11071
2007
2007
deu
14 S.
2007, 2
other
Univ.
Potsdam
1
--
--
--
Plug-ins und Dienste : Ansätze zu Bewältigung zeitvarianter Geschäftsprozesse
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10102573
Christoph Stöpel
Wolfgang Schubert
Tiziana Margaria-Steffen
Institut für Informatik und Computational Science
Institut für Informatik
11080
2007
2007
eng
17 S.
2007, 3
book
Univ.
Potsdam
1
--
--
--
GeneFisher-P
Preprint / Universität Potsdam, Institut für Informatik
Variations of GneFisher as Process in Bio jETI - (part of "From Components to Processes")
0946-7580
allegro:1991-2014
10102599
Anna-Lena Lamprecht
Tiziana Magaria
Bernhard Steffen
Alexander Sczyrba
Sven Hartmeier
Robert Giegerich
Institut für Informatik und Computational Science
Institut für Informatik
11082
2007
2007
eng
16 S.
2007, 4
book
Univ.
Potsdam
1
--
--
--
Bio-jETI: a Service Integration, Design, and Provisioning Platform for Orchestrated Bioinformatics Processes - ("part of From Components to Processes")
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10102606
Tiziana Margaria
Christian Kubczak
Bernhard Steffen
Institut für Informatik und Computational Science
Institut für Informatik
11157
2007
2007
eng
368 S.
book
Springer-Verlag Berlin Heidelberg
Berlin, Heidelberg
1
--
--
--
Business Process Management : Concepts, Languages, Architectures
10.1007/978-3-540-73522-9
978-3-540-73521-2
allegro:1991-2014
10102821
Mathias Weske
Institut für Informatik und Computational Science
Institut für Informatik
11165
2007
2007
eng
Getr. Zähl.
book
ASQF
Erlangen
1
--
--
--
Proceedings / EuroSPI 2007, European Software Process Improvement, 26.-28.09.2007, University of Potsdam, Germany
978-3-9809145-6-7
allegro:1991-2014
10102852
Tiziana Margaria
Institut für Informatik und Computational Science
Institut für Informatik
11156
2007
2007
eng
xiv, 219 S. : graph. Darst.
doctoralthesis
Potsdam
1
--
--
--
On the application of a theory for mobile systems to business process management
allegro:1991-2014
10102819
Potsdam, Univ., Diss., 2007
Frank Puhlmann
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
11226
2007
2007
eng
223 S.
4764
book
Springer
Berlin
1
--
--
--
Software Process Improvement : 14th europea conference, EuroSpi 2007, Potsdam, Germany, September 26-28, 2007 ; Proceedings
Lecture Notes in Computer Science
allegro:1991-2014
10103143
Pekka Abrahamsson
Nathan Baddoo
Tiziana Margaria
Richard Messnarz
Institut für Informatik und Computational Science
Institut für Informatik
11362
2007
2007
eng
88 S.
19
book
Universitätsverlag Potsdam
Potsdam
1
--
--
--
A Quantitative Evalution of the Enhanced Topic-based Vector Space Model
Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda
978-3-939469-95-7
1613-5652
allegro:1991-2014
10104037
Artem Polyvyanyy
Dominik Kuropka
Institut für Informatik und Computational Science
Institut für Informatik
11474
2007
2007
deu
118 S. : graph. Darst.
doctoralthesis
Potsdam
1
--
--
--
Fehlererkennung in systemmetrischen Block-Chiffren
allegro:1991-2014
10104638
Potsdam, Univ., Diss., 2007
Grigory Kuznetsov
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik