PUBLISH2.0-//Inverse inc./SOGo 5.12.7//ENEurope/Berlin19810329T020000-1SU3YEARLYMESZ+0100+020019961027T030000-1SU10YEARLYMEZ+0200+0100Europe/Paris19810329T020000-1SU3YEARLYMESZ+0100+020019961027T030000-1SU10YEARLYMEZ+0200+0100America/Los_Angeles20070311T0200002SU3YEARLYGMT-7-0800-070020071104T0200001SU11YEARLYGMT-8-0700-080020230224T184836ZEurope/Berlin20230322T15300020230224T184836ZEurope/Berlin20230322T14450020230224T184836Z0BA Hlava (High-order SAT)OPAQUE41CD41E2-0E2B-49E4-A0D2-7839843D5B7EPUBLIC20140527T095301ZE9A82DC3-4FB5-409E-A4DE-102AE3C4CE90Europe/Berlin20140605T143000OPAQUEAUTOMATICVortrag Sergey Kartamyshev: Modale Resolution für die Rahmenklasse K20201113T122500Z20140528T105749ZEurope/Berlin20140605T1330004PUBLIC20140708T093600Z3302F0D4-2A38-41D8-A4C8-8EF60DE4F749Europe/Berlin20140724T140000OPAQUEAUTOMATICAbschlussvortrag BA Wadim Friedrich20140708T093613Z20140708T093614ZEurope/Berlin20140724T1330001PUBLIC20140331T115942Z42F3FA30-198A-4575-A9AC-F609311213B9Europe/Berlin20140429T140000OPAQUEAUTOMATICBA-Abschlussvortrag Mehrad Emami: Schwierige NEA-Probleme20140331T115942Z20140401T083255ZEurope/Berlin20140429T1330002PUBLIC20140602T065609Z9AE22B5F-C5FD-4B4B-9FBA-5DC0751F5669Europe/Berlin20140717T160000OPAQUEAUTOMATICJulian-Steffen Müller Disputation20201113T122500Z20140604T134259ZEurope/Berlin20140717T140000027, Appelstr. 45PUBLIC20140707T120233Z81D40D6E-C208-4C10-A191-1A7EBD9129ADEurope/Berlin20140731T113000OPAQUEAUTOMATICVortrag BA Christian Henning20140707T120233Z20140714T193512ZEurope/Berlin20140731T110000Raum 2241PUBLIC20140520T092006Z6340A936-EF0B-49D1-B032-55FDA353DA7AEurope/Berlin20140520T140000OPAQUEAUTOMATICLennart Suhr Diplomarbeitsvortrag20201113T122500Z20140520T092031ZEurope/Berlin20140520T1300002352PUBLIC20220413T075859Z20220504T123241Z20220504T123241Z48D0F50D-938C-428B-8D36-5CECDFECB0D7BA Zain: Berechnungskomplexität von Kontrolle und Bestechung in WahlsystemenEurope/Berlin20220505T150000Europe/Berlin20220505T154500PUBLIC2OPAQUEhttps://uni-hannover.webex.com/meet/vollmer120140924T075956Z54AFA579-57BE-4DED-97D1-5AFE15985F5EEurope/Berlin20141013T114500OPAQUEAUTOMATICVortrag Rössl20201113T122500Z20141009T173037ZEurope/Berlin20141013T1100006PUBLIC20141008T150147ZCC883F6F-86C4-425D-BE5F-BA635AD04875Europe/Berlin20141014T134500OPAQUEAUTOMATICVortrag Chandoo (MA)20141008T150147Z20141009T173038ZEurope/Berlin20141014T1300001URImessage:%3C5435485F.8070107@chandoo.de%3EPUBLIC20221024T080703Z4CCC756E-AFF1-4D19-823F-36D3390D0E9BEurope/Berlin20221123T134500OPAQUEAUTOMATICMA Ferry20221024T080732Z20221024T080732ZEurope/Berlin20221123T1300001PUBLIC20220426T191830ZEurope/Berlin20220512T14450020220426T191831ZEurope/Berlin20220512T14000020220426T191830Z0Strieker (MA: complexity of NN)OPAQUE604D0D26-45BC-4F7B-9D57-431D245F098EPUBLIC20161004T104704Z553659CE-2F39-4789-B72D-92D3EE464DA9Europe/Berlin20161027T143000OPAQUEAUTOMATICMA Vortrag Dulle: Implementierungen von parallelen Algorithmen auf GPGPUs20201113T122500Z20161004T105256ZEurope/Berlin20161027T1400000PUBLIC20220427T071710Z6B6C5D40-A16F-4F3E-9D96-BE38023924DBEurope/Berlin20220519T154500OPAQUEAUTOMATICMA Ahlers: Rechtfertigung der Effizienz von Algorithmen20220427T071740Z20220427T071731ZEurope/Berlin20220519T1500003408.16111PUBLIC20150206T091108ZEurope/Berlin20150318T11150020150206T091109ZEurope/Berlin20150318T10450020150206T091108Z2240BA HeidariOPAQUE59B556D6-3E4A-4587-AEC3-9107A0DEAE50URImessage:%3C5CEBE289-9E74-4B4E-B316-D5BF27321E7A@gmail.com%3EPUBLIC20150209T070949ZEurope/Berlin20150318T11200020150209T070950ZEurope/Berlin20150318T10450020150209T070949Z0Heidari: KnotentheorieOPAQUE3014D850-6ACD-4411-9BD4-E47DF9DF5F79URImessage:%3CD8D0586A-8A41-4F11-8E94-312A1806E9A3@thi.uni-hannover.de%3EPUBLIC20150204T151935Z23E0-54DBBC80-95-9F5DEDEurope/Berlin20150218T113000OPAQUEBA HeidariEurope/Berlin20150218T10300020150204T151935Z0PUBLIC20170329T082040ZEDBAFCFE-8B91-41DE-B9A4-10BB27206ACDEurope/Berlin20170411T140000OPAQUEAUTOMATICBA Vortrag Jan Wittler: Quanten-interaktive Beweissysteme20201113T122500Z20170329T100229ZEurope/Berlin20170411T1330000PUBLIC20200427T121505ZA87AD5FD-9023-4F62-A52F-103D70422786Europe/Berlin20200514T123000OPAQUEAUTOMATICBA Fabian Müller (Codebasierte Post-Quanten-Kryptographie)20200427T121543Z20200427T121542ZEurope/Berlin20200514T1200001PUBLICOPAQUEEurope/Berlin20141023T150000AUTOMATIC669C04F5-9329-43F2-9168-417304B46EC5Europe/Berlin20150101T130000Europe/Berlin20150129T130000Europe/Berlin20141113T130000Europe/Berlin20141225T130000Europe/Berlin20141120T130000Europe/Berlin20141218T130000Europe/Berlin20141127T130000Europe/Berlin20141204T130000Europe/Berlin20141211T130000Europe/Berlin20141030T13000020141026T081924Z9PUBLICOberseminar20141026T081924ZEurope/Berlin20141023T13000020140910T133737Z20150129T225959ZWEEKLY20150428T080633Z72C04CC8-5D5C-41EA-865E-9EA148635864Europe/Berlin20150513T121500OPAQUEAUTOMATICVortrag Lück (MA)20201113T122500Z20150428T080633ZEurope/Berlin20150513T1130000PUBLIC20191021T114110Z428B62D7-F6F8-4B8F-A953-5D93F9466D36Europe/Berlin20191106T140000OPAQUEAUTOMATICOrtmann: Pseudozufallszahlen in der Kryptographie20191021T114145Z20191021T114128ZEurope/Berlin20191106T1330001PUBLIC20171220T101543Z0E34BE45-DC0F-4B70-B0F2-F9497703B7D2Europe/Berlin20180111T150000OPAQUEAUTOMATICVortrag Sabrina Gaube (BA)20201113T122500Z20171220T101631ZEurope/Berlin20180111T1430000PUBLIC20150714T202052Z723ED1E2-72B7-4724-A6A1-E0D0158B902CEurope/Berlin20150901T163000OPAQUEAUTOMATICVortrag BA Röttcher20150714T202052Z20150714T202055ZEurope/Berlin20150901T1600000PUBLICOPAQUEEurope/Berlin20220112T15000070DAAB5E-645A-4097-8333-A9C29F1AF97520211103T135243Z11VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Berechenbarkeit mit logarithmischer Platzbeschränkung20211103T135243Z20211103T124823ZEurope/Berlin20220112T143000PUBLIC20180314T190506ZF8C1CD40-DEFC-45BB-8A2A-EF0F126A8C3CEurope/Berlin20180419T141500OPAQUEAUTOMATICBA Vortrag P. Höfer20180314T190506Z20180314T190507ZEurope/Berlin20180419T1345000URImessage:%3C3E2E0DC5-C769-4817-BD32-DC198414BB15@phil-hoefer.de%3EPUBLIC49786F46-41DC-4FD5-B994-138410BF8F3A49786F46-41DC-4FD5-B994-138410BF8F3ADATE-TIME19760401T005545ZNONE20170926T095312Z608FB0A6-0CEE-47DD-BBE4-343E65DBA3CDEurope/Berlin20171109T133000OPAQUEAUTOMATICMA Wadim Friedrich20201113T122500Z20171108T084656ZEurope/Berlin20171109T1300000PUBLICOPAQUEEurope/Berlin20220126T140000bd648ec2-7b51-418e-8a1d-600cd52bfa5920211103T135650Z10VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Probabilistisch überprüfbare Beweise20211103T135650Z20211103T124823ZEurope/Berlin20220126T133000PUBLIC20200610T150601Zc1a9862e-351b-42da-9572-1d75835bb8aaEurope/Berlin20200714T140000OPAQUEAUTOMATIC1TBS Seminar: Ein Vergleich von Schaltkreisgröße und Zeit auf Turing-Maschinen20200610T150910Z20200610T150910ZEurope/Berlin20200714T1330001PUBLIC20160419T100756ZBED1C6CF-9707-4D3B-9DEA-8C2A46BB878EEurope/Berlin20160510T140000OPAQUEAUTOMATICVortrag Obaidi (BA)20201113T122500Z20160502T070934ZEurope/Berlin20160510T1330000PUBLIC20220510T121254ZEurope/Berlin20220602T14450020220510T121254ZEurope/Berlin20220602T14000020220510T121254Z0Armstrong (MA: Circuit lower bounds)OPAQUE5978C750-9BCE-4285-9D31-65A9DB5E896BPUBLIC20211103T124823Ze3805b90-3ca7-451b-b850-57767da1cde3Europe/Berlin20220112T140000OPAQUEAUTOMATICSeminar KTh: Deskriptive Komplexität: Der Satz von Fagin20211103T135203Z20211103T135203ZEurope/Berlin20220112T133000VALUE-PARSE-ERRORNo value for URL property. Removing entire property:0PUBLIC20200422T085629Z1BE757AA-6BD4-4EA7-B2FA-76DBFF1D3DC4Europe/Berlin20200504T130000OPAQUEAUTOMATICVortrag Schulz (Algorithmische Analyse von Trainerdaten).20200422T085727Z20200422T085701ZEurope/Berlin20200504T1230001PUBLIC20160817T103912Z0DA21E7B-B51E-41DF-9E67-5DB80BB53793Europe/Berlin20160905T143000OPAQUEAUTOMATICVortrag BA Nowitzki20201113T122500Z20160817T103928ZEurope/Berlin20160905T1400000URImessage:%3Ctrinity-75418082-f4b5-46cb-afec-3956034603cb-1470774943430@3capp-gmx-bs51%3EPUBLIC20200610T150818Z943d1b1d-5779-49c0-b39c-c77724cd5083Europe/Berlin20200707T150000OPAQUEAUTOMATICTBS Seminar: Schaltkreise und Parallel Random Access Machines20200610T150836Z20200610T150836ZEurope/Berlin20200707T1430000PUBLIC20191115T133548Z309B2E93-5242-4E50-B645-185D2BE40F61Europe/Berlin20191212T140000OPAQUEAUTOMATICVortrag Tessmer (BA)20191121T085653Z20191115T133549ZEurope/Berlin20191212T1330000PUBLIC20181017T210109ZDDBF8B1A-90FA-4007-83E9-B59DC41B1CEEEurope/Berlin20181101T153000OPAQUEAUTOMATICVortrag H. Vollmer: A Complexity Theory for Hard Enumeration Problems20181029T194123Z20181029T194124ZEurope/Berlin20181101T1430002PUBLICOPAQUEEurope/Berlin20220118T1515005d56f2f1-b495-4a3f-9c2f-cfadbeb3d8a120211103T135502Z21VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: PSPACE-Vollständigkeit20211103T135502Z20211103T124626ZEurope/Berlin20220118T144500PUBLIC20161205T091636Z89033A6A-2EB2-4A2C-8834-3D2C05A08372Europe/Berlin20161208T141500OPAQUEAUTOMATICDr. Johannes Fichte: Answer Set Solving using Tree Decompositions and Dynamic Programming — The DynASP2 System and Counting—20161205T091636Z20161205T091636ZEurope/Berlin20161208T1345000While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving paradigms like answer set programming (ASP). Although ASP solvers are designed to enumerate all solutions, and counting can therefore be easily done, the involved materialization of all solutions is clearly a bottleneck for the counting problem of Answer Set Programming (#ASP). We propose dynamic programming algorithms for #ASP that exploit the structure of the underlying (ground) ASP program via the notion of tree decompositions. Experimental results for a prototype implementation show that our counting algorithms are very competitive when compared to existing solvers under the assumption that the tree width of the considered instance is sufficiently low.PUBLIC20151012T120542ZD2D5E739-7F47-4A75-815A-464D224FB9E3Europe/Berlin20151105T100000OPAQUEAUTOMATICBA-Vortrag Matschke20151012T121538Z20151015T082206ZEurope/Berlin20151105T0930002PUBLIC20180807T130053Z83B9B92D-1DCA-4FF0-84DA-8EFC4EB790F7Europe/Berlin20181004T141500OPAQUEAUTOMATICVortrag Lehmann (BA)20201113T122500Z20180807T130233ZEurope/Berlin20181004T1330000PUBLICOPAQUEEurope/Berlin20151203T140000BUSYb8431c41-3ec6-459b-96e0-9d48ba5041ea20151125T132025Z4PUBLICAUTOMATICMaurice Chandoo: Complexity of Adjacency Labeling Schemes20151123T111648Z20151109T122233ZEurope/Berlin20151203T13300020190326T164725Z873BC9F3-FE29-4D33-8690-6FEAD56712EAEurope/Berlin20190425T150000OPAQUEAUTOMATICHolzapfel, Komplexität nichtmonotoner Logiken (BA)20190326T164725Z20190326T164726ZEurope/Berlin20190425T1430000PUBLICF1ABD60C-BBAD-40F8-9661-D3435E835825F1ABD60C-BBAD-40F8-9661-D3435E835825DATE-TIME19760401T005545ZNONE20200610T151141Z07efb778-839e-455f-902b-8f54296c58dbEurope/Berlin20200721T140000OPAQUEAUTOMATICTBS Seminar: Arithmetische Schaltkreise für grundlegende Probleme20200610T151155Z20200610T151155ZEurope/Berlin20200721T1330000PUBLIC20150316T123202ZA16EE850-88E3-4240-84E3-998C067E0DA1Europe/Berlin20150409T150000OPAQUEAUTOMATICNicola Gruhl: A tool for nonmonotonic logics20150408T060702Z20150408T060703ZEurope/Berlin20150409T1430001PUBLIC20160419T101716ZED81463D-0034-434F-AFED-7D6093D46BA1Europe/Berlin20160510T143000OPAQUEAUTOMATICVortrag Wiebking (Überblick MA)20201113T122500Z20160502T071207ZEurope/Berlin20160510T1400000PUBLICPUBLIC20220511T082143ZEurope/Berlin20220629T14000020220511T144311ZEurope/Berlin20220629T13300020220511T144310Z1Ein Vergleich von Schaltkreisgröße und Zeit auf Turing-Maschinen (Manuel Breiden)OPAQUEa32bdc5d-8efc-445c-be09-698ac838ddccPUBLIC20221021T093754ZSeminarvortrag im Rahmen der KryptographievorlesungEurope/Berlin20230123T14450020230116T134628ZEurope/Berlin20230123T14200020230116T134627Z2Lukas Zain: Farfalle -- Parallel Permutation-based CryptographyOPAQUE720FD60C-7B26-4EA5-B6A8-D61A9868DCDDOPAQUEEurope/Berlin20221130T1200000DEA09E4-663A-409C-A03B-80489A1B1F4D20221021T093233ZSeminarvortrag im Rahmen der Kryptographievorlesung1PUBLICAUTOMATICTill Torhauer: Public Key Encryption with Keyword Search20221128T112056Z20221021T093233ZEurope/Berlin20221130T11300020170327T094832Z8A579FAD-B8AB-43F4-BA1B-CBCFF5CBB3BDEurope/Berlin20170404T133000OPAQUEAUTOMATICBA Schrage: Clique als Optimierungsproblem20201113T122500Z20170327T094837ZEurope/Berlin20170404T1300000PUBLICOPAQUEEurope/Berlin20170511T143000BUSY56B9E3F5-E20E-4100-AC6E-AF9671806F4120170504T110617Z1PUBLICAUTOMATICKomplexität Impliziter Repräsentationen (Maurice)20170504T110617Z20170425T101110ZEurope/Berlin20170511T13300020200610T150704Z4f3b3d42-0c4f-4484-9d8c-7421fdd802bfEurope/Berlin20200630T140000OPAQUEAUTOMATIC2TBS Seminar: Einführung in alternierende Turing-Maschinen20200610T150854Z20200610T150854ZEurope/Berlin20200630T1330001PUBLIC20211129T124656ZE7562F34-8C74-4386-A22B-EB077BD234F8Europe/Berlin20211217T110000OPAQUEAUTOMATICSchach-Seminar: Kobolde auf dem Schachbrett20211129T124709Z20211129T124701ZEurope/Berlin20211217T1000001PUBLIC20220511T082248Z20220511T082336Z20220511T082336Zfaf455e4-23b2-41af-8b03-4622caf0f82dEin Vergleich von Schaltkreistiefe und Platz auf Turing-Maschinen. Nicht-uniforme TMs (David Seehaus)Europe/Berlin20220629T140000Europe/Berlin20220629T143000OPAQUEPUBLIC20220511T082347Z20220511T082429Z20220511T082429Ze9560d90-ea8c-4ad5-bb63-adf0d2c42638Einführung in alternierende Turing-Maschinen (Julia Krivorutski)Europe/Berlin20220706T133000Europe/Berlin20220706T140000OPAQUEPUBLIC20220511T082607Z20220511T082638Z20220511T082638Z9366114b-a08a-4394-aa00-dcee915c8278Probabilistische Schaltkreise (Robin Schmöcker)Europe/Berlin20220713T133000Europe/Berlin20220713T140000OPAQUEPUBLIC20220511T082641Z20220511T082709Z20220511T082709Zee7b664c-65fc-47ef-8623-1933756e74efDer Satz von Smolensky (Elias Kayser)Europe/Berlin20220713T140000Europe/Berlin20220713T143000OPAQUEPUBLIC20230308T163956Z20230314T081639Z20230314T081639Za5aa053d-c5a5-4f3a-8deb-cb3772f92193Siegelmann PaperEurope/Berlin20230314T133000Europe/Berlin20230314T143000PUBLICOPAQUEVivian1OPAQUEEurope/Berlin20170420T14000040709ac6-f0a3-43e3-ac0b-80a12141fe1920170403T121728ZModal Team Logic (MTL) extends Väänänen’s Modal Dependence Logic (MDL) by Boolean negation. Its satisfiability problem is decidable, but the exact complexity is not yet understood very well. We investigate a model-theoretical approach and generalize the successful filtration technique to work in team semantics. We identify an “existential” fragment of MTL that enjoys the exponential model property and is therefore, like Propositional Team Logic (PTL), complete for the class AEXP(poly). Moreover, superexponential filtration lower bounds for different fragments of MTL are proven, up to the full logic having no filtration for any elementary size bound. As a corollary, superexponential gaps of succinctness between MTL fragments of equal expressive power are shown.10AUTOMATICMartin Lück: Filtration vs Team Semantics20170403T121728Z20170403T121242ZEurope/Berlin20170420T133000PUBLIC20181022T104942Z9DCB0A82-BBCA-426F-93B5-C5CBCDD9590DEurope/Berlin20181108T153000OPAQUEAUTOMATICVortrag Haak20181107T140947Z20181107T140948ZEurope/Berlin20181108T1430001PUBLIC20170529T132822Z2D7FD288-8DEE-4B5F-8DC9-C62F0D0A9ECFEurope/Berlin20170615T150000OPAQUEAUTOMATICVortrag Entrup20201113T122500Z20170529T132830ZEurope/Berlin20170615T1400000PUBLIC20200610T150741Z55edbecd-ca21-4306-9021-e1e34555f856Europe/Berlin20200630T143000OPAQUEAUTOMATIC1TBS Seminar: Die Klasse NC und alternierende Turing-Maschinen20200610T150843Z20200610T150843ZEurope/Berlin20200630T1400001PUBLICOPAQUEEurope/Berlin20220119T1400004def5fd7-1061-415b-a718-da7eca7ee93820211103T135533Z10VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Alternierende Turing-Maschinen 20211103T135533Z20211103T124823ZEurope/Berlin20220119T133000PUBLIC20200610T151024Zefcf9f21-fb49-41b1-841f-7f5a76b45b8dEurope/Berlin20200630T150000OPAQUEAUTOMATICTBS Seminar: Eine Orakelcharakterisierung der NC-Hierarchie20200610T151038Z20200610T151038ZEurope/Berlin20200630T1430000PUBLIC20150529T105733ZFD1AFEA0-594C-413E-8DFA-0D29EFE1B25CEurope/Berlin20150617T163000OPAQUEAUTOMATICProf. Vollmer: Team-based Logics on Kripke Structures20150529T105733Z20150529T105733ZEurope/Berlin20150617T1500000PUBLIC20190814T124925ZE94EE62E-64EA-46A3-BD9C-8E0FE8100646Europe/Berlin20190829T163000OPAQUEAUTOMATICVortrag Gercke (BA: Presburger Arithmetik)20190815T112038Z20190814T124950ZEurope/Berlin20190829T1600000PUBLICOPAQUEEurope/Berlin20210713T114500BUSYa8a67728-e4c1-4d44-8419-07f97039e48c20210713T071226Zhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 Themen: - Modelle - Nicht-Standard-Modelle - Die Prädikatenlogik der zweiten Stufe0PUBLICURIhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09text/html<html><head><style id=css_styles>blockquote.cite { margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc } blockquote.cite2 {margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc; margin-top: 3px; padding-top: 0px; } a img { border: 0px; } li[style='text-align: center;'], li[style='text-align: right;'] { list-style-position: inside;} body { font-family: Segoe UI; font-size: 12pt; }</style></head><body><div><div><div><div><a class=link-extern href=https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 rel=noreferrer noopener style=>https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09</a></div></div></div></div><div><br></div><div>Themen:</div><div><br></div><div>- Modelle</div><div>- Der Kompatkheitssatz</div><div>- Nicht-Standard-Modelle</div></body></html>AUTOMATICSeminarvorträge 20210713T071225Z20210624T070732ZEurope/Berlin20210713T10150020151009T110510ZAC6323E4-8B81-4BFB-A27F-BB0C920332F3Europe/Berlin20151014T153000OPAQUEAUTOMATICUntersuchungen des Implikationsbegriffs in verschiedenen Logiksystemen (BA Ahlers)20201113T122500Z20151009T110614ZEurope/Berlin20151014T1430000PUBLIC20191009T112851Z20E07EE8-9FBE-40FF-9176-69677E7302D3Europe/Berlin20191107T141500OPAQUEAUTOMATICBrodd: Hash-basierte Signaturverfahren20191021T114249Z20191009T112859ZEurope/Berlin20191107T1345000PUBLICOPAQUEEurope/Berlin20160127T150000BUSY2362EA1B-22FA-4179-9B25-732DBFBD387820160121T122336Z2PUBLICAUTOMATICVortrag Maurice: Circular-Arc Graph Isomorphism20160121T122336Z20160121T112325ZEurope/Berlin20160127T14000020220511T082435Z20220511T082506Z20220511T082506Z82d835a9-254b-44f1-91a8-aa620e110755Die Klasse NC und alternierende Turing-Maschinen (Stina Schäfer)Europe/Berlin20220706T140000Europe/Berlin20220706T143000OPAQUEPUBLIC20220511T082711Z20220511T082751Z20220511T082751Zf0dd8c74-629b-4a23-ad47-e72c2fd5a966Eine Orakelcharakterisierung der NC-Hierarchie (Jakob Wege)Europe/Berlin20220713T143000Europe/Berlin20220713T150000OPAQUEPUBLIC20230313T103334ZEurope/Berlin20230419T15150020230313T103334ZEurope/Berlin20230419T14300020230313T103334Z0BA Corbach (Heuristiken für Divide-and-Conqueor-SAT-Solver)OPAQUEC1D7125C-CA19-4E89-95FB-F2DD88F54F39PUBLICNONEDATE-TIME19760401T005545Z20161103T100658ZD52C5BA8-0D67-47DF-AABB-3A9B14F42DECEurope/Berlin20161114T143000OPAQUEAUTOMATICVortrag BA Owsiany: Spieltheoretische Semantik für ATL20201113T122500Z20161103T100743ZEurope/Berlin20161114T1400000PUBLIC20220511T082508Z20220511T082549Z20220511T082549Zd73268e2-6529-4a78-b351-9b0982406289Schaltkreise und Parallel Random Access Machines (Tim Hagen)Europe/Berlin20220706T143000Europe/Berlin20220706T150000OPAQUEPUBLICOPAQUEEurope/Berlin20150427T143000Europe/Berlin20150427T140000KalenderCLIENTurn:x-uid:27390203-4A63-46BB-85E8-57A1A147E18AE029F655-1E60-4A44-90BF-65FF053683F420150416T101307Z2AUTOMATICVortrag Hui Song (MA)20201113T122500Z20150415T083028Zarnemeier@gmx.net3.7TRUENEEDS-ACTIONArne MeierINDIVIDUALarnemeier@gmx.netCHAIRACCEPTEDKalenderINDIVIDUALurn:x-uid:27390203-4A63-46BB-85E8-57A1A147E18APUBLIC20180605T115827Z8536963A-DC23-418E-A96B-9717D5A03AB3Europe/Berlin20180830T143000OPAQUEAUTOMATICBA Vortrag Schwabe (Zero-Knowledge-Beweise in der digitalen Authentifikation)20180605T115827Z20180620T105545ZEurope/Berlin20180830T1400000PUBLIC20180808T092251ZEDA30268-3E42-4D5B-9EB2-6147B7550EFAEurope/Berlin20181004T150000OPAQUEAUTOMATICVortrag Nießen (BA)20180808T092251Z20180813T102124ZEurope/Berlin20181004T1415000URImessage:%3C42A2837D-EB32-4BED-A0AA-1B2EA0E05558@thi.uni-hannover.de%3EPUBLICE29AA7AF-00C9-4FA5-A450-8501496F4766E29AA7AF-00C9-4FA5-A450-8501496F4766DATE-TIME19760401T005545ZNONE20181023T114737ZC5DED6E4-608C-4212-9C82-1394EB84D090Europe/Berlin20181108T143000OPAQUEAUTOMATICMA-Vortrag D. Schulz: Backdoors in Default-Logic20181107T140950Z20181107T140951ZEurope/Berlin20181108T1400001PUBLIC20200506T090941Z0C0EF51D-1F15-4CE2-866F-BB21C74B6731Europe/Berlin20200520T103000OPAQUEAUTOMATICBA Armstrong20200506T090941Z20200506T090943ZEurope/Berlin20200520T1000000PUBLICOPAQUEEurope/Berlin20210708T134500F301942F-A9D3-4F2C-B554-C2BB7C5E38F720210617T101932ZMeeting-ID: 591 621 2181 Kenncode: 3FNcZp 3URItel://591%20621%202181AUTOMATICBA Fröhlich (Enumeration in Modaler Logik)20210708T105841Z20210611T074245ZEurope/Berlin20210708T130000PUBLIC20150921T113639Z42543974-42e7-4e81-bfc7-85ab5bd1077aEurope/Berlin20151022T150000OPAQUEAUTOMATIC1Martin Lück: Komplexität von CTL20151008T194500Z20151008T194502ZEurope/Berlin20151022T1300000PUBLIC20200506T090643Z21FD5BEE-CA60-4C12-948D-1413B3A638D2Europe/Berlin20200520T110000OPAQUEAUTOMATICBA J. Müller20200506T090648Z20200506T090649ZEurope/Berlin20200520T1030001PUBLIC20150309T132319Z7C8ABDB4-A938-4353-BF7D-31C127C304C3Europe/Berlin20150326T154500OPAQUEAUTOMATICThomas Schneider: Lightweight Description Logics & Branching Time: A Troublesome Marriage20201113T122500Z20150309T132319ZEurope/Berlin20150326T1400000PUBLIC20220511T082756Z20220511T082837Z20220511T082837Z6110e27c-eb05-457e-b8bd-ad818061ec22Deskriptive Komplexität: Der Satz von Immerman (Nicolas Fröhlich)Europe/Berlin20220720T133000Europe/Berlin20220720T140000OPAQUEPUBLIC20230313T133612ZEurope/Berlin20230419T16000020230313T133613ZEurope/Berlin20230419T15150020230313T133612Z1BA Grunwald (Claim-augmented Argumentation Frameworks)OPAQUE583AE28C-1062-4875-AEC2-6FA3E71F3D50PUBLICNONEDATE-TIME19760401T005545Z20221024T080732ZB26CE815-6A5E-4184-AFE6-F313C33902B5Europe/Berlin20221123T143000OPAQUEAUTOMATICMA Kayser20221024T080745Z20221024T080747ZEurope/Berlin20221123T1345001PUBLICOPAQUEEurope/Berlin20221205T144500C628B509-AC32-4980-A328-AB0D51273F1C20221202T084220ZSeminarvortrag im Rahmen der Kryptographievorlesung2PUBLICAUTOMATICJakob Wege: Pollards Rho-Methode20221204T194454Z20221021T093324ZEurope/Berlin20221205T14150020191015T115119Z5AD08B33-2A75-40B6-B778-4F146CF7BA39Europe/Berlin20191106T143000OPAQUEAUTOMATICXie: Vergleich verschiedener Parsing-Verfahren für Kontextfreie Sprachen20191021T114205Z20191016T085812ZEurope/Berlin20191106T1400000PUBLICOPAQUEEurope/Berlin20220119T143000a5611243-5e0a-4b0b-bab1-0482daf3543d20211103T135552Z21VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Ein #P-vollständiges Problem20211130T105008Z20211103T124823ZEurope/Berlin20220119T140000PUBLIC20200610T151233Z242ada88-351c-4b27-943b-84a8028d5007Europe/Berlin20200721T150000OPAQUEAUTOMATICTBS Seminar: Untere Schranken für Schaltkreise polynomieller Größe20200610T151250Z20200610T151250ZEurope/Berlin20200721T1430000PUBLICOPAQUEEurope/Berlin20220118T1445007b38b365-2af7-46ba-b0f4-0f55f18b3d6220211103T135452Z10VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: P-Vollständigkeit 20211103T135452Z20211103T124626ZEurope/Berlin20220118T141500PUBLIC20170710T115242Z3E5BAA77-A8AD-4442-9602-634FFFAD9A43Europe/Berlin20170810T110000OPAQUEAUTOMATICIrena: Default Logic and Treewidth20201113T122500Z20170803T071923ZEurope/Berlin20170810T1000000PUBLIC20220511T083018Z20220614T074413Z20220614T074413Zb13681ff-49b5-46d9-9a9b-2b1ffdcf89a1Arithmetische Schaltkreise und Straight-Line-Programme (Kai Hallmann)Europe/Berlin20220720T140000Europe/Berlin20220720T143000PUBLICOPAQUE1120240604T120256ZEurope/Berlin20240625T14000020240611T073748ZEurope/Berlin20240625T13300020240611T073748Z0BA Dukart: A GUI for Simulating AVL Tree AlgorithmsOPAQUEB23CDDA5-972B-4DD0-894D-BEAF614E3A07com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20171019T103357ZEE7D982F-D4EA-446D-B86D-3EBDE85594FDEurope/Berlin20171101T160000OPAQUEAUTOMATICVortrag Ehle (BA): Komplexität der Permanente20171019T103357Z20171019T103402ZEurope/Berlin20171101T1530000PUBLIC20191021T114738ZDF493A1E-479F-4D7E-AC13-0FD1BEB199C7Europe/Berlin20191029T133000OPAQUEAUTOMATICBarlag: Parallel Computation with Real Numbers20191022T073127Z20191021T115129ZEurope/Berlin20191029T1300000PUBLIC20160316T083548ZA6F0E1ED-15BF-4EE0-924B-F4FBBE765E49Europe/Berlin20160317T150000OPAQUEAUTOMATICFabian Müller: The Complexity of Problems for Linear Temporal Logic20201113T122500Z20160316T083620ZEurope/Berlin20160317T1400000PUBLIC20220518T084425Z80B081CE-7DE8-45C1-932C-A7B6F1809167Europe/Berlin20220602T153000OPAQUEAUTOMATICMayer (BA: Kurotto- und Juosan-Puzzle sind NP-vollständig)20220518T124033Z20220518T084432ZEurope/Berlin20220602T1445001PUBLIC20221029T061528ZEurope/Berlin20221102T16150020221029T061528ZEurope/Berlin20221102T15150020221029T061528Z16110Prof. Dr. Wojtek Jamroga, Polish Academy of Sciences, spricht zum Thema A Survey of Requirements for COVID-19 Mitigation StrategiesOPAQUE7D08302E-EE14-44AF-A313-675FCE525061PUBLIC20170321T105835Z556AB82F-7E74-4B51-BDDF-72BDBB42CE47Europe/Berlin20170406T140000OPAQUEAUTOMATICMartin Zimmermann: The First-order Logic of Hyperproperties20201113T122500Z20170321T105906ZEurope/Berlin20170406T1330000We investigate the logical foundations of hyperproperties. Hyperproperties generalize trace properties, which are sets of traces, to sets of sets of traces. The most prominent application of hyperproperties is information flow security: information flow policies characterize the secrecy and integrity of a system by comparing two or more execution traces, for example by comparing the observations made by an external observer on execution traces that result from different values of a secret variable. We establish the first connection between temporal logics for hyperproperties and first-order logic. Kamp's seminal theorem (in the formulation due to Gabbay et al.) states that linear-time temporal logic (LTL) is expressively equivalent to first-order logic over the natural numbers with order. We introduce first-order logic over sets of traces and prove that HyperLTL, the extension of LTL to hyperproperties, is strictly subsumed by this logic. We furthermore exhibit a fragment that is expressively equivalent to HyperLTL, thereby establishing Kamp's theorem for hyperproperties. Based on joint work with Bernd Finkbeiner (Saarland University).PUBLICOPAQUEEurope/Berlin20150702T120000BUSY10F39B63-F6BD-421E-AC7A-A875A874266920150629T122539Z1PUBLICAUTOMATICMA Haak20150629T122539Z20150617T142015ZEurope/Berlin20150702T11000020180822T085326Z66C756F8-DBBF-4ECA-A882-A3B0DE90ACDBEurope/Berlin20180917T114500OPAQUEAUTOMATICVortrag Urschumzev (BA)20180904T094937Z20180904T094938ZEurope/Berlin20180917T1100001PUBLIC20211103T124626Z1FC8A83C-1E1D-4591-A1B0-185487BD17D7Europe/Berlin20220111T144500OPAQUEAUTOMATICSeminar KTh: Die Komplexität des Erfüllbarkeitsproblems 20211103T134904Z20211103T134904ZEurope/Berlin20220111T141500VALUE-PARSE-ERRORNo value for URL property. Removing entire property:0PUBLIC20170420T122002ZA7DD874F-DC94-4FB3-9E0E-18A2D638BB79Europe/Berlin20170509T140000OPAQUEAUTOMATICFelix Schliephacke (Master-Vortrag): Visualisierung von Aroras Algorithmus für TSP20170420T122002Z20170420T124136ZEurope/Berlin20170509T1330000PUBLIC20171220T101457ZB5388C36-C1EA-4E02-9910-572A6BF3DDA8Europe/Berlin20180111T143000OPAQUEAUTOMATICVortrag Friederike Dziemba20201113T122500Z20171220T101515ZEurope/Berlin20180111T1330000PUBLICOPAQUEEurope/Berlin20220112T14300048010bef-3f29-4bc0-b59a-f990c87210c020211103T135257Z21VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Enumerationskomplexität20211103T135257Z20211103T124823ZEurope/Berlin20220112T140000PUBLIC20150703T112043Z33492B3E-5A13-425F-A706-30B2DA743294Europe/Berlin20150723T150000OPAQUEAUTOMATICChristian Brosy: Sorting Networks (Bachelor Arbeit)20150703T112043Z20150703T112045ZEurope/Berlin20150723T1430000URImessage:%3CCAO+eLGG1ghzj7x8wsGyJywE3yCzbx5h03Hw4BUDXuFpS-bBNAA@mail.gmail.com%3EPUBLIC20180924T100717ZD25D74A3-CCD9-41A2-8F6A-F76D07231CAAEurope/Berlin20181004T163000OPAQUEAUTOMATICBA Behr20181004T055158Z20181004T055159ZEurope/Berlin20181004T1545001PUBLIC20150609T154222Z5F23328E-D45D-471E-BDDE-3E2CBB7E164FEurope/Berlin20150618T143000OPAQUEAUTOMATICVortrag M. Reich (DA)20150609T154222Z20150609T154223ZEurope/Berlin20150618T1330000PUBLIC20170504T113203Z8A6FA554-020C-4B45-8047-A6997A785FBCEurope/Berlin20170601T143000OPAQUEAUTOMATICDr. Johannes Fichte: SAT-Based Local Improvement for Finding Tree Decompositions of Small Width20201113T122500Z20170504T113217ZEurope/Berlin20170601T1345000PUBLIC20170215T105813ZAC790B8A-D4FE-422B-A5DE-167BB154D45BEurope/Berlin20170314T140000OPAQUEAUTOMATICVortrag Marius Mühlen (BA: Einführung in die Beweisbarkeitslogik)20201113T122500Z20170215T105900ZEurope/Berlin20170314T1330000PUBLIC20230316T142247ZEurope/Berlin20230322T14000020230317T201633ZEurope/Berlin20230322T13150020230317T201632Z1BA Westphal (Resource Allocation Problems)OPAQUEFD5D1C47-E1DC-48D3-B0A2-3971154C54DFPUBLICNONEDATE-TIME19760401T005545Z20220519T092822ZF1C955FE-6F8F-46A8-B187-36E8BF5A6AAAEurope/Berlin20220615T151500OPAQUEAUTOMATICKässens (MA: Authentifizierte Verschlüsselung)20220519T124253Z20220519T092822ZEurope/Berlin20220615T1430001PUBLIC20220520T073127ZEurope/Berlin20220630T14450020220603T091936ZEurope/Berlin20220630T14000020220603T091921Z0Orlov (BA: Fractran)OPAQUEAF0250A8-CCE7-4E15-A479-98CC53D53917PUBLICOPAQUEEurope/Berlin20210706T114500BUSY9177ba6f-2f33-442f-8fb4-b34d65ec6d6320210624T070621Zhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 Themen: - Abacus-Berechenbarkeit - Die primitiv-rekursiven und die μ-rekursiven Funktionen - λ-Berechenbarkeit 0PUBLICtext/html<html><head><style id=css_styles>blockquote.cite { margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc } blockquote.cite2 {margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc; margin-top: 3px; padding-top: 0px; } a img { border: 0px; } li[style='text-align: center;'], li[style='text-align: right;'] { list-style-position: inside;} body { font-family: Segoe UI; font-size: 12pt; }</style></head><body><div><div><div><div><div><a class=link-extern href=https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 rel=noreferrer noopener style=>https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09</a></div></div></div></div></div><div><br></div><div>Themen:</div><div><br></div><div>&nbsp;- Abacus-Berechenbarkeit</div><div>&nbsp;- Die primitiv-rekursiven und die&nbsp;<span style=font-family: sans-serif\; font-size: 13.5261px\;>μ-rekursiven Funktionen</span></div><div><span style=font-family: sans-serif\; font-size: 13.5261px\;>&nbsp;-&nbsp;&nbsp;</span><span dir=ltr style=left: 142.61px\; top: 217.938px\; font-size: 13.5261px\; font-family: monospace\;>λ</span><span style=font-size: 12pt\;>-Berechenbarkeit</span></div><div></div><div><br></div><div><div></div></div></body></html>AUTOMATICSeminarvoträge BuL20210624T070621Z20210624T064855ZEurope/Berlin20210706T10150020160606T130021Z7467C718-E97F-4E58-9AA5-CBDBABB16847Europe/Berlin20160617T120000OPAQUEAUTOMATICDisputation Schwerdtfeger: Connectivity of Boolean Satisfiability20160606T130021Z20160612T112338ZEurope/Berlin20160617T1000000PUBLIC20171002T081537ZFDEFC078-7A55-47E6-9A2B-8DD5B8E9B14EEurope/Berlin20171101T153000OPAQUEAUTOMATICVortrag Perschin (BA): Resolution für Modallogik20201113T122500Z20171018T125725ZEurope/Berlin20171101T1500000PUBLIC20200526T105216Z1829950B-AF40-45E2-9C5C-777B020BA4DBEurope/Berlin20200604T113000OPAQUEAUTOMATICVortrag Snakker (QBF)20200526T105232Z20200526T105232ZEurope/Berlin20200604T1100001PUBLIC20191212T155929ZBEE2660A-B701-4C25-AA13-DF9AA649691EEurope/Berlin20200116T141500OPAQUEAUTOMATICBA Neal Asprion20191212T155956Z20191212T155939ZEurope/Berlin20200116T1345001PUBLICOPAQUEEurope/Berlin20200716T143000BUSY1cfba861-8f7f-41f9-9395-a4285fed05ab20200709T101545Z0PUBLICAUTOMATICBA Lemke20200709T101545Z20200709T101545ZEurope/Berlin20200716T14000020190109T122419Z94FBC193-20C2-4E3B-90DF-EC2BCFD85600Europe/Berlin20190214T150000OPAQUEAUTOMATICArne Meier: Elektronische Währung und die Blockchain20190109T122453Z20190109T122454ZEurope/Berlin20190214T1330000PUBLIC20190718T104608Z01C427AD-E7FF-4484-BC98-A76BFB0EE4E5Europe/Berlin20190814T153000OPAQUEAUTOMATICVortrag Koch (BA: CFG-Parsing)20190718T104655Z20190718T104646ZEurope/Berlin20190814T1500000PUBLICOPAQUEEurope/Berlin20210720T150000BUSYf8bf38c6-d9b3-445e-b576-25adc8f898fe20210719T083605Zhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 Themen: - Die Presburger Arithmetik ist hart für EXPTIME - Der Kompaktheitssatz0PUBLICURIhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09text/html<html><head><style id=css_styles>blockquote.cite { margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc } blockquote.cite2 {margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc; margin-top: 3px; padding-top: 0px; } a img { border: 0px; } li[style='text-align: center;'], li[style='text-align: right;'] { list-style-position: inside;} body { font-family: Segoe UI; font-size: 12pt; }</style></head><body><div><div><div><div><a class=link-extern href=https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 rel=noreferrer noopener>https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09</a></div></div></div></div><div><br></div><div>Themen:</div><div><br></div><div>- Die Presburger Arithmetik ist hart für EXPTIME</div><div>- Die Presburger Arithmetik ist entscheidbar</div></body></html>AUTOMATICSeminarvorträge BuL20210719T083604Z20210624T071045ZEurope/Berlin20210720T13300020260518T193811ZEurope/Berlin20260610T15450020260518T193813ZEurope/Berlin20260610T15000020260518T193811Z1MA Piepgras (Die Komplexität von Go)OPAQUE6BB89506-642A-49FC-A417-CA8B39A01A91com.apple.mobilecal0000000000PUBLIC20150528T101548Z06D0636C-29CE-452C-823E-E44115DFA0E2Europe/Berlin20150617T130000OPAQUEAUTOMATICProf. Steffen Reith: Kryptographische Methoden zur Authentifizerung für eingebettete Systeme20201113T122500Z20150528T101548ZEurope/Berlin20150617T1200000Methoden der Authentifizierung spielen in der Kryptographie eine zentrale Rolle und haben viele technische Anwendungen. Gute Beispiele dafür sind z.B. die Car-2-Car Kommunikation, das Laden von Elekrofahrzeuge, aber auch bei der Umsetzung der Ideen von Industrie 4.0 spielen Authentifizierungsverfahren eine große Rolle. Aufgrund der großen (praktischen) Wichtigkeit werden eine Vielzahl von teils sehr einfachen Vorgehensweisen (z.B. Challenge-Response-Systeme) verwendet, aber es gibt auch relativ komplizierte Algorithmen (z.B. Zero-Knowledge-Beweise, Schnorr-Authentifizierung), die anspruchsvolle Ergebnisse der Theoretischen Informatik und der Mathematik verwenden. Überlicherweise werden diese Methoden für leistungsstarke Rechensysteme ausgelegt und auf Geschwindigkeit optiermiert, ohne auf Ressourcen wie Kommunikations- oder Speicherbedarf zu achten. Dadurch sind diese Algorithmen meist nicht direkt für leistungsschwache Systeme einsetzbar. Im Vortrag werden einige dieser verbreiteten Methoden vorgestellt, bezüglich ihrer praktischen Umsetzbarkeit bewertet und für eingebettete Systeme und anwenderspezifische Schaltkreise (ASICs) optimiert. Dabei kommen eine erstaunliche Vielzahl von Ideen aus der Mathematik, theoretischen Informatik und aus technischen Informatik zu Einsatz.PUBLICOPAQUEEurope/Berlin20220125T154500156e43cc-e034-4a40-8f7d-1dd9dd067b8f20211103T135630Z42VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Interaktive Beweissysteme20211103T135630Z20211103T124626ZEurope/Berlin20220125T151500PUBLIC20160912T082354Z9453BD91-A37E-4349-A882-B385A9DB8E72Europe/Berlin20161027T140000OPAQUEAUTOMATICMA Vortrag Hilbich: Ein Program zur Enumeration in der Modallogik20160912T082354Z20161004T105256ZEurope/Berlin20161027T1330000PUBLIC20180905T084646Z14043BAF-967F-4CF3-9FC1-68719255B0DDEurope/Berlin20180913T150000OPAQUEAUTOMATICThomas Schneider: Conservative Extensions in Expressive Ontology Languages20201113T122500Z20180905T084715ZEurope/Berlin20180913T1400000This talk gives an overview of conservative extensions (CEs) in ontology languages, including description logics (DLs) and related FOL fragments. CEs are an important notion for defining a logically self-contained module of a logical theory, which in turn is useful for applications such as ontology reuse, versioning, and comprehension. Furthermore, CEs are related to uniform interpolants. We start with a brief survey of existing model-theoretic characterisations, (un)decidability, and complexity results. We then report about two recent pieces of work on CEs in expressive logics, namely FOL fragments (with a focus on the two-variable fragment FO2 and the guarded fragment GF) and Horn DLs with inverse roles. Both groups of logics have in common that standard model-theoretic characterisations in terms of unbounded bisimulations or homomorphisms fail, blocking the standard approach to establishing decidability. We report on alternative characterisations in terms of bounded bisimulations/homomorphisms and the challenge of combining them with automata techniques. Our main results for FOL fragments are undecidability of (deductive) CEs in any FO fragment that contains FO2 or GF, and 2ExpTime-completeness in the intersection GF2 of FO2 and GF. For Horn-DLs, we obtain 2EXPTIME-completeness of (query) CEs in Horn-ALCHIF (and also in Horn-ALC and in ELI). We obtain the same upper bound and a coNEXPTIME lower bound for deductive CEs. Joint work with Jean Christoph Jung, Carsten Lutz, Mauricio Martel, and Frank Wolter. PUBLICOPAQUEEurope/Berlin20160523T1430002D558FDA-4799-4C3C-9340-94989430647820160429T070731ZAppelstr. 4, Raum 2350AUTOMATICBA Holz20160428T174833Z20160428T174833ZEurope/Berlin20160523T140000PUBLIC20200610T151203Z5eae278d-17d4-4e31-8dc6-78a625410df1Europe/Berlin20200721T143000OPAQUEAUTOMATICTBS Seminar: Arithmetische Schaltkreise und Straight-Line-Programme20200610T151230Z20200610T151230ZEurope/Berlin20200721T1400000PUBLIC20181218T103731Z5F9A7633-3523-46BD-8FF3-45F6FA6320D4Europe/Berlin20190110T151500OPAQUEAUTOMATICVortrag Zühlke (BA)20181218T165020Z20181218T165021ZEurope/Berlin20190110T1430001PUBLIC20150818T095617ZBF5B1F88-7AD2-4EB7-8EC9-6460ADD2EF6FEurope/Berlin20150915T160000OPAQUEAUTOMATICBA Luttmann20201113T122500Z20150818T095617ZEurope/Berlin20150915T1500000PUBLIC20220524T123628Z685AE4AC-E241-49A3-ABCE-DFC5AD1519E6Europe/Berlin20220524T160000OPAQUEAUTOMATICJulia Krivorutski (The complexity of satisfiability for fragments of hybrid logic)20220524T123654Z20220524T123652ZEurope/Berlin20220524T1530001PUBLIC20221021T093556Z56E28959-E823-4CBD-9990-2F7C32681DDAEurope/Berlin20230109T144500OPAQUEAUTOMATICFabian Kuhl: Kolmogorov Complexity Characterizes Statistical Zero-Knowledge20221021T093626Z20221021T093556ZEurope/Berlin20230109T1415001Seminarvortrag im Rahmen der KryptographievorlesungPUBLICPUBLIC20221021T093435ZSeminarvortrag im Rahmen der KryptographievorlesungEurope/Berlin20221212T15150020221212T135404ZEurope/Berlin20221212T14450020221212T135403Z3Patric Plattner: TigerOPAQUE9B7A7297-2B1F-4134-A1F8-23983FF0153120160404T104646ZED6FF53D-B06D-40FA-91B0-2F791D0AA631Europe/Berlin20160414T143000OPAQUEAUTOMATICJan Eberhardt: Elliptische Kurven in der Kryptographie (BA-Vortrag)20201113T122500Z20160414T075822ZEurope/Berlin20160414T1330000URImessage:%3C3FB68B15-0E0F-4F7E-B4A9-D9A73E647A20@thi.uni-hannover.de%3EPUBLIC3F84F2A9-EC45-4AC9-B252-A76BB10418D63F84F2A9-EC45-4AC9-B252-A76BB10418D6DATE-TIME19760401T005545ZNONE20220531T122216Z3A3B7C92-B4C1-4499-840C-FD87BA278F77Europe/Berlin20220721T140000OPAQUEAUTOMATICNicolas Fröhlich (Submodel Enumeration of Kripke Structures in Modal Logic)20220531T122314Z20220531T122314ZEurope/Berlin20220721T1330001PUBLIC20220524T123711Z0ACE8CB2-039D-4F9B-8F43-C65EF4C3BCD0Europe/Berlin20220531T163000OPAQUEAUTOMATICTobias Brockmeyer (Model checking fingerprints of CTL operators)20220524T123739Z20220524T123730ZEurope/Berlin20220531T1600001PUBLIC20220524T123813Z63601091-7053-4DF3-8D38-F5412AE2C170Europe/Berlin20220621T160000OPAQUEAUTOMATICKai Hallmann (Complexity of lax-MINC-SAT)20220524T123918Z20220524T123813ZEurope/Berlin20220621T1530001PUBLICPUBLIC20220531T151324ZEurope/Berlin20220719T16300020220712T133206ZEurope/Berlin20220719T16000020220712T133206Z2Katharina Schick (The Complexity Of Model Checking For Boolean Formulas)OPAQUEAA461EC2-4322-42AB-B740-7A723AF0E3B720230503T061923ZEurope/Berlin20230510T15300020230503T061924ZEurope/Berlin20230510T14450020230503T061923Z0MA Fröhlich: Enumeration in Temporal LogicOPAQUEC61489C5-40F9-4D9E-85F4-07D32C3F2912PUBLICPUBLIC20220524T124020ZEurope/Berlin20220719T15300020220712T133205ZEurope/Berlin20220719T15000020220712T133203Z2Jakob Wege (Complexity of Clone Membership)OPAQUE274A61AF-EE75-47BD-ACB5-E32411655CA020160810T053741Z7D34F367-423D-4BBA-A4D2-0B8363067D04Europe/Berlin20160905T134500OPAQUEAUTOMATICVortrag BA Barlag20160810T053741Z20160810T053742ZEurope/Berlin20160905T1315000URImessage:%3Ctrinity-75418082-f4b5-46cb-afec-3956034603cb-1470774943430@3capp-gmx-bs51%3EPUBLIC20191015T114946Z360C3CBA-3669-4CB3-B271-922E86C73B01Europe/Berlin20191030T144500OPAQUEAUTOMATICLehmann: Analyse der lateinischen Grammatik bei verschiedenen Autoren20191021T114736Z20191015T153248ZEurope/Berlin20191030T1415001PUBLIC20190724T094635ZAF3179FA-5217-4DF6-B7EE-97C3F465364AEurope/Berlin20190829T143000OPAQUEAUTOMATICBA Kuznecov20190829T084320Z20190724T104751ZEurope/Berlin20190829T1400000PUBLIC20191121T085702Z8D58B573-7E23-4BD7-990B-E69BAD6414EDEurope/Berlin20191212T143000OPAQUEAUTOMATICYasir Mahmood: Parameterised Complexity of Abduction in Schaefer's Framework20191121T085724Z20191121T085716ZEurope/Berlin20191212T1400001PUBLIC20220524T123733Z5FABB5A3-CB02-410D-8FFB-BAF1A70F1603Europe/Berlin20220531T160000OPAQUEAUTOMATICElias Kayser (ASGAP and Kripke structures)20220524T123800Z20220524T123733ZEurope/Berlin20220531T1530001PUBLIC20220524T123926ZE136D656-12BA-43C1-B217-C5A751021B47Europe/Berlin20220621T163000OPAQUEAUTOMATICNicolas Fröhlich (Complexity of MINC-MC)20220524T124012Z20220524T123926ZEurope/Berlin20220621T1600001PUBLIC20181115T151423Z05CAADDA-E4FE-434F-AAAB-4D47145455CCEurope/Berlin20181218T143000OPAQUEAUTOMATICMA Vortrag Jan Eberhardt20181115T151511Z20181115T151455ZEurope/Berlin20181218T1400000PUBLIC20180620T105546Z8C09AD79-D523-450D-AEE8-9FEBA41A45D6Europe/Berlin20180830T140000OPAQUEAUTOMATICBA Vortrag Hawich (Post-Quantum-Kryptografie: Hash-basierte Verfahren)20180815T193912Z20180815T193913ZEurope/Berlin20180830T1330002PUBLIC20160414T091413Z72F7B1F2-7A71-42B2-B3C5-8B34B7A6291EEurope/Berlin20160526T110000OPAQUEAUTOMATICProf. Christina Brzuska: Assumptions in Cryptography20201113T122500Z20160525T120323ZEurope/Berlin20160526T1000000Zusammenfassung: If P=NP, virtually all cryptographic primitives (in particular symmetric-key encryption where the messages are longer than the key and public-key encryption) do not exist. As there is little hope that within our lifetime, one will prove that P is not equal to NP, the cryptographic community needs to rely on assumptions, and not surprisingly, cryptographic assumptions are an important area of research in cryptography. If we need to assume that P is not equal to NP is a necessary assumption for cryptography, then it would be most desirable to show that this assumption also suffices. Unfortunately, no results of this type are known and I will spend most of my talk explaining the difficulty of proving such a statement. If time permits (depending on the number of questions during the talk), I will then discuss indistinguishability obfuscation (iO) which is a fairly new cryptographic primitive that does not really fit with our existing conceptual frameworks. In particular, unlike all other non-trivial cryptography, if P=NP, then iO exists. Yet, iO is a very strong primitive that allows for a lot of fancy applications and is even mutually exclusive with other cryptographic assumptions.PUBLIC20190617T123207ZA9C4788C-9FBF-4859-94B8-170C41FFAF60Europe/Berlin20190815T150000OPAQUEAUTOMATICGandyra: Einwegfunktionen und Komplexitätstheorie20190814T135359Z20190814T135401ZEurope/Berlin20190815T1430001PUBLICDF199BE7-A44F-4356-B3C4-D5359FDC19C7DF199BE7-A44F-4356-B3C4-D5359FDC19C7DATE-TIME19760401T005545ZNONE20170314T140414ZF144AF9C-32B1-49A1-A9B3-8EA863C95896Europe/Berlin20170404T140000OPAQUEAUTOMATICVortrag Schobel (BA: Default Logik)20170324T074536Z20170324T074537ZEurope/Berlin20170404T1330000PUBLIC20150413T080911ZE3FA7275-FB97-4C68-A124-FCFDDB6939D6Europe/Berlin20150422T154500OPAQUEAUTOMATICBA Akselrod: Ein Tool für TSP-Algorithmen20150413T080911Z20150413T080912ZEurope/Berlin20150422T1500000PUBLIC20150331T064136Z9E8591F2-EA22-49B1-882D-459F967AC084Europe/Berlin20150415T170000OPAQUEAUTOMATICMaurice: Isomorphism for CA Graphs20150408T103627Z20150408T103629ZEurope/Berlin20150415T1600001PUBLIC20181008T160934ZCAA61AFF-D1AC-4E5E-BEBB-17BC827FF023Europe/Berlin20181025T160000OPAQUEAUTOMATICVortrag Charlotte Rauch (MA)20181008T163358Z20181008T163359ZEurope/Berlin20181025T1500001PUBLIC1B72A619-54D5-41EC-A7E9-FBE2AD20AAB51B72A619-54D5-41EC-A7E9-FBE2AD20AAB5DATE-TIME19760401T005545ZNONE20191127T130505Z65FD63A6-C433-43F6-8FEB-C297417C109AEurope/Berlin20191217T134500OPAQUEAUTOMATICBA Qengaj20191204T085555Z20191204T085556ZEurope/Berlin20191217T1315001PUBLIC20190910T140652ZDC90290C-3417-4FBD-985B-AE0E8E31F56CEurope/Berlin20191008T144500OPAQUEAUTOMATICBA Piremkumar20191008T111529Z20190910T140657ZEurope/Berlin20191008T1430000PUBLICOPAQUEEurope/Berlin20220125T1445006d7397a6-6165-4c3e-9660-1e246275b62f20211103T135605Z10VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Abschlusseigenschaften von #P20211103T135605Z20211103T124626ZEurope/Berlin20220125T141500PUBLIC20200416T140525Z5BE10CF4-0F6F-414A-AECD-065CBE291832Europe/Berlin20200505T133000OPAQUEAUTOMATICVortrag Mönnich (Wahlsysteme)20200416T160930Z20200416T160930ZEurope/Berlin20200505T1300002PUBLIC20211129T124558Z79149A4A-6513-4924-BCF2-D8498F97583CEurope/Berlin20211203T120000OPAQUEAUTOMATICSchach-Seminar: Hilfsmatt ist PSPACE-vollständig20211129T124612Z20211129T124608ZEurope/Berlin20211203T1100001PUBLIC20190912T141147Z57E9A30E-C2A5-4E47-99B8-ADFE815238CFEurope/Berlin20191008T153000OPAQUEAUTOMATICBA Kässens20190912T141153Z20190912T141153ZEurope/Berlin20191008T1500000PUBLIC20150422T093714ZD77A3AFF-56D2-47E0-8C78-98D9470991DDEurope/Berlin20150604T143000OPAQUEAUTOMATICVortrag Lena Wiese (Göttingen): Methods for logical database security20201113T122500Z20150422T093714ZEurope/Berlin20150604T1330000This talk gives an overview of security mechanisms for logical databases (or knowledge bases). A key characteristic of these mechanisms is that security policies are expressed as sets of logical formulas while an attacker tries to retrieve as much secret information from the database as possible. Preservation of secrecy is then defined by non-derivability of secrets from the database answers. A further characteristic is that the attacker may possess additional external information (also called background or a priori knowledge) that he can apply to derive more secret information. Logical formalisms presented in this talk are: - model-theoretic computation of secure views under expressive constraints - weakening of necessity degrees for possibilistic knowledge bases - horizontal fragmentation of multi-relational databasesPUBLICPUBLIC20221025T114015ZEurope/Berlin20221130T14150020221101T103718ZEurope/Berlin20221130T13300020221101T103717Z1Brockmeyer (MA)OPAQUE88EF96DD-920A-4978-98F1-B8CEC453020720170529T112742Z2B9DB69A-4D20-4262-9C8F-77E9D520C690Europe/Berlin20170626T133000OPAQUEAUTOMATICVortrag Wojtalla (DA: Omega-Automaten)20201113T122500Z20170617T194020ZEurope/Berlin20170626T1300000PUBLIC20200507T114655Z2ACF73E4-CE1B-4779-9A68-B52F7D2E7652Europe/Berlin20200528T130000OPAQUEAUTOMATICBA Zheng20200507T114655Z20200507T114656ZEurope/Berlin20200528T1230000PUBLIC20211129T124636ZDCC0BC46-412F-4975-AAD4-3A7150901947Europe/Berlin20211210T120000OPAQUEAUTOMATICSchach-Seminar: Königinnen im Exil20211129T124650Z20211129T124644ZEurope/Berlin20211210T1100001PUBLIC20190829T094318ZC3AF1612-933B-490E-8684-EEA91F8B94A0Europe/Berlin20191008T143000OPAQUEAUTOMATICBA Baruth20190829T094335Z20190829T094321ZEurope/Berlin20191008T1400000PUBLIC20150721T092941ZD8D1932D-07D7-45E5-9735-DEC9B209C93DEurope/Berlin20150901T153000OPAQUEAUTOMATICVortrag Simmet (BA)20201113T122500Z20150721T092941ZEurope/Berlin20150901T1500000PUBLIC20190826T070520Z7AAB0495-FD62-478C-BA7D-FE658B60454BEurope/Berlin20190912T153000OPAQUEAUTOMATICBA Saroglu20190829T084229Z20190826T070520ZEurope/Berlin20190912T1500000PUBLIC20200610T150928Z299199b4-29a4-4668-8449-a87507486070Europe/Berlin20200707T140000OPAQUEAUTOMATICTBS Seminar: Probabilistische Schaltkreise20200610T150940Z20200610T150940ZEurope/Berlin20200707T1330000PUBLIC20230508T132540ZEurope/Berlin20230606T15150020230508T132542ZEurope/Berlin20230606T1445002Höfer: Büchi-Automaten: Abschluss unter Vereinigung, Schnitt und ProjektionOPAQUEC0AC29B0-52FE-4016-9883-9FB63E7D4655PUBLIC20150721T093524Z2468A06D-76DF-4099-BFD5-ACFF85FE938CEurope/Berlin20150901T143000OPAQUEAUTOMATICVortrag Kretschmann (DA)20201113T122500Z20150721T093524ZEurope/Berlin20150901T1400000PUBLIC20190912T140948ZC18836A1-15E2-4AE2-9DC4-715038BBBEDDEurope/Berlin20191008T160000OPAQUEAUTOMATICMA Mühlen20190912T141009Z20190912T140959ZEurope/Berlin20191008T1530000PUBLIC20150908T130353ZC9D80C17-773D-4C48-978B-D187FE51FD12Europe/Berlin20150921T133000OPAQUEAUTOMATICBA Cramer: Ein Tool für Enumerationsalgorithmen20201113T122500Z20150908T130353ZEurope/Berlin20150921T1300000PUBLIC20170903T150635Z30D6A8F5-4267-48EC-A79D-4D9D300A1D86Europe/Berlin20170926T163000OPAQUEAUTOMATICBA Matter: Visualisierung formal-sprachlicher Algorithmen20201113T122500Z20170903T150717ZEurope/Berlin20170926T1600000PUBLICOPAQUEEurope/Berlin20220125T1515009ba4a670-71e4-4666-9caf-e000cab31f2420211103T135615Z21VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Die Counting-Hierarchie20211103T135615Z20211103T124626ZEurope/Berlin20220125T144500PUBLICOPAQUEEurope/Berlin20200827T153000BUSY6a5d33c4-dcee-4215-a286-f0230bfcdb7520200801T091037ZSensitivity Conjecture0PUBLICAUTOMATICBA Kruse20200801T091037Z20200801T091037ZEurope/Berlin20200827T150000OPAQUEEurope/Berlin20150129T14150064CAC1CD-2EC4-497D-863E-DD162F88120220150122T131729ZWe examine visibly counter languages, which are languages recognized by visibly counter automata (a.k.a. input driven counter automata). We are able to effectively characterize the visibly counter languages in AC0 and show that they are contained in FO[+].0PUBLICAUTOMATICAndreas Krebs: Visibly Counter Languages and Constant Depth Circuits20201113T122500Z20150122T132034ZEurope/Berlin20150129T13150020141105T111017Z50D1-545A1400-3-43ABA700Europe/Berlin20141203T153000OPAQUEAUTOMATICVortrag P. Nietardt (BA), Ein Tool für den Post'schen Verband20201113T122500Z20141105T111017ZEurope/Berlin20141203T1500000PUBLICOPAQUEEurope/Berlin20220111T151500302a5489-54f6-4978-b21b-2a233ac6eca520211103T134947Z11VALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Komplexität von Boole’schen Constraint Satisfaction Problems20211103T134947Z20211103T124626ZEurope/Berlin20220111T144500PUBLIC20211129T124618Z9990E2F0-B76D-4355-8332-A40BB2C2B34AEurope/Berlin20211210T110000OPAQUEAUTOMATICSchach-Seminar: Das Damenproblem20211129T124633Z20211129T124625ZEurope/Berlin20211210T1000001PUBLICOPAQUEEurope/Berlin20180201T1430004235FE89-ED29-4847-947F-71AA626EFEEB20180111T150315ZCanonical Models and the Complexity of Modal Team Logic We study modal team logic (MTL), the smallest modal logic with team semantics closed under Boolean negation. While its fragments, the modal logics of dependence, independence, and inclusion, are well-understood, the satisfiability problem of full MTL has been notoriously resistant to a complexity theoretical classification. We settle this open question and prove that the satisfiability and the validity problem of MTL are complete for a non-elementary complexity class we call TOWER(poly).10AUTOMATICVortrag Martin20180111T150315Z20180111T140812ZEurope/Berlin20180201T133000PUBLIC20200225T091619Z231EDCFA-16A4-4EF5-9CC6-65E35F11DF86Europe/Berlin20200317T103000OPAQUEAUTOMATICJohn (BA)20200225T091704Z20200225T091705ZEurope/Berlin20200317T1000001PUBLIC20211129T124518Z3BF03FFB-8275-4EED-8013-7DFC0C9B6D70Europe/Berlin20211203T110000OPAQUEAUTOMATICSchach-Seminar: Korrektheit einer Stellung bewerten20211129T124549Z20211129T124537ZEurope/Berlin20211203T1000001PUBLIC20180320T114216ZCA652970-C4F7-4DB7-B1D2-0B510C169E82Europe/Berlin20180419T150000OPAQUEAUTOMATICBA Vortrag H. Kiet Ta20201113T122500Z20180320T114300ZEurope/Berlin20180419T1430000Logische Grundlagen der Programmiersprache PROLOGPUBLICOPAQUEEurope/Berlin20200827T150000BUSY6fe82f0e-12ea-4343-bd30-aa80834df94b20200801T091009ZSynthesis of Machine Programs from Execution Traces1PUBLICAUTOMATICBA Mahlau 20200801T091009Z20200801T090958ZEurope/Berlin20200827T14300020200610T151050Za1e236d4-3088-43c3-a2d8-de8774482e99Europe/Berlin20200714T150000OPAQUEAUTOMATICTBS Seminar: Deskriptive Komplexität: Der Satz von Immerman20200709T135247Z20200610T151100ZEurope/Berlin20200714T1430000PUBLIC20200610T150950Z74d301b4-d6e9-451a-b581-613dd97fa6c0Europe/Berlin20200707T143000OPAQUEAUTOMATICTBS Seminar: Der Satz von Smolensky20200610T151006Z20200610T151006ZEurope/Berlin20200707T1400000PUBLIC20200610T151106Zd9847314-0ec5-47e6-a7f6-eba8965030c8Europe/Berlin20200714T143000OPAQUEAUTOMATIC1TBS Seminar: P-Vollständigkeit20200709T135245Z20200610T151126ZEurope/Berlin20200714T1400001PUBLIC20151106T143801Z1601D63B-AA3A-446D-A1BA-3B784554BFE1Europe/Berlin20151118T150000OPAQUEAUTOMATICVortrag Wahle (D)20201113T122500Z20151106T143816ZEurope/Berlin20151118T1400000PUBLIC20200210T121235Z8DDE0844-BBFA-4EE4-BEC6-B5E8C433F86CEurope/Berlin20200317T110000OPAQUEAUTOMATICStrieker (BA)20200210T121312Z20200210T121238ZEurope/Berlin20200317T1030001PUBLIC20140918T120547Z4307-541ACB00-4D-4C43A300Europe/Berlin20141009T181500OPAQUEAUTOMATICVortrag: Sergey Karthamsyhev, Resolution für modale Logiken20201113T122500Z20141009T093405ZEurope/Berlin20141009T1730002PUBLIC20220630T174318ZEurope/Berlin20220706T16300020220706T061050ZEurope/Berlin20220706T15300020220706T061047Z0Gastvortrag ChudigiewitschOPAQUE42A39150-DB37-4F72-B318-6FFA355589EDPUBLIC20220628T144755Z8F1B7F62-BEC7-4AF6-A1BD-374247B401BEEurope/Berlin20220901T144500OPAQUEAUTOMATICMike Grätz (BA: Erreichbarkeit in neuronalen Netzen)20220711T105014Z20220628T144757ZEurope/Berlin20220901T1400001PUBLICPUBLIC20220524T124101ZEurope/Berlin20220719T16000020220712T133206ZEurope/Berlin20220719T15300020220712T133204Z2Tim Hagen (Gap-Languages and Log-Time Complexity Classes)OPAQUE6A26D3FB-CF5C-4D80-BF42-D2FED969D62320230508T132540ZEurope/Berlin20230606T15450020230508T132542ZEurope/Berlin20230606T1515003Plattner: Büchi-TheoremOPAQUE41383F9A-14D5-4EF7-AD05-E988F32132E4PUBLIC20161128T095941Z896d1268-39fc-4b47-a1de-4767ae77c8c7Europe/Berlin20161215T144500OPAQUEAUTOMATIC1Vortrag Buling (MA): Obfuscation20161208T144326Z20161208T144326ZEurope/Berlin20161215T1345001PUBLIC20220719T090344Z3B10FEB9-8701-4BB7-8EC1-98137651FC11Europe/Berlin20220922T141500OPAQUEAUTOMATICBA Jurisch20220719T093532Z20220719T090356ZEurope/Berlin20220922T1330001PUBLIC20230508T132540ZEurope/Berlin20230606T14450020230508T132542ZEurope/Berlin20230606T1415001Ziehm: Büchi-Automaten: Allgemeine GrundlagenOPAQUEA98C60DD-31D7-44B9-9BA8-2905F09CF3E2PUBLIC20221021T093517Z7548D048-E9D3-4FCF-AE13-3F1EF46E38AAEurope/Berlin20221219T151500OPAQUEAUTOMATICNils Langius: ECDSA20221021T093540Z20221021T093517ZEurope/Berlin20221219T1445001Seminarvortrag im Rahmen der KryptographievorlesungPUBLICPUBLIC20240405T092656ZEurope/Berlin20240527T14100020240424T133337ZEurope/Berlin20240527T13300020240424T133336Z3403.A5015BA Shekho: Eine GUI für Rot-Schwarz-BäumeOPAQUE8431BC4F-85C0-4406-9C99-F363F94CF3BEcom.apple.calendar0000000000NONEDATE-TIME19760401T005545ZOPAQUEEurope/Berlin20210720T114500BUSY8e71565a-23cf-493f-bacf-6d5955ef945320210624T070949Zhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 Themen: - Monadische und dyadische Logik - Die Logik der Beweisbarkeit - Entscheidbarkeit der Gödel-Kalmar-Schütte-Klasse0PUBLICtext/html<html><head><style id=css_styles>blockquote.cite { margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc } blockquote.cite2 {margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc; margin-top: 3px; padding-top: 0px; } a img { border: 0px; } li[style='text-align: center;'], li[style='text-align: right;'] { list-style-position: inside;} body { font-family: Segoe UI; font-size: 12pt; }</style></head><body><a class=link-extern href=https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 rel=noreferrer noopener style=font-size: 12pt\;>https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09</a><div><br></div><div>Themen:</div><div><br></div><div>- Monadische und dyadische Logik</div><div>- Die Logik der Beweisbarkeit</div><div>- Entscheidbarkeit der Gödel-Kalmar-Schütte-Klasse</div></body></html>AUTOMATICSeminarvorträge BuL20210624T070949Z20210624T070949ZEurope/Berlin20210720T10150020190327T132349ZDBF208DB-1C41-4415-994E-6444476BD96DEurope/Berlin20190425T153000OPAQUEAUTOMATICSchneider, Korrespondentheorie (BA)20190327T132409Z20190327T132400ZEurope/Berlin20190425T1500000PUBLIC20170511T082319Z8E2A690B-C7E4-4F52-A295-624AA25A4089Europe/Berlin20170613T141500OPAQUEAUTOMATICVortrag Reinbold (Enumeration in Team Based Logics, MA)20201113T122500Z20170607T064043ZEurope/Berlin20170613T1330000PUBLIC20180822T085350ZB3ADF033-926F-4FFE-AC08-296485D26D57Europe/Berlin20180918T154500OPAQUEAUTOMATICVortrag Chudigiewitsch (BA)20201113T122500Z20180822T111124ZEurope/Berlin20180918T1500000PUBLIC20211213T103432ZAE636A07-EA3E-45D9-8FC9-230F5E6721D1Europe/Berlin20220114T110000OPAQUEAUTOMATICSchach-Seminar: Schach-Steganographie20211213T103432Z20211213T103432ZEurope/Berlin20220114T1000001PUBLIC20220719T093514ZDDE24AEF-629A-4177-AE59-618EA768BB50Europe/Berlin20220922T150000OPAQUEAUTOMATICBA Schmidtke20220719T093528Z20220719T093527ZEurope/Berlin20220922T1415001PUBLIC20220811T135626Z3A098A5B-0144-49BB-8278-95ECB9BB6797Europe/Berlin20220901T153000OPAQUEAUTOMATICEnno Teßmer: One-Way Functions from NP-Complete Problems20220811T135655Z20220811T135652ZEurope/Berlin20220901T1445001PUBLIC20230508T132639ZEurope/Berlin20230613T15150020230508T132642ZEurope/Berlin20230613T1445004Kalmbach: KomplementierungssatzOPAQUE3070B0EA-F759-45C5-AAD4-1B8978BB754APUBLICOPAQUEEurope/Berlin20210713T143000BUSYf3e593dd-b05b-482c-bcdc-755985d6674c20210713T071239Zhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 Themen: - Logische Normalformen - Das Craig'sche Interpolationslemma 1PUBLICURIhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09text/html<html><head><style id=css_styles>blockquote.cite { margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc } blockquote.cite2 {margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc; margin-top: 3px; padding-top: 0px; } a img { border: 0px; } li[style='text-align: center;'], li[style='text-align: right;'] { list-style-position: inside;} body { font-family: Segoe UI; font-size: 12pt; }</style></head><body><div><div><div><div><a class=link-extern href=https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 rel=noreferrer noopener style=>https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09</a></div></div></div></div><div><br></div><div>Themen:</div><div><br></div><div>- Logische Normalformen</div><div>- Das Craig'sche Interpolationslemma</div><div>- Die Prädikatenlogik der zweiten Stufe</div></body></html>AUTOMATICSeminarvorträge BuL20210713T071237Z20210624T070838ZEurope/Berlin20210713T133000OPAQUEEurope/Berlin20210706T150000BUSY0eb7910d-aaa3-4529-8cf4-4eaef916a41f20210624T070604Zhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 Themen: - Maschinenunabhängige Komplextitätstheorie - Rekursive Funktionen und Relationen - Die Ackermann-Funktion ist nicht LOOP-berechenbar 0PUBLICURIhttps://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09text/html<html><head><style id=css_styles>blockquote.cite { margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc } blockquote.cite2 {margin-left: 5px; margin-right: 0px; padding-left: 10px; padding-right:0px; border-left: 1px solid #cccccc; margin-top: 3px; padding-top: 0px; } a img { border: 0px; } li[style='text-align: center;'], li[style='text-align: right;'] { list-style-position: inside;} body { font-family: Segoe UI; font-size: 12pt; }</style></head><body><div><div><div><div><div><div><div><div><a class=link-extern href=https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09 rel=noreferrer noopener>https://us02web.zoom.us/j/83772254408?pwd=SnF5S251NHFvaWV4M3l2dHdpVTYxdz09</a></div></div></div></div></div></div></div></div><div><br></div>Themen:<div><br></div><div>- Die Ackermann-Funktion ist nicht LOOP-berechenbar</div><div>- Rekursive Funktionen und Relationen</div><div>- Maschinenunabhängige Komplextitätstheorie</div><div><div><div><div><div></div></div></div></div></div></body></html>AUTOMATICSeminarvorträge BuL20210706T093526Z20210624T070547ZEurope/Berlin20210706T13300020200422T085846ZDB0E0DCC-4636-44AB-A262-0834FB573891Europe/Berlin20200507T123000OPAQUEAUTOMATICBA Bilsky (Public-Key Kryptographie mit multivariaten quadratischen Gleichungen)20200423T211428Z20200422T085847ZEurope/Berlin20200507T1200000PUBLIC20171002T081038Z8FA2550E-9500-42C0-9F13-F1CFCA4217D5Europe/Berlin20171018T153000OPAQUEAUTOMATICVortrag Friedrich (DA): Steganographie20171002T151300Z20171017T075205ZEurope/Berlin20171018T1500000PUBLIC5489DF3D-D78E-46C8-A86A-0610B533042C5489DF3D-D78E-46C8-A86A-0610B533042CDATE-TIME19760401T005545ZNONEOPAQUEEurope/Berlin20221005T170000FA8DB499-63E3-48DC-8ACE-8899C7F589F020220901T100346Z16161PUBLICAUTOMATICBA Schwebs: Backdoors für SAT20221003T145156Z20220901T100259ZEurope/Berlin20221005T16150020230508T132639ZEurope/Berlin20230613T15450020230508T132642ZEurope/Berlin20230613T1515004Hlava: Deterministische Büchi-AutomatenOPAQUE59AF545A-9A75-44BF-A47B-FA33706E49BAPUBLICOPAQUEEurope/Berlin20221005T161500DA438CE5-F8FD-4E56-AA54-A2CFB125A12420220825T083541Z16161PUBLICAUTOMATICBA Bauer: Abstrakte Argumentation20221003T145153Z20220825T083535ZEurope/Berlin20221005T15300020211129T124713Z400D465C-162D-410C-BAD7-EF9D92DB5AD2Europe/Berlin20211217T120000OPAQUEAUTOMATICSchach-Seminar: Endspiele im m x n Schach20211129T124725Z20211129T124718ZEurope/Berlin20211217T1100001PUBLICOPAQUEEurope/Berlin20190321T144500BUSYE6E00028-AEF1-40E7-BC96-B9AE03D69DC420190304T123856Z3PUBLICAUTOMATICVortrag Maurice: Systematic Programming20190304T123856Z20190205T105126ZEurope/Berlin20190321T13450020220901T100223Z0F619A53-353F-4132-99C4-B2A7E5B2B1DCEurope/Berlin20220922T133000OPAQUEAUTOMATICEhrmuth (BA)20220901T111546Z20220901T111546ZEurope/Berlin20220922T1245001PUBLIC20230508T132639ZEurope/Berlin20230613T14450020230508T132642ZEurope/Berlin20230613T1415003Bruhn: Komplementierung von Büchi-AutomatenOPAQUE13116709-3854-4A7F-AF8C-5EEEDEDDDCB4PUBLIC20190325T135918Z84397E49-EFA2-4B26-8438-DDA9A3347663Europe/Berlin20190425T143000OPAQUEAUTOMATICMüller, Prädikatenlogik 2. Stufe (BA)20190325T135920Z20190325T135918ZEurope/Berlin20190425T1400000PUBLIC20200506T090915Z4889E9CB-382A-4C97-B5A1-63CD70A7DAD9Europe/Berlin20200520T113000OPAQUEAUTOMATICBA Thieu20200506T090915Z20200506T090916ZEurope/Berlin20200520T1100000PUBLIC20161102T121948Z6F2E5B8E-7246-4D20-B8D0-E7194DBF5D16Europe/Berlin20161114T140000OPAQUEAUTOMATICVortrag MA Wiebking: Group Isomorphism20161102T122148Z20161102T122149ZEurope/Berlin20161114T1330000PUBLIC20180809T122939Z9C17C882-1676-439E-ACF4-879B0FF9500EEurope/Berlin20181004T154500OPAQUEAUTOMATICVortrag Werth (BA)20180809T122946Z20180813T102134ZEurope/Berlin20181004T1500001PUBLIC20140227T090947Z5EAA8B6E-6066-4506-A55A-DE0BAB1CDD61Europe/Berlin20140311T140000OPAQUEAUTOMATICOberseminar: Vortrag P. Krüger (DA)20201113T122500Z20140227T091021ZEurope/Berlin20140311T1330005PUBLICOPAQUEEurope/Berlin20220929T160000294AB545-EC2B-40B1-8A2E-64DD6DB6698E20220720T085406ZHybrid: Room 027 Appelstr. 4 + https://uni-hannover.webex.com/join/mahmood 1PUBLICAUTOMATICDisputation Yasir Mahmood20220914T141545Z20220720T085348ZEurope/Berlin20220929T13450020221021T093517Z02A7A44A-E72B-49D1-A89E-A8D51CD9DF97Europe/Berlin20221219T154500OPAQUEAUTOMATICTim Hollmann: Zertifikate20221021T093550Z20221021T093517ZEurope/Berlin20221219T1515001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20230703T080621ZEurope/Berlin20230726T14450020230703T080622ZEurope/Berlin20230726T1400000MA Vortrag JaegerOPAQUE733B9DC1-905A-4CE2-9B1A-FBD94356B6CCURImessage:%3C5bc1ec6f-552a-8989-cb39-c2300410d002@thi.uni-hannover.de%3EPUBLICNONEDATE-TIME19760401T005545ZOPAQUEEurope/Berlin20201126T140000DFC60BDB-A1DF-45E9-A402-9BBFD65980B220201124T203620Zhttps://join.skype.com/lhw6MejKBHAE1URIhttps://join.skype.com/lhw6MejKBHAEAUTOMATICBA Rosik20201124T203619Z20201109T113623ZEurope/Berlin20201126T133000PUBLICOPAQUEEurope/Berlin20210323T15000084D917B9-D2AD-4623-9AC1-444448D31C8520210322T120644Zhttps://join.skype.com/mHPqBQQ3p2lS1URIhttps://join.skype.com/mHPqBQQ3p2lSAUTOMATICBA Tran20210311T131642Z20210311T131621ZEurope/Berlin20210323T143000PUBLICOPAQUEEurope/Berlin20190827T17000045D1C9EA-E3FF-4A98-8611-A5DF231887D920190820T075350Z3703 224How to Save Democracy or Towards Model Checking of E-Voting Protocols in Alternating-time Temporal Logic Abstract: Properties of receipt-freeness, coercion resistance, and voter verifiability refer to the existence (or nonexistence) of an appropriate strategy for the voter, the coercer, or both. One can try to specify such properties by formulae of a suitable strategic logic, such as Alternating-time Temporal Logic (ATL). However, automated verification of strategic properties in scenarios with partial observability is notoriously hard, and novel techniques are needed to overcome the complexity. I will start with an overview of the relevant properties, show how they can be specified in ATL, and present some novel results for model checking ATL with partial observability that we have obtained in the Polish-Luxembourgish project VoteVerif.0AUTOMATICVortrag W. Jamroga 20190820T075349Z20190820T075349ZEurope/Berlin20190827T160000PUBLICOPAQUEEurope/Berlin20210331T14000055045BD5-BA2F-4B7B-B974-ED3CDE08949A20210304T183629Zhttps://join.skype.com/lstXGqtNHL0j1URIhttps://join.skype.com/lstXGqtNHL0jAUTOMATICBA Natusch: Pseudodeterministische Datenstrom-Algorithmen20210303T101017Z20210219T084532ZEurope/Berlin20210331T133000PUBLIC20210106T091110Z13814833-e471-43dd-92f0-dd516fbd0233Europe/Berlin20210126T123000OPAQUEAUTOMATICThpK Seminar: Extremal Method (Armstrong)20210119T102224Z20210106T091159ZEurope/Berlin20210126T120000https://us02web.zoom.us/j/89640398957?pwd=WjNnbUJ1NzlkNmdNRS8wbUNZYkZEQT090PUBLICOPAQUEEurope/Berlin20210916T14000005A2D0DF-38F6-4D79-BA1E-2B043D49A0E220210817T113537Zhttps://uni-hannover.webex.com/meet/arne.meier1URIhttps://uni-hannover.webex.com/meet/arne.meierAUTOMATICBA Burmeister (Hash-basierte Nachrichten-Authentifizierungs-Codes)20210916T113357Z20210817T113528ZEurope/Berlin20210916T133000PUBLICOPAQUEEurope/Berlin20151208T16150059B6F642-4C9A-4829-9624-B0659C2A7D8520151125T124836Z235 Determining the winner of a Parity Game is a major problem in computational complexity with a number of applications in verification. In a parameterized complexity setting, the problem has often been considered with parameters such as (directed versions of) treewidth or clique-width, by applying dynamic programming techniques. In this talk we show how to adopt a parameterized approach which is more inspired by well-known (non-parameterized) algorithms for this problem. We consider a number of natural parameterizations, such as by Directed Feedback Vertex Set, Distance to Tournament, and Modular Width. We show that, for these parameters, it is possible to obtain recursive parameterized algorithms which are simpler, faster and only require polynomial space. We complement these results with some algorithmic lower bounds which, among others, rule out a possible avenue for improving the best-known sub-exponential time algorithm for parity games.0AUTOMATICSebastian Ordyniak: Parameterized Algorithms for Parity Games20201113T122500Z20151125T124753ZEurope/Berlin20151208T151500PUBLIC20210304T105741Z5DFF6186-F291-41F5-A309-05855D921ABBEurope/Berlin20210331T150000OPAQUEAUTOMATICBA Thomsen: Selbstreduzierbarkeit20210304T183149Z20210304T183150ZEurope/Berlin20210331T143000https://meet.uni-hannover.de/BAThomsen1PUBLICOPAQUEEurope/Berlin20211014T1345002C27D72D-21CF-45DE-B123-474FD79300BF20211012T130117Zhttps://uni-hannover.webex.com/meet/vollmerhttps://uni-hannover.webex.com/meet/vollmerURIhttps://meet.uni-hannover.de/babolling22URIhttps://uni-hannover.webex.com/meet/vollmerNo value for URL property. Removing entire property:BA-Vortrag Bolling (Wahlsysteme)20211014T110649ZEurope/Berlin20211014T13000020210916T144401ZAUTOMATICPUBLICOPAQUEEurope/Berlin20210923T1530003016AB20-1F18-4D93-A227-EC3AFBBABBF720210910T141742Zhttps://uni-hannover.webex.com/meet/arne.meier1URIhttps://uni-hannover.webex.com/meet/arne.meierAUTOMATICBA Hostermann (Teilen von Geheimnissen unter Verwendung von mathematischen Modellen)20210916T084028Z20210909T113304ZEurope/Berlin20210923T143000PUBLICOPAQUEEurope/Berlin20201203T140000BUSY9A9F23AF-E68A-433A-88F9-0D0F4EA3EFAD+ZOOMMEETINGNUMBER:9135923599720201203T122010Zhttps://zoom.us/j/91359235997?pwd=TnlpcFpFMEJOdWFZSUh6OGNSK2dpUT09https://zoom.us/j/91359235997?pwd=TnlpcFpFMEJOdWFZSUh6OGNSK2dpUT09 Meeting-ID: 913 5923 5997 Kenncode: 2871760URItel://913%205923%205997text/html<a href=https://zoom.us/j/91359235997?pwd=TnlpcFpFMEJOdWFZSUh6OGNSK2dpUT09>https://zoom.us/j/91359235997?pwd=TnlpcFpFMEJOdWFZSUh6OGNSK2dpUT09</a><br /><br />Meeting-ID: 913 5923 5997<br />Kenncode: 287176<br />AUTOMATICGutsfeld: Automata and Fixpoints for Asynchronous Hyperproperties20201203T122010Z20201106T130235ZEurope/Berlin20201203T133000PUBLIC57D36EB3-38B7-49FB-8D3E-D73BD94814FF57D36EB3-38B7-49FB-8D3E-D73BD94814FFDATE-TIME19760401T005545Z20201203T122002ZTRUENONE20211118T083502Z0426CB97-EA24-454E-BB09-6D28DCE05173Europe/Berlin20211125T141500OPAQUEAUTOMATICA. Mahjoub (BA: Independence results)20211118T090059Z20211118T083544ZEurope/Berlin20211125T133000https://uni-hannover.webex.com/meet/vollmer1PUBLICOPAQUEEurope/Berlin20160808T150000AUTOMATICd18dfe70-3b09-4a6f-a290-dc485d48927320160729T112258ZRaum 224FALSE1. On the Implicit Graph Conjecture Maurice Chandoo The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined in terms of complexity classes such as P and EXP. For instance, GP denotes the class of graph classes that have a labeling scheme with a polynomial-time computable label decoder. Until now it was not even known whether GP is a strict subset of GR. We show that this is indeed the case and reveal a strict hierarchy akin to classical complexity. We also show that classes such as GP can be characterized in terms of graph parameters. This could mean that certain algorithmic problems are feasible on every graph class in GP. Lastly, we define a more restrictive class of label decoders using first-order logic that already contains many natural graph classes such as forests and interval graphs. We give an alternative characterization of this class in terms of directed acyclic graphs. By showing that some small, hereditary graph class cannot be expressed with such label decoders a weaker form of the implicit graph conjecture could be disproven. 2. A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits Anselm Haak We study the class #AC^0 of functions computed by constant-depth polynomial-size arithmetic circuits of unbounded fan-in addition and multiplication gates. No model-theoretic characterization for arithmetic circuit classes is known so far. Inspired by Immerman’s characterization of the Boolean class AC^0, we remedy this situation and develop such a characterization of #AC^0. Our characterization can be interpreted as follows: Functions in #AC^0 are exactly those functions counting winning strategies in first-order model checking games. A consequence of our results is a new model-theoretic characterization of TC^0, the class of languages accepted by constant-depth polynomial-size majority circuits. 3. Axiomatizations for Propositional and Modal Team Logic Martin Lück A framework is developed that extends Hilbert-style proof systems for propositional and modal logics to comprehend their team-based counterparts. The method is applied to classical propositional logic and the modal logic K. Complete axiomatizations for their team-based extensions, propositional team logic PTL and modal team logic MTL, are presented.TRUE62Vorträge Chandoo, Haak, Lück20160729T112258ZEurope/Berlin20160808T13300020160629T110347Zmeier@thi.uni-hannover.deREQ-PARTICIPANTTENTATIVEArne MeierINDIVIDUALurn:x-uid:FC401D3E-4201-4147-9FE0-37ADFC68A253haak@thi.uni-hannover.de5.3CLIENTmailto:haak@thi.uni-hannover.dePUBLICOPAQUEEurope/Berlin20170214T1230004bd4e583-acaf-4215-866e-a86d712c802c20170213T093304Z224Über zk-SNARKs. Zusammenfassung: Es wird eine Technik von C.Gentry, J. Howell, B. Parno und M. Raykova erläutert, mit deren Hilfe Berechnungen eines Provers schnell verifiziert werden können. Eine allgemeine Berechnung wird dazu in einen arithmetischen Schaltkreis aufgerollt und auf ein Problem über Polynomen reduziert. Zur Verifikation genügt die Auswertung des Polynoms an einer einzigen Stelle s, die der Prover aber nicht kennen darf. Zum Verfahren gehört auch, dass für eine Berechnung eine Reihe von Informationen (wie z.B. s) vorher verschlüsselt veröffentlicht, und dann im Beweis- und Verifikationsprozess verarbeitet werden, wobei die überwiegende Hauptarbeit vom Prover geleistet wird.21AUTOMATICVortrag Elmar Böhler20170213T093304Z20170207T100943ZEurope/Berlin20170214T113000PUBLICOPAQUEEurope/Berlin20200915T153000C095EA4F-C548-4E35-9F66-7888591500D420200914T135935Zhttps://join.skype.com/i89RGYbuzRUl12No value for URL property. Removing entire property:AUTOMATICGaube (MA): Zufallsbegriffe in der Berechenbarkeitstheorie20200914T135935Z20200825T090009ZEurope/Berlin20200915T150000PUBLICPUBLIC20220923T120928ZEurope/Berlin20221012T15000020220924T102705ZEurope/Berlin20221012T14150020220924T102704Z0BA Reinhardt (Ehrenfeucht)OPAQUE8785E5B4-A7D8-4369-A45A-4375202A8B3D20221021T093517ZA6F169BB-AD70-4E62-8E70-DFB54765ED2BEurope/Berlin20221219T144500OPAQUEAUTOMATICAntonia Ziehm: Sichere MACs aus sicheren Blockchiffren20221021T093531Z20221021T093517ZEurope/Berlin20221219T1415001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20221130T200618Z47B9AEB2-DA50-4DDE-B968-6BC8AA03C6FCEurope/Berlin20230125T120000OPAQUEAUTOMATICMarcel Rehn: Berechnung des Jacobi-Symbols in P20221130T200622Z20221130T200618ZEurope/Berlin20230125T1130001Seminarvortrag im Rahmen der KryptographievorlesungPUBLICOPAQUEEurope/Berlin20200916T143000EDBC24A4-F851-41B3-88EC-FFF3AB5B308120200914T140132Zhttps://join.skype.com/d3fRJ4vXGBeG12AUTOMATICHagen (BA)20200914T140132Z20200831T103827ZEurope/Berlin20200916T140000PUBLICOPAQUEEurope/Berlin20210729T1145003A4CE5D8-5E58-408B-8208-C8AA30F2441C20210706T111145Zhttps://us02web.zoom.us/j/5547370993 1URIhttps://us02web.zoom.us/j/5547370993AUTOMATICVortrag Jaeger (BA: Komplexität arithmetischer Operationen)20210729T084031Z20210706T111121ZEurope/Berlin20210729T110000PUBLIC20221004T114903ZC091EAEE-71EC-4C52-A8C9-4C57752B8AFAEurope/Berlin20221102T141500OPAQUEAUTOMATICBA Henkel: Logik-basierte Argumentation mit existenziellen Regeln20221004T115005Z20221004T114919ZEurope/Berlin20221102T13300016111PUBLIC20221013T080759ZBA44331A-10DC-4FEE-AA3D-FDFD330E6AE8Europe/Berlin20221101T151500OPAQUEAUTOMATICBA Neu20221019T121323Z20221013T080805ZEurope/Berlin20221101T14300016161PUBLICOPAQUEEurope/Berlin20221012T14150055CF022C-77F5-49DC-86E5-FFF323587C1320220912T075418Z16111AUTOMATICBA Hagemeier: Probabilistische Primzahltests20221012T111137Z20220912T075344ZEurope/Berlin20221012T133000PUBLICPUBLIC20230505T093243ZEurope/Berlin20230607T15450020230508T180644ZEurope/Berlin20230607T15000020230508T180644Z2BA Garrido Niezel: Graphrepräsentation von DatenbankenOPAQUE620DAD0C-39DD-43AA-AEF4-639C6A9F17D5NONEDATE-TIME19760401T005545Z20221021T093556ZC4E2E329-4CAB-4D7A-B3AC-41D0A77946D5Europe/Berlin20230109T154500OPAQUEAUTOMATICFelix Piepenbrink: Ein Syndrom-basiertes Zero-Knowlege-Protokoll20221021T093709Z20221021T093556ZEurope/Berlin20230109T1515001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20210106T090457Z9260957f-d4f5-4f1b-9bd7-25fd32bae815Europe/Berlin20210119T111500OPAQUEAUTOMATICThpK Seminar: Feedback Vertex Set und Closest String (Fazlija)20210106T090555Z20210106T090555ZEurope/Berlin20210119T104500https://us02web.zoom.us/j/89640398957?pwd=WjNnbUJ1NzlkNmdNRS8wbUNZYkZEQT090PUBLIC20201119T134450ZED0BD160-C3B5-4313-B036-0F9C945F0214Europe/Berlin20210107T140000OPAQUEAUTOMATICBA Ostendorf: Random-Walk-Algorithmen20210107T101936Z20201119T134459ZEurope/Berlin20210107T133000https://zoom.us/j/92246763861?pwd=UmpPeUVGNkthbUZIdWZFZGFIek9NQT091PUBLICOPAQUEEurope/Berlin20210708T143000A1EC6EF4-6A74-4EBA-9D99-9DE02D271D8120210704T182346Zhttps://us02web.zoom.us/j/55473709931URIhttps://us02web.zoom.us/j/5547370993AUTOMATICBA Schmöcker (Complexity of logical theories)20210704T182345Z20210616T133235ZEurope/Berlin20210708T134500PUBLICOPAQUEEurope/Berlin20200716T1400000DD0EDD1-6706-4DEF-8C2F-97A8F0A4CE7720200610T160319Zhttps://join.skype.com/jtHkgPbYs2WU0URIhttps://join.skype.com/jtHkgPbYs2WUAUTOMATICBA Janson: Visualisierung verschiedener Heuristiken für TSP20200714T092750Z20200610T160317ZEurope/Berlin20200716T133000PUBLICOPAQUEEurope/Berlin20141007T120000EB39D7AE-B0E3-48CC-8475-3CCC9D8FC7B820140911T131632Z3703-224(joint work with Matthijs Melissen and Henning Schnoor) We study the security of interaction protocols when incentives of participants are taken into account. We begin by formally defining correctness of a protocol, given a notion of rationality and utilities of participating agents. Based on that, we propose how to assess security when the precise incentives are unknown. Then, the security level can be defined in terms of defender sets, i.e., sets of participants who can effectively “defend” the security property as long as they are in favor of the property. In terms of technical results, we present a theoretical characterization of defendable protocols under Nash equilibrium, and study the computational complexity of related decision problems.4AUTOMATICWojtek Jamroga: Defendable Security in Interaction Protocols20201113T122500Z20140909T093130ZEurope/Berlin20141007T110000PUBLICOPAQUEEurope/Berlin20210505T1500008BA1A2CD-61BB-4FB0-A931-EF64C5B5B22F+ZOOMMEETINGNUMBER:9680385886320210506T121419Zhttps://zoom.us/j/96803858863?pwd=eDJ1NmZnV29jYVFlZnBSMTAyYTJhZz09Arne Meier lädt Sie zu einem geplanten Zoom-Meeting ein. Thema: BA Vortrag Kayser Uhrzeit: 6.Mai.2021 02:15 PM Amsterdam, Berlin, Rom, Stockholm, Wien Zoom-Meeting beitreten https://zoom.us/j/96803858863?pwd=eDJ1NmZnV29jYVFlZnBSMTAyYTJhZz09 Meeting-ID: 968 0385 8863 Kenncode: 952971 3120210506T121039ZAUTOMATICBA Vortrag Kayser20210506T121419Z20210419T074005ZEurope/Berlin20210505T141500PUBLICA0E0E198-25EE-4A82-9140-0551358170E1A0E0E198-25EE-4A82-9140-0551358170E1-PT10MReminderPROPERTY-PARSE-ERRORParse error in property name: ACKNOWLEDGEDDISPLAY20210106T091204Z513172e5-06d5-4f24-be34-a07f2891d202Europe/Berlin20210126T130000OPAQUEAUTOMATICThpK Seminar: Color Coding (Thomas)20210119T102227Z20210106T091242ZEurope/Berlin20210126T123000https://us02web.zoom.us/j/89640398957?pwd=WjNnbUJ1NzlkNmdNRS8wbUNZYkZEQT090PUBLIC20210106T091007Z5f62282e-fc91-4ab9-9aff-f993535c654eEurope/Berlin20210126T113000OPAQUEAUTOMATICThpK Seminar: Die Technik der Iterative Compression (Brockmeyer)20210119T085150Z20210106T091100ZEurope/Berlin20210126T110000https://us02web.zoom.us/j/89640398957?pwd=WjNnbUJ1NzlkNmdNRS8wbUNZYkZEQT090PUBLIC20160606T131425ZAF5A7446-85EF-417A-AEF3-9B0CB9DA228DEurope/Berlin20160622T120000OPAQUEAUTOMATICBA Vortrag Popeye Satjadiguna: Visualisierungen vom Ford-Fulkerson-Algorithmus20160606T131518Z20160614T125911ZEurope/Berlin20160622T113000Appelstr. 4, 0230PUBLICOPAQUEEurope/Berlin20201112T140000D92393E1-2DCA-45DE-942E-75B2E5BF2D2420201012T092316Zhttps://join.skype.com/kf6wCMp6W4wS1URIhttps://join.skype.com/kf6wCMp6W4wSAUTOMATICBA Seebonn 20201112T122621Z20201012T092308ZEurope/Berlin20201112T133000PUBLICOPAQUEEurope/Berlin20200915T1600005CCCEDF7-3E26-4A91-9F06-037CB15CA68920200914T140015Zhttps://join.skype.com/iNpk4fGYbYHh11No value for URL property. Removing entire property:AUTOMATICBrünn (BA): Quantifizierte Boole'sche Formeln20200914T140015Z20200827T183135ZEurope/Berlin20200915T153000PUBLIC20210909T111803Z1928F6ED-D8C8-4441-A142-432580B9C232Europe/Berlin20211007T140000OPAQUEAUTOMATICBA Jakob Wege (Polygontriangulierung)20211006T080216Z20210909T111831ZEurope/Berlin20211007T131500https://studip.uni-hannover.de/plugins.php/meetingplugin/room/index/ebe56413573b4efc05afb4c9ee37cb69/12437d0efda7e761584d431e7abb6859?cancel_login=11PUBLICOPAQUEEurope/Berlin20210304T143000BE25FE11-1624-457F-AC70-5F180D18E07920210302T193252Zhttps://meet.uni-hannover.de/BADanisch1AUTOMATICBA Danisch: Konzepte ausgewählter Kryptowährungen20210302T193251Z20210212T110917ZEurope/Berlin20210304T140000PUBLIC20210106T090139Z034a1e1a-ddad-4cc6-9880-3802fc41fff4Europe/Berlin20210119T104500OPAQUEAUTOMATICThpK Seminar: Probleme auf planaren Graphen (Mboutchouang)20210106T090451Z20210106T090451ZEurope/Berlin20210119T101500https://us02web.zoom.us/j/89640398957?pwd=WjNnbUJ1NzlkNmdNRS8wbUNZYkZEQT090PUBLICOPAQUEEurope/Berlin20201015T140000CCD84C70-1DCA-4FA7-8E93-A9F89047474820200922T115220Zhttps://join.skype.com/b9gvu29kyCsY0URIhttps://join.skype.com/b9gvu29kyCsYAUTOMATICBA Nixdorf20201015T073923Z20200922T115220ZEurope/Berlin20201015T133000PUBLICOPAQUEEurope/Berlin20200730T160000BUSY5b6b6ea4-daa1-40bd-856e-c5b882a7713c20200719T084207Zhttps://join.skype.com/d6AeG60nHpqCInterpreter for Machine Programs on Arbitrary Models of Computation0PUBLICKonrad Wienecke BA20200719T084207ZEurope/Berlin20200730T15300020200719T084207ZAUTOMATICOPAQUEEurope/Berlin20200709T140000C08B9095-F76C-4C75-9121-81968012DFA220200610T160339Zhttps://join.skype.com/iRxvR4D1dZRA0URIhttps://join.skype.com/iRxvR4D1dZRAAUTOMATICF. Chudigiewitsch: Homotopietypentheorie20200610T092450Z20200609T101037ZEurope/Berlin20200709T130000PUBLIC20221013T123205ZEurope/Berlin20221018T14000020221014T103801ZEurope/Berlin20221018T13000020221014T081422Z3408 16111L. Hella, Distributed computation models and modal logicsOPAQUE2823A454-072C-48EC-99F6-ACC06DAAB137PUBLIC20230509T075512ZEurope/Berlin20230607T16450020230509T075515ZEurope/Berlin20230607T1600000BA Kerner: Komplexität von SpielenOPAQUE1BF32F0F-5F27-4C1A-9016-36EBE22CC340PUBLICNONEDATE-TIME19760401T005545ZPUBLIC20221013T123825ZEurope/Berlin20221027T11300020221014T123146ZEurope/Berlin20221027T10300020221014T123146Z3408 16161H. Vollmer, Enumeration and circuitsOPAQUEB3074391-8940-4B52-9E85-363F52ED8BBB20230711T093307ZEurope/Berlin20230720T12000020230711T093309ZEurope/Berlin20230720T1100000Vortrag Thieu (MA: comp. soc. choice)OPAQUE0A835380-AB0A-4E07-AE29-8AD0DC101C69PUBLICNONEDATE-TIME19760401T005545ZOPAQUEEurope/Berlin20211007T1445006282B04C-9299-4630-9125-7835C1AA6AA320210902T053545Zhttps://uni-hannover.webex.com/meet/vollmerURImessage:%3C954-612fdd00-a9-fdf1440@11316767%3E0URIhttps://uni-hannover.webex.com/meet/vollmerAUTOMATICBA Dam Linh Tran (Rubik's Cube)20211004T120122Z20210902T053543ZEurope/Berlin20211007T140000PUBLICOPAQUEEurope/Berlin20210610T140000FE19C3DB-42DE-46D2-B1DD-70AD6C489BBB20210525T093513Zhttps://us02web.zoom.us/j/55473709932URIhttps://us02web.zoom.us/j/5547370993AUTOMATICSabrina: Complex computation 20210610T082249Z20210525T093401ZEurope/Berlin20210610T130000PUBLICOPAQUEEurope/Berlin20190715T18150025C665C4-4BCE-4FA4-93F0-99F79E11BEF620190513T123527Z1101 B302 (Hauptgebäude)Zusammenfassung: Spätestens seitdem Quanteneffekte in biologischen Systemen bestätigt wurden (Seth Lloyd 2007), wurde es naheliegend, das als Hinweis auf die Richtigkeit von Quantum-Mind-Theorien zu sehen. Hinzu kommt die aktuell forcierte Quantum-Computing-Forschung und -Entwicklung. Verbindet man beides miteinander, so legt sich die interessante Option nahe, das hochkomplexe System des menschlichen Gehirns als einen biologischen Quantencomputer zu verstehen. Technologische Chancen, aber auch Grenzen dieses Vergleichs werden besprochen. Zur Person: Dr. habil. Imre Koncsik, Jahrgang 1969, ist Professor für Systematische Theologie an der Päpstlichen Hochschule Heiligenkreuz/Wien. Über 16 Monografien und 60 Fachbeiträge. Sein interdisziplinärer Schwerpunkt liegt auf einer techniknahen Philosophie der Physik und Biologie. Er ist Initiator mehrerer interdisziplinärer Forschungsprojekte, internationaler Tagungen und Workshops zusammen mit Kollegen aus der Physik, Hirnforschung und Informatik zur Theorie des Geistes sowie zu praktisch-technologischen Anwendungen.0AUTOMATICProf. Dr. Imre Koncsik: Quantum Intelligence - eine Theorie des Geistes20190513T123614Z20190513T123527ZEurope/Berlin20190715T171500PUBLIC20150203T101659Z8D318D95-227D-44B3-B206-B644534C0F66Europe/Berlin20150318T141500OPAQUEAUTOMATICDaniel Wiebking: Graph Modification Problems20201113T122500Z20150203T101659ZEurope/Berlin20150318T1330002240PUBLIC20160524T065428Z4DC2A051-E228-4783-8503-F09367B405C5Europe/Berlin20160620T093000OPAQUEAUTOMATICMA Vortrag Tina Müller: Ein Polizisten-und-Räuber-Spiel auf Graphen20160604T141732Z20160604T141734ZEurope/Berlin20160620T090000Appelstr. 4, Raum 2240PUBLIC20210106T090744Z0e7e3062-d0d3-4e23-a81f-9643f128c097Europe/Berlin20210126T103000OPAQUEAUTOMATICThpK Seminar: Spannbäume und hereditäre Grapheigenschaften (Thieu)20210119T085147Z20210106T090837ZEurope/Berlin20210126T100000https://us02web.zoom.us/j/89640398957?pwd=WjNnbUJ1NzlkNmdNRS8wbUNZYkZEQT090PUBLIC20151104T113033Z1E5DAF1B-9F62-4A8B-AD57-4B9B1CD89294Europe/Berlin20151119T120000OPAQUEAUTOMATICVortrag Fichte: Backdoors to Tractability of Disjunctive Answer Set Programming 20151104T113033Z20151104T122155ZEurope/Berlin20151119T110000Raum 2350PUBLICOPAQUEEurope/Berlin20200915T14300021119054-EA23-46EA-8991-464940AFE55B20200914T135802Zhttps://join.skype.com/f21TzIhBXdvJ12AUTOMATICFarag (BA): SWIFFT20200914T135802Z20200825T090148ZEurope/Berlin20200915T140000PUBLICOPAQUEEurope/Berlin20200730T153000BUSYe9c31e40-19ad-4d6d-ba20-e0cfd05db38720200719T084224Zhttps://join.skype.com/eVMhFTYVILbxVisualisierung von Lindells Isomorphiealgorithmus für Bäume1PUBLICTien Hung Ngo BA20200719T084224ZEurope/Berlin20200730T15000020200719T083822ZAUTOMATICOPAQUEEurope/Berlin20210422T151500A0331143-BC25-4ACF-BD01-EFC95AF2A67420210406T094347Zhttps://us02web.zoom.us/j/5547370993 1URIhttps://us02web.zoom.us/j/5547370993AUTOMATICBA Surmann (Komplexität kontextfreier Parser und ein Zusammenhang mit dem Cliquenproblem)20210422T093422Z20210406T094327ZEurope/Berlin20210422T144500PUBLICOPAQUEEurope/Berlin20210603T143000A1022CAD-7045-4E19-8485-EFEB378E2F8320210601T135506Zhttps://us02web.zoom.us/j/55473709931URIhttps://us02web.zoom.us/j/5547370993AUTOMATICDavid (BA)20210602T090259Z20210601T135505ZEurope/Berlin20210603T133000PUBLICOPAQUEEurope/Berlin20210520T140000F0C61E61-16C5-4A3D-9CF3-A3298210076720210427T102959Zhttps://us02web.zoom.us/j/55473709931URIhttps://us02web.zoom.us/j/5547370993AUTOMATICMA Holzapfel (Komplexitätstheorie über algebraischen Körpern)20210427T103110Z20210427T102930ZEurope/Berlin20210520T131500PUBLICOPAQUEEurope/Berlin20210831T1445002FDA22EC-08CF-4807-9B14-35514CADEF9D20210817T120520Zhttps://us06web.zoom.us/j/86460578702?pwd=VzBuWHk5TnU5dGttRTd2eWhIcWVMUT09Zoom-Meeting beitreten https://us06web.zoom.us/j/86460578702?pwd=VzBuWHk5TnU5dGttRTd2eWhIcWVMUT09 Meeting-ID: 864 6057 8702 Kenncode: S5Gqz0 1URIhttps://us06web.zoom.us/j/86460578702?pwd=VzBuWHk5TnU5dGttRTd2eWhIcWVMUT09AUTOMATICBA Mathes20210817T134552Z20210817T120505ZEurope/Berlin20210831T140000PUBLIC20210119T110426Z96ED66EE-B27F-49A7-BD63-5145A72D23E1Europe/Berlin20210324T140000OPAQUEAUTOMATICBA Kabuth20210322T152425Z20210119T110428ZEurope/Berlin20210324T133000https://meet.uni-hannover.de/BAVortragKabuth0PUBLIC20221021T093556Z2E29E25E-9557-46CD-ACAA-A6F542EE30B3Europe/Berlin20230109T151500OPAQUEAUTOMATICJulia Krivorutski: Everything Provable is Provable in Zero-Knowledge20221021T093647Z20221021T093556ZEurope/Berlin20230109T1445001Seminarvortrag im Rahmen der KryptographievorlesungPUBLICPUBLIC20221021T093754ZSeminarvortrag im Rahmen der KryptographievorlesungEurope/Berlin20230123T13550020230116T134607ZEurope/Berlin20230123T13300020230116T134607Z4Martin Raska: Ein ZKP für SATOPAQUE47E23458-A604-4EE6-99EB-1CCC5189FC4920230904T081026ZEurope/Berlin20231025T15450020230904T081039ZEurope/Berlin20231025T14150020230904T081038Z0DuA Übung (einmalig)OPAQUEBB4DCC74-3E68-4149-8B8F-B3167BFF21C0PUBLICNONEDATE-TIME19760401T005545ZOPAQUEEurope/Berlin20200915T1500005A1F0837-7BFB-46D6-A284-AB996C8C658520200914T135844Zhttps://join.skype.com/mfsggFdloWad12AUTOMATICFerry (BA): Inkrementelle Berechnungskomplexität20200914T135844Z20200825T090516ZEurope/Berlin20200915T143000PUBLICOPAQUEEurope/Berlin20210114T1430004074EB1B-DC23-412F-9C4C-A63DE6CA062220210104T210438Zhttps://join.skype.com/hw3ixfDhFybO1URIhttps://join.skype.com/hw3ixfDhFybOAUTOMATICMA Nowitzki (Anwendung von SAT-Solvern in der Kryptoanalyse)20210112T093955Z20210104T210430ZEurope/Berlin20210114T140000PUBLICOPAQUEEurope/Berlin20210324T13300062F29FA9-CDCA-437F-AC4C-FF3839271A4720210305T111355Zhttps://us02web.zoom.us/j/55473709930URIhttps://us02web.zoom.us/j/5547370993AUTOMATICBA Bremer (Theorembeweiser für Dependence-Logik)20210305T111355Z20210305T111355ZEurope/Berlin20210324T130000PUBLIC20150211T203754Z87CD920C-86AD-4996-B7FF-978D78B04989Europe/Berlin20150318T112000OPAQUEAUTOMATICNasim Heidari: Knotentheorie 20150211T203820Z20150211T203821ZEurope/Berlin20150318T1045002240PUBLIC20160112T104319Zad847dca-2889-47a6-a668-628056495917Europe/Berlin20160121T150000OPAQUEAUTOMATICMartin Lück: Die Axiome der Team-Logik20160112T104349Z20160112T104349ZEurope/Berlin20160121T140000Raum 2240PUBLICOPAQUEEurope/Berlin20201217T1430000FA556B7-46E1-464E-A4B4-4AA102CBC2DE20201119T134633Zhttps://join.skype.com/lu9eSpHCvWns0URIhttps://join.skype.com/lu9eSpHCvWnsAUTOMATICHeni (BA: Tableaukalkül für modale Logik)20201217T104651Z20201119T134633ZEurope/Berlin20201217T140000PUBLICOPAQUEEurope/Berlin20210114T1400006331BEFC-9C99-45EE-ADAE-A5BA828AED4D20201201T133233Zhttps://zoom.us/j/5916212181?pwd=aGl0VEgrUm05UmJHN3U3V0N4TkYydz09Meeting-ID: 591 621 2181 Kenncode: 3FNcZp1URIhttps://zoom.us/j/5916212181?pwd=aGl0VEgrUm05UmJHN3U3V0N4TkYydz09BA Helmig (Räuber-und-Gendarm-Spiele auf Tseitin-Formeln)20210112T094357ZEurope/Berlin20210114T13300020201201T133222ZAUTOMATICPUBLIC20210106T090854Z167663fe-c896-453f-9aa4-1b75ce5fa1ebEurope/Berlin20210126T110000OPAQUEAUTOMATICThpK Seminar: Probleme aus der Computational Biology (Ferry)20210119T085148Z20210106T091002ZEurope/Berlin20210126T103000https://us02web.zoom.us/j/89640398957?pwd=WjNnbUJ1NzlkNmdNRS8wbUNZYkZEQT090PUBLICOPAQUEEurope/Berlin20201217T140000663E5519-E143-419B-BC7F-5F577EBEA2DE20201105T094808Zhttps://join.skype.com/nXhxV9PdB9qZ1URIhttps://join.skype.com/nXhxV9PdB9qZAUTOMATICMA Fischer20201217T091207Z20201105T094800ZEurope/Berlin20201217T133000PUBLICOPAQUEEurope/Berlin20161005T1400005685A26D-0134-4854-9EC4-902E4E2CD2E620161005T081059ZRaum 23511No value for URL property. Removing entire property:AUTOMATICMatt Angland: Cryptographic Hash Functions (BA Vortrag)20161005T081059Z20160926T084941ZEurope/Berlin20161005T133000PUBLIC20221021T093711ZFF8010AC-9E71-4AE7-B1C0-33B8C5811977Europe/Berlin20230116T151500OPAQUEAUTOMATICChris Burmeister: Das McEliece Kryptosystem20221021T093738Z20221021T093711ZEurope/Berlin20230116T1445001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20221204T194445Z0465FA9A-24B2-4E89-897E-FFAD7E509DA1Europe/Berlin20230125T113000OPAQUEAUTOMATICLoki Icking: Beweisbare Sicherheit von Elgamal20221204T194448Z20221204T194445ZEurope/Berlin20230125T1100001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20221128T112101Z7ACDD9C0-C01F-4803-9C12-16D3D4AD7235Europe/Berlin20221212T154500OPAQUEAUTOMATICLasse Müller: Rabins Public Key Kryptosystem20221128T112103Z20221128T112101ZEurope/Berlin20221212T1515001Seminarvortrag im Rahmen der KryptographievorlesungPUBLICPUBLIC20221101T104116ZEurope/Berlin20221129T14000020221129T121903ZEurope/Berlin20221129T13150020221129T121859Z16110Riedel (BA): Ein SAT-Algorithmus basierend auf dem Inklusion-Exklusion-PrinzipOPAQUE1AB2E93C-3945-4DC0-BFFA-4A5DF74A26A720230209T120831ZEurope/Berlin20230220T12000020230209T120833ZEurope/Berlin20230220T11000020230209T120831Z0Laura Strieker, Complexity of Neural NetsOPAQUE3D21C0B9-B740-43F4-A948-DA104FADAABFPUBLICNONEDATE-TIME19760401T005545ZOPAQUEEurope/Berlin20211007T153000B683D301-72ED-43C1-8416-9F3CD6F7E4EC20210910T110618Zhttps://uni-hannover.webex.com/meet/vollmer1URIhttps://uni-hannover.webex.com/meet/vollmerAUTOMATICBA Pawelek (Greibach's hardest CFL)20211004T120126Z20210909T091542ZEurope/Berlin20211007T144500PUBLICOPAQUEEurope/Berlin20200916T150000BUSYf7fa5b69-7944-4838-8654-1c7faa8c059220200914T140243Zhttps://join.skype.com/catqJOdjfP9g11PUBLICAUTOMATICLazarev BA20200914T140243Z20200903T100108ZEurope/Berlin20200916T143000OPAQUEEurope/Berlin20210422T1430000A85DFC9-91D5-4446-833E-F2BE88566FF820210315T131035Zhttps://us02web.zoom.us/j/5547370993 1URIhttps://us02web.zoom.us/j/5547370993AUTOMATICBA Curth (Komplexität logischer Theorien)20210422T093416Z20210315T131016ZEurope/Berlin20210422T140000PUBLICOPAQUEEurope/Berlin20151210T1430002A62AC9C-7463-4D89-8CA0-5B1173308CD920151125T124853Z224In this work we extend the classical notion of strong and weak backdoor sets by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class. Backdoor sets to heterogeneous base classes can be much smaller than backdoor sets to homogeneous ones, hence they are much more desirable but possibly harder to find. We draw a detailed complexity landscape for the problem of detecting strong and weak backdoor sets into heterogeneous base classes for SAT and CSP.0AUTOMATICSebastian Ordyniak: Backdoors into Heterogeneous Classes of SAT and CSP20201113T122500Z20151124T133139ZEurope/Berlin20151210T133000PUBLICOPAQUEEurope/Berlin20210304T140000A7CC70CE-6EAA-4C72-ADE4-93186422243420210302T193710Zhttps://join.skype.com/nejNr05vUVF21URIhttps://join.skype.com/nejNr05vUVF2AUTOMATICBA Reneberg: Allgemeine Schranken zu Maschinengrößen in der Chomsky-Hierarchie20210302T193710Z20210202T094605ZEurope/Berlin20210304T133000PUBLIC20221021T093110Z75718F95-5150-4D68-82B3-502805FC4548Europe/Berlin20221107T144500OPAQUEAUTOMATICKarl Böhlke: Lineare Kryptanalyse20221021T093110Z20221021T093110ZEurope/Berlin20221107T1415001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20170207T101030Z054d41eb-5fc7-4699-80a8-59fbf463aa52Europe/Berlin20170222T140000OPAQUEAUTOMATICJ.-S. Müller: Automatisches Fahren - eine spieltheoretische Sichtweise20170207T101045Z20170207T101045ZEurope/Berlin20170222T1300002240PUBLIC20210303T110510Z2C1D9778-736C-4C5E-B040-6D8FAC64C745Europe/Berlin20210331T143000OPAQUEAUTOMATICBA Volland: Datenstrom-Algorithmen20210303T110539Z20210304T183323ZEurope/Berlin20210331T140000https://meet.uni-hannover.de/BAJuliusVolland1PUBLICOPAQUEEurope/Berlin20201022T143000DA59B9BE-86D5-4EA3-8FD9-CDE2F8E66EDE20200925T091718Zhttps://join.skype.com/oKZPXyb6fJeI1URIhttps://join.skype.com/oKZPXyb6fJeIAUTOMATICLeonie Theis: PACE20201016T115544Z20200925T091653ZEurope/Berlin20201022T133000PUBLIC20221021T093110Z26A80FE3-A4A7-42FF-98F0-74189A336157Europe/Berlin20221107T151500OPAQUEAUTOMATICRuwen Sadacco: DES20221021T093110Z20221021T093110ZEurope/Berlin20221107T1445001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20221021T093711ZFE7D4B0D-A6C4-4F3B-8E12-C95B6D3F3F22Europe/Berlin20230116T144500OPAQUEAUTOMATICJulian Schmidtke: Von wegen überlegen!20221021T093723Z20221021T093711ZEurope/Berlin20230116T1415001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20230817T073734ZMüller: CFB-Mode und Stromchiffren Dorgelo: MIM bei DH verhindernEurope/Berlin20230906T15000020230817T073828ZEurope/Berlin20230906T14000020230817T073827Z0Seminarvorträge KryptographieOPAQUEE74A784E-367C-4C61-841E-057986383477PUBLICNONEDATE-TIME19760401T005545Z20230509T075316Z20230906T110230Z20230906T110230Z30A2A685-1A5E-48D3-9C36-D9ABE08F4575Julia Hermerding: Das Merkle-Hellman-KryptosystemEurope/Berlin20230913T160000Europe/Berlin20230913T164500PUBLIC1OPAQUE1OPAQUEEurope/Berlin20200915T16300087621537-FA6D-4486-820C-6B289EDCC19820200914T140051Zhttps://join.skype.com/ki8ZXvCIg54l11No value for URL property. Removing entire property:AUTOMATICBrockmeyer (BA): Endliche Modelleigenschaft in modaler Logik20200914T140051Z20200827T183056ZEurope/Berlin20200915T160000PUBLICOPAQUEEurope/Berlin20200827T143000D80A1EF0-BD71-4AA9-98B9-2542FFBD3EF320200824T202158Zhttps://join.skype.com/fJ9lzdld3dIV1URIhttps://join.skype.com/fJ9lzdld3dIVAUTOMATICBA Kouroutsidis: Historische Entwicklung der Matching-Algorithmen20200824T202157Z20200806T130149ZEurope/Berlin20200827T140000PUBLIC20210311T131746ZE0181BFB-8967-42FF-9EE6-119A448A51C9Europe/Berlin20210422T134500OPAQUEAUTOMATICBA Berger (Implementierung und Untersuchung von Algorithmen zur Produktion von pseudozufälligen Werten)20210419T102734Z20210311T131751ZEurope/Berlin20210422T131500https://meet.uni-hannover.de/batimberger1PUBLICOPAQUEEurope/Berlin20211021T1415004F2C1261-827B-42C3-AF48-9D63665C037720210927T165516Zhttps://uni-hannover.webex.com/meet/vollmer0URIhttps://uni-hannover.webex.com/meet/vollmerAUTOMATICMA Nießen (Kryptographie mit Rubik’s Cube)20211020T152052Z20210927T165410ZEurope/Berlin20211021T133000PUBLICOPAQUEEurope/Berlin20210113T141500C082B084-DC11-445B-9D27-21BB1E9FF60B20210107T200152Zhttps://aalto.zoom.us/j/62767994600In this talk I survey my recent joint work with Miika Hannula (Helsinki), Juha Kontinen (Helsinki), and Jan Van den Bussche (Hasselt) on logics and complexity in a setting that incorporates real numbers as first-class citizens. Background: Metafinite model theory (Grädel & Gurevich 1998) generalizes the approach of finite model theory by shifting to two-sorted structures that extend finite structures with another (often infinite) domain with some arithmetic (such as the reals with multiplication and addition), and weight functions bridging the two sorts. Finite structures enriched with real arithmetic are called R-structures. Blum-Shub-Smale machines (Blum, Shub & Smale 1989), BSS machine for short, are essentially random access machines with registers that can store real numbers and which can compute arithmetic operations on reals in a single time step. In addition for recognizing languages over the reals, BSS machines can also be used to recognize languages on the Boolean alphabeth {0,1}; e.g. Boolean languages recognizable by BSS-machiness in non-determinitic polynomial time coincides with the complexity class existsR (problems PTIME reducible to the existential theory of the reals) which lies somewhere between NP and PSPACE (defined with Turing machines). NP on BSS machines was logically captured by a variant of existential second-order logic over R-structures in (Grädel & Meer 1995). Our contribution: We study descriptive complexity of logics in the setting of probabilistic team semantics. This is a family of logics built-up from atomic expressions stating quantitative notions of dependence between random variables. E.g., probabilistic independence logic is built around an atomic statement that declares conditional probabilistic independence between tuples of random variables. Formulae, in this setting, describe properties of real-weighted distributions over first-order assignments. Hence, it turns out, that the descriptive complexity of related logics lie in the realm of BSS-machines. For pinpointing the exact complexity of logics in the probabilistic team semantics setting, we introduced a novel restricted variant of BSS machines, coined separate-branching BSS-machines or SBSS-machines. This led to various connections between logics using probabilistic team semantics, complexity classes defined via SBSS-machines, complexity classes defined via Turing machines, and restrictions of the variant of existential second-order logic of Grädel and Meer.URIhttps://research.cs.aalto.fi/theory/seminar/seminar.html1Jonni Virtema: Descriptive complexity of real computation and probabilistic team semantics20210108T190644ZEurope/Berlin20210113T13150020210107T200035ZAUTOMATICPUBLIC20221021T093119Z4143C00E-24A8-49BE-8777-4D412289CACCEurope/Berlin20221114T154500OPAQUEAUTOMATICLea Reinhart: Perfekte Sicherheit und der Satz von Shannon20221021T093150Z20221021T093119ZEurope/Berlin20221114T1515001Seminarvortrag im Rahmen der KryptographievorlesungPUBLICOPAQUEEurope/Berlin20221121T151500620ABE6E-0ECA-4520-B540-572C05A9484E20221021T093153ZSeminarvortrag im Rahmen der Kryptographievorlesung1PUBLICAUTOMATICKai Hallmann: Der AKS Primzahltest20221116T181028Z20221021T093152ZEurope/Berlin20221121T14450020240806T184420ZEurope/Berlin20240918T14150020240806T184421ZEurope/Berlin20240918T13300020240806T184420Z0BA WulkopfOPAQUEF9ECBC3F-F646-4CCD-AFD2-68870DEC1781com.apple.mobilecal0000000000PUBLIC20221115T125128Z2C119189-6235-4EED-B70B-D8575B220F37Europe/Berlin20221122T170000OPAQUEAUTOMATICLauri Hella, Generalized quantifiers and CSP20221115T125200Z20221115T125202ZEurope/Berlin20221122T1600001PUBLICOPAQUEEurope/Berlin20200629T1800006B0A7550-3440-4091-BF79-C710890AACF020200610T160551Zhttps://luis-uni-hannover.webex.com/luis-uni- hannover/j.php?MTID=med2d427199c3c4741d21377ce75f4e7cPasswort zum Betreten der Sitzung nG3JRC4fZx41URIhttps://luis-uni-hannover.webex.com/luis-uni-AUTOMATICAntrittsvorlesung Arne Meier: Von der Suche nach praxisrelevanten Parametern für nichtklassische Logiken20200610T160550Z20200610T160518ZEurope/Berlin20200629T170000PUBLICOPAQUEEurope/Berlin20201117T1730001D6E9813-0C28-4B55-9B71-524555E148F720201106T082711Zhttps://zoom.us/j/98362337639?pwd=SGpEMDBBT0tWdXcxVUdLdjFmSFptQT09Zoom-Meeting beitreten https://zoom.us/j/98362337639?pwd=SGpEMDBBT0tWdXcxVUdLdjFmSFptQT09 Meeting-ID: 983 6233 7639 Kenncode: 2367891URItel://983%206233%207639AUTOMATIC79. WORKSHOP ÜBER ALGORITHMEN UND KOMPLEXITÄT (THEORIETAG)20201116T143005Z20201106T082700ZEurope/Berlin20201117T091500PUBLICOPAQUEEurope/Berlin20211021T151500852AABE6-64E0-42A6-97B2-5D40AC3C89F020211001T101616Zhttps://uni-hannover.webex.com/meet/arne.meier1URIhttps://uni-hannover.webex.com/meet/arne.meierAUTOMATICBA Schüle (Chess Heatmap)20211021T072129Z20211001T101539ZEurope/Berlin20211021T143000PUBLIC20210106T090600Z8d910f33-5b65-4d23-95f7-a3bc66c07b09Europe/Berlin20210126T120000OPAQUEAUTOMATICThpK Seminar: Scheduling (Strieker)20210119T085154Z20210119T075548ZEurope/Berlin20210126T113000https://us02web.zoom.us/j/89640398957?pwd=WjNnbUJ1NzlkNmdNRS8wbUNZYkZEQT094PUBLIC20221021T093119ZD621A654-37D2-49B2-B04C-99C4292740ADEurope/Berlin20221114T151500OPAQUEAUTOMATICNassim Jahnke: CCA-Sicherheit20221021T093140Z20221021T093119ZEurope/Berlin20221114T1445001Seminarvortrag im Rahmen der KryptographievorlesungPUBLICPUBLIC20240424T145843ZEurope/Berlin20240624T14000020240424T190545ZEurope/Berlin20240624T13300020240424T190544Z3403.A5010BA Strothmann: Eine GUI zur Visualisierung von SortierverfahrenOPAQUECCFA3601-96CC-4656-AF49-F55234D72088com.apple.calendar0000000000NONEDATE-TIME19760401T005545ZOPAQUEEurope/Berlin20220118T154500ab044598-d449-4abd-a9fe-9ba05a2ad58720211103T135524Z32PUBLICVALUE-PARSE-ERRORNo value for URL property. Removing entire property:AUTOMATICSeminar KTh: Uniforme Diagonalisierung 20220117T142638Z20211103T124626ZEurope/Berlin20220118T15150020230508T132713ZEurope/Berlin20230620T14450020230614T074920ZEurope/Berlin20230620T14150020230614T074920Z3408.16013Hallmann: Müller-AutomatenOPAQUEAD80DC80-DEF2-41E2-983E-FB9083EC26C8PUBLIC20220118T143613Z31074A59-5793-4CD9-BE86-D7D6CE95280AEurope/Berlin20220126T143000OPAQUEAUTOMATICPUBLICSeminar KTh: Vollständige Probleme für Σp220220125T141734Z20220118T143613ZEurope/Berlin20220126T1400002PUBLIC20220114T082904ZEurope/Berlin20220211T11000020220203T181650ZEurope/Berlin20220211T10000020220203T181649Z2Schach-Seminar: Schach-Wertungszahlen und eine pandemisch bedingte VerzögerungOPAQUEC9A99184-6982-4667-AA9A-E02D6F94E0BAOPAQUEEurope/Berlin20220303T141500BBECE3BF-8093-442E-9346-C205BB90A46F20220125T141316Z3408.1611 *und* https://uni-hannover.webex.com/meet/arne.meier1PUBLICAUTOMATICBA Hallmann (Rubic's Cube)20220302T154628Z20220125T141240ZEurope/Berlin20220303T13300020220407T131017Z71D02F15-E7D0-4247-9C45-8974BB7B85A1Europe/Berlin20220505T150000OPAQUEAUTOMATICBA Brede: Charakterisierung und Vergleich bekannter Wegfindungsalgorithmen20220414T140744Z20220407T131026ZEurope/Berlin20220505T1415001611, Appelstr. 9A1PUBLICOPAQUEEurope/Berlin20220428T15000064C1F135-610A-4501-B97B-C2F58C40020920220323T194939Z3408.16111PUBLICAUTOMATICBA Boehnke: Komplexität von Ying Yang Rätseln20220426T090653Z20220323T142543ZEurope/Berlin20220428T141500PUBLIC20220221T134535ZEurope/Berlin20220330T14450020220329T122609ZEurope/Berlin20220330T14000020220329T122607Zhttps://uni-hannover.webex.com/meet/arne.meier2BA Jabs: Lineares Threshold-Secret-SharingOPAQUE87DC09B4-4316-4E02-A25D-6A38D1BBE82D20230508T132713ZEurope/Berlin20230620T15150020230614T074922ZEurope/Berlin20230620T1445003408.16014Lakhdher: Sequentielle Rabin-AutomatenOPAQUEF2F26C39-89D8-4E3D-A4DA-6B878908E720PUBLICOPAQUEEurope/Berlin20220428T1415008A6F5F8D-0F64-487E-8133-78BCB4FFCA0720220421T153325Z3408.16111PUBLICAUTOMATICBA Ballerstein: Die Komplexität von Fillmat20220426T090655Z20220322T122600ZEurope/Berlin20220428T133000PUBLIC20220401T124415ZEurope/Berlin20220505T14150020220423T143823ZEurope/Berlin20220505T13300020220423T143821Zhttps://uni-hannover.webex.com/meet/arne.meier1BA Olbrich: NP-Vollständigkeit von Dosun-Fuwari und Spiral GalaxiesOPAQUEC06BC646-A273-4B55-BC85-6624AC5014A620221021T093119Z14A16844-253E-4EE1-8527-AE3F3201F5F1Europe/Berlin20221114T144500OPAQUEAUTOMATICStina Schäfer: RR-Sicherheit20221021T093131Z20221021T093119ZEurope/Berlin20221114T1415001Seminarvortrag im Rahmen der KryptographievorlesungPUBLIC20221116T181029ZF35A58AE-6AE6-41DE-B659-5000F74833B2Europe/Berlin20221121T144500OPAQUEAUTOMATICAdrian Eberhardt: Der Solovay-Strassen-Test20221116T181045Z20221116T181039ZEurope/Berlin20221121T1415001PUBLICOPAQUEEurope/Berlin20220412T141500B6728A74-A522-4F28-9F89-418833FE830C20220307T125229Zhttps://uni-hannover.webex.com/meet/arne.meier0PUBLICAUTOMATICBA Gudi: Parametrische Komplexität und das Trainieren von neuronalen Netzen20220408T123755Z20220307T125228ZEurope/Berlin20220412T133000PUBLIC20220412T075340ZEurope/Berlin20220421T14450020220421T051551ZEurope/Berlin20220421T14000020220421T051549Zhttps://uni-hannover.webex.com/meet/arne.meier 1BA Baethke: Backgammon ist schwerOPAQUE8CA38130-EF5D-4ABF-AC29-10AD56141A6DOPAQUEEurope/Berlin20221212T1445009CD2DBDE-CFA3-4EDB-889D-E319B4AF5E3620221021T093435ZSeminarvortrag im Rahmen der Kryptographievorlesung1PUBLICAUTOMATICNicolas Fröhlich: The Whirlpool Secure Hash Function20221116T181101Z20221021T093435ZEurope/Berlin20221212T14150020230508T132713ZEurope/Berlin20230620T15450020230614T074924ZEurope/Berlin20230620T15150020230614T074924Z3408.16014Wege: McNaughton-TheoremOPAQUEAB5A6EBF-FE56-4E35-982C-959F7852B9DAPUBLIC20230220T124506Z20230314T095851Z20230314T095851ZA7887862-75CE-48B4-9D36-9344DFBEAE8FBA Kloetzing (Structured Neural Nets)Europe/Berlin20230322T140000Europe/Berlin20230322T144500PUBLIC2OPAQUE1NONEDATE-TIME19760401T005545ZPUBLIC20221021T093754ZSeminarvortrag im Rahmen der KryptographievorlesungEurope/Berlin20230123T14200020230116T134613ZEurope/Berlin20230123T13550020230116T134612Z4Katharina Schick: Iterated Pseudorandom RestrictionsOPAQUEEC938631-E730-4285-A29D-3A94844852EDOPAQUEEurope/Berlin20221121T1545001D199BBB-ED39-465C-8DD2-A30812B0751920221021T093153ZSeminarvortrag im Rahmen der Kryptographievorlesung1PUBLICAUTOMATICLenard Ehrmuth: Das Zahlkörpersieb20221116T181042Z20221021T093152ZEurope/Berlin20221121T15150020240501T071357ZEurope/Berlin20240508T15300020240501T071357ZEurope/Berlin20240508T15000020240501T071357Z0Hallman (MA: Transformer networks)OPAQUEC212F04A-0CEB-45E4-BF4A-2C02F83BAC15com.apple.mobilecal0000000000PUBLICPUBLIC20230817T073856ZEurope/Berlin20230913T15300020230911T095610ZEurope/Berlin20230913T15000020230911T095609Z1Kryptographie-Seminarvortrag DorgeloOPAQUE9F12FC18-B3CC-4D1B-802F-089775796494NONEDATE-TIME19760401T005545Z20240605T081657ZEurope/Berlin20240625T13300020240611T073733ZEurope/Berlin20240625T13000020240611T073733Z1BA Magerstedt: Eine GUI zur Visualisierung von binären SuchbäumenOPAQUEB6EC3A09-8EA9-48D8-967B-8308E53EB4A3com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20240611T073643ZEurope/Berlin20240625T15450020240611T073802ZEurope/Berlin20240625T15150020240611T073802Z0BA Kaiser: Eine GUI zur Visualisierung von B-BäumenOPAQUECD223269-A82A-42FB-B557-38B4C034B467com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545ZPUBLIC20240618T072725ZEurope/Berlin20240709T14300020240620T090101ZEurope/Berlin20240709T14000020240620T090101Z0BA Cedric LettnerOPAQUEB226D1CD-E220-406F-AC83-9F6811C7581Dcom.apple.calendar0000000000NONEDATE-TIME19760401T005545Z20240722T123755ZEurope/Berlin20240905T12000020240722T123756ZEurope/Berlin20240905T11000020240722T123755Z0Vortrag Renz (BA)OPAQUE42A5133F-354C-42D5-B0FC-DBEAAF722557com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545ZPUBLIC20230817T073846ZEurope/Berlin20230913T14550020230911T095606ZEurope/Berlin20230913T14300020230911T095605Z2Kryptographie-Seminarvortrag MüllerOPAQUEB6186C22-2017-4254-A270-2560AB84581CNONEDATE-TIME19760401T005545ZPUBLIC20231123T083000ZEurope/Berlin20240131T14300020231204T124759ZEurope/Berlin20240131T13300020231204T124759Z0MA Raska: Pseudozufallszahlenalgorithmen und statistische TestsOPAQUE1C2F3663-5376-46F5-9EC8-970D2D3A8AFFcom.apple.calendar0000000000NONEDATE-TIME19760401T005545ZPUBLIC20240531T093650ZEurope/Berlin20240709T14000020240602T083420ZEurope/Berlin20240709T13300020240602T083419Z0BA Jan GutlebenOPAQUE78CE5D0D-E662-4AE5-BD6F-A3E5999C82F0com.apple.calendar0000000000NONEDATE-TIME19760401T005545ZPUBLIC20240513T135409ZEurope/Berlin20240605T15000020240514T080445ZEurope/Berlin20240605T14300020240514T080445Z3403.A1410MA KabuthOPAQUED6FF2088-A99A-448A-BE33-9C128F86D5DDcom.apple.mobilecal0000000000PUBLIC20240513T135438ZEurope/Berlin20240605T15300020240514T080449ZEurope/Berlin20240605T15000020240514T080449Z3403.A1410BA KadourOPAQUE1AB51FAC-FC3C-44D8-B0F7-1866EEF3B62Ccom.apple.mobilecal0000000000PUBLIC20240514T080450ZEurope/Berlin20240605T16000020240514T080458ZEurope/Berlin20240605T15300020240514T080457Z3403.A1411MA WegeOPAQUEB8761894-FF4C-46BC-8089-539BE598C555com.apple.calendar000000000020240502T113201ZEurope/Berlin20240514T14300020240514T100941ZEurope/Berlin20240514T13300020240507T092201ZAppelstr. 11, A1410Vortrag Antti Kuusisto: "Descriptive complexity for distributed computing with circuits"OPAQUE84970070-2960-4E95-831B-BC1FEC3D228Acom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20240904T125401ZEurope/Berlin20241030T14450020240904T125403ZEurope/Berlin20241030T14000020240904T125401ZA5011MA Ziehm: 1-planarity of graphsTRANSPARENTCC320D85-F06C-40A4-87C7-0E6591B3D384com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20241022T130813ZEurope/Berlin20241203T14000020241023T194047ZEurope/Berlin20241203T13150020241023T194046Z1Vortrag Krivorutski (MA: EF-Spiele)OPAQUE0216788E-ECDA-493B-BEA9-D490D2D9EF50com.apple.calendar0000000000PUBLICPUBLIC20241009T031337ZEurope/Berlin20241030T15450020241029T140357ZEurope/Berlin20241030T15000020241029T140357Z1BA Pham: Bipolare ArgumentationOPAQUE76E4C87C-4E31-4A2D-A81D-201FF3CFE81Ecom.apple.calendar000000000020241105T133442ZEurope/Berlin20241113T14450020241105T133443ZEurope/Berlin20241113T14000020241105T133442Z0BA Viskorf (Quant. Horn)OPAQUED96432F1-19E1-4FD8-B447-F14290BD58BEURImessage:%3C0338e471-59e5-4a29-af56-59edefd8b073@stud.uni-hannover.de%3Ecom.apple.DataDetectorsViewServicePUBLICNONEDATE-TIME19760401T005545Z20241120T115521ZEurope/Berlin20250108T15300020241120T115523ZEurope/Berlin20250108T14450020241120T115521Z0Kürzeste-Wege-Probleme in der Stahlindustrie (MA Glander)OPAQUEA3A85CE1-B796-43F1-8B39-93332E14130Dcom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20241218T144317ZEurope/Berlin20250107T13450020241218T144318ZEurope/Berlin20250107T13000020241218T144317Z0BA Ovenhausen (fine-grained complexity)OPAQUE39CD1380-32ED-401B-B89C-385846FE3CA2com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545ZPUBLIC20250107T172522ZEurope/Berlin20250312T14150020250108T083615ZEurope/Berlin20250312T13300020250108T083614Z0Das n-Vehicle-Exploration-Problem (BA Bernstein)OPAQUEB9047FBF-ECB6-4A50-A192-A78A6B88B79Ccom.apple.calendar0000000000NONEDATE-TIME19760401T005545ZPUBLIC20241118T152705ZEurope/Berlin20250108T16450020250108T085012ZEurope/Berlin20250108T16000020241218T102813Z1Cortnum (BA Matroide)TRANSPARENT0D00DE18-8CED-41E5-BE2A-061700F9E327com.apple.calendar0000000000NONEDATE-TIME19760401T005545Z20250121T134645Z20250122T121342Z20250122T121342Z52694B0A-43F1-4D51-8D46-F7FB4AD01630BA Saleh: Überblick über verschiedene HashfunktionenEurope/Berlin20250219T143000Europe/Berlin20250219T151500PUBLIC0OPAQUEcom.apple.mobilecal0000000000120250310T090005ZEurope/Berlin20250320T14150020250310T090006ZEurope/Berlin20250320T13300020250310T090005Z0BA SiekmannOPAQUEEB4962D8-AB8F-4D5A-871B-6A451D015F86com.apple.mobilecal0000000000PUBLICPUBLIC20250124T090233ZEurope/Berlin20250327T15450020250310T090630ZEurope/Berlin20250327T15000020250310T090629Z1Baumweite von Datenbanken (BA Peckmann)OPAQUE99BBDE2F-1EDB-4CB5-82BF-6CBC061A8A56com.apple.calendar000000000020250126T184149ZAmerica/Los_Angeles20250219T05300020250126T184151ZAmerica/Los_Angeles20250219T04450020250126T184149Z0BA Tylkowski: Rek. GNNsOPAQUED89ED469-4D2D-4AED-9738-3E7F5545CABEcom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250128T203553ZAmerica/Los_Angeles20250220T05150020250201T194630ZAmerica/Los_Angeles20250220T04300020250201T194630Z1BA Binkowski: Programmiersprache für QuantencomputerOPAQUEA07574D2-6E81-48B6-A613-BD63CAAEA3FFcom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250218T155258ZEurope/Berlin20250507T15300020250218T155258ZEurope/Berlin20250507T14300020250218T155258ZA5012AuslandsinfovortragOPAQUEADE66AE9-444E-4419-8139-1449293BB565com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250227T123521ZEurope/Berlin20250416T15450020250227T123521ZEurope/Berlin20250416T15000020250227T123521Z0BA HarderOPAQUEC7484703-769E-404B-AE75-3E35CD74477Dcom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250305T095251ZEurope/Berlin20250327T14450020250305T095306ZEurope/Berlin20250327T14000020250305T095252Z1Bisho, Cake Cutting (BA)OPAQUE93EAA7F7-1227-4654-9655-A0321BF9F9BCcom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250306T124510ZAbstract: In restricted settings, constructing a choice function via a relation on the alternatives is not always possible. But, we show that one can always construct a choice function via a linear order on sets of alternatives. The axiomatics of such choice functions is presented. Restricted choice structures have many applications, and here we discuss their applications for knowledge representation and reasoning. Europe/Berlin20250313T14450020250306T124511ZEurope/Berlin20250313T14000020250306T124510Z0Kai Sauerwald: Axiomatics of Restricted Choice by a Linear Order of SetsOPAQUE2C1305D9-D5BD-4270-A740-6B652E1DD38Dcom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545ZPUBLIC20250312T092350ZEurope/Berlin20250416T16450020250312T152123ZEurope/Berlin20250416T16000020250312T152121Z1BA KießlingOPAQUEd3b1542c-f60b-4c06-9c3d-f6a67b0974e120250317T125716ZEurope/Berlin20250423T16300020250317T125716ZEurope/Berlin20250423T15450020250317T125716Z0BA Blachut (Wahlmanipulation)OPAQUE69A18335-6299-4D86-8D31-3972F3D7F0DBURImessage:%3C7808DF4A-7551-4DC9-977B-83766F9D0764@thi.uni-hannover.de%3Ecom.apple.DataDetectorsViewServicePUBLICNONEDATE-TIME19760401T005545Z20250407T130233ZEurope/Berlin20250423T17150020250407T130234ZEurope/Berlin20250423T16300020250407T130233Z0BA Schirrmacher (Resolutionsverfeinerungen)OPAQUE19243F12-C1E7-48C8-9FBA-56CBCD8F383Bcom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250312T152209ZEurope/Berlin20250423T15450020250414T072225ZEurope/Berlin20250423T15000020250414T072224Z0BA Sattler (A GUI for graph decompositions)OPAQUE24FB3B82-BF99-4149-8436-CA55A1C6E181com.apple.calendar0000000000PUBLIC20260713T141940ZEurope/Berlin20260819T15150020260713T141940ZEurope/Berlin20260819T14300020260713T141940Z0BA Leana MeyerOPAQUE3B78AB90-4795-4F7B-B124-73230ECB7F65com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250415T111824Z20250428T080439Z20250428T080439Z5E9C852D-EE7D-481D-BFFF-DD2D563E5D4ABA FatahEurope/Berlin20250507T153000Europe/Berlin20250507T161500PUBLIC3OPAQUEcom.apple.calendar0000000000520250513T090930ZEurope/Berlin20251105T16000020250513T090932ZEurope/Berlin20251105T14300020250513T090930ZA5021AuslandsinfovortragOPAQUE66018865-2408-49A5-A079-757EECAEBC05com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250513T094355ZEurope/Berlin20250604T15150020250513T094407ZEurope/Berlin20250604T14300020250513T094405Z0MA Ehrmuth: Expressivity of TransformerOPAQUE95643117-7EFC-4A29-93A3-1619E17E4010com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250527T084144ZEurope/Berlin20250820T15150020250527T084145ZEurope/Berlin20250820T14300020250527T084144Z0BA Abe: Twin-WidthOPAQUE72F08864-2C56-4359-B3E0-68581B6EDF3Ccom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545ZPUBLIC20250624T073324ZEurope/Berlin20250716T15450020250624T193442ZEurope/Berlin20250716T15000020250624T193441Z1Ole Meinecke: GNNsOPAQUEA230DF68-2815-4904-8A7E-F73EC74210B7com.apple.calendar0000000000NONEDATE-TIME19760401T005545Z20250708T075050ZEurope/Berlin20250917T15150020250708T075052ZEurope/Berlin20250917T14300020250708T075050Z0MA Hermerding: Primzahlen in der KryptographieOPAQUE58179952-12CA-4EA6-87E0-3E25AED4400Acom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250730T084323ZEurope/Berlin20250903T14150020250730T084324ZEurope/Berlin20250903T13300020250730T084323Z0Schulz (BA: Unabhängigkeitsresultate)OPAQUEA5EE7C75-84D4-442A-B547-9E7FBDD6F852com.apple.calendar0000000000PUBLIC20250808T193940ZEurope/Berlin20250901T15150020250808T193940ZEurope/Berlin20250901T14300020250808T193940Z0Padrok (BA Linguistik und Teamlogik)OPAQUEEA96AE5B-ABCB-4415-A5D4-B6DED73977E4com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250822T084949ZEurope/Berlin20250917T16000020250822T084949ZEurope/Berlin20250917T15150020250822T084949Z0BA Wratschinski: Geometric CryptographyOPAQUE527A0B00-4697-49B6-B4A4-595DAE373B4Ccom.apple.calendar0000000000PUBLIC20250828T074210ZEurope/Berlin20250917T14300020250828T074210ZEurope/Berlin20250917T13450020250828T074210Z0BA Mertin: Algorithmen für MatroidproblemeOPAQUECEB76169-CD8B-4021-A21E-DE271E2DDAA5com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250828T074543ZEurope/Berlin20250917T16450020250828T074544ZEurope/Berlin20250917T16000020250828T074543Z0BA Schmitz-Reinthal: Tool für den Gentzen-KalkülOPAQUEB38B000D-3DE9-4462-8529-74C7EE3D4960com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250901T120619ZEurope/Berlin20251001T11300020250903T141327ZEurope/Berlin20251001T10300020250903T141327Z1Traute: Enumeration von Kreisen in Matroiden (BA)OPAQUE24CAEB0F-9F05-4E0C-BAC3-BDD34CF26170com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20260715T081532ZEurope/Berlin20260819T16000020260715T081541ZEurope/Berlin20260819T15150020260715T081540Z1BA WidjajaOPAQUEF6E9D68E-28B0-4467-A93C-CA18A3F15B4Fcom.apple.mobilecal0000000000PUBLICPUBLIC20250908T152723ZEurope/Berlin20251007T15450020250912T091522ZEurope/Berlin20251007T15000020250912T091521Z0BA Engelhardt: RASPOPAQUE32B524C6-ECB6-448F-B847-316E89F7CD65com.apple.calendar0000000000NONEDATE-TIME19760401T005545Z20250928T192527ZEurope/Berlin20251015T15450020250928T192528ZEurope/Berlin20251015T15000020250928T192527Z0Ronge (BA: Linear-Logic in the First-Order)OPAQUEEB5B6393-C842-4BD9-BE87-C1349CAEF616com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20250923T075206ZEurope/Berlin20250929T11000020250923T075206ZEurope/Berlin20250929T10000020250923T075206Z0BA SchehackOPAQUEE2D0462D-6B84-462C-8CC7-39E02EBD3EA7URImessage:%3C31c1cf58-a0ec-4528-a0a7-332bbda787ab@stud.uni-hannover.de%3Ecom.apple.DataDetectorsViewServicePUBLICNONEDATE-TIME19760401T005545ZPUBLIC20260112T093137ZEurope/Berlin20260128T15450020260112T103135ZEurope/Berlin20260128T15000020260112T103134Z2BA Cherouny (Erreichbarkeits- und Verifikationsprobleme in NNs)OPAQUEb07ed237-4b82-4d10-94c4-45ce64e127e52PUBLIC20250903T083432ZThe PACE challenge is an annual event where the goal is to implement an efficient solver for an NP-hard problem. The challenge aims to bridge the gap between theory and practice especially in the realm of parameterized algorithmics. In this talk, I will report on our participation in the year 2024 on the problem »One-Sided Crossing Minimization« and in the year 2025 on the problems »Dominating Set« and »Hitting Set«.Europe/Berlin20251113T12000020251113T075131ZEurope/Berlin20251113T11000020251113T075131ZA5323Vortrag Florian Chudigiewitsch: Keep It Simple, Solve: Lessons Learned from PACE 2024 and 2025OPAQUEd3bc0bd9-e59b-4765-a52c-734b6edb4dfe220260120T201534ZEurope/Paris20260211T14150020260120T201534ZEurope/Paris20260211T13300020260120T201534Z0Guillermo Badia: Codd's Theorem for Databases over SemiringsOPAQUEDCF38284-AB68-483D-9B10-82689BB9FEE9com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20260126T202633ZEurope/Berlin20260223T15000020260126T202635ZEurope/Berlin20260223T14000020260126T202633Z0Vortrag Müller (BA: Algebr. Charakt. v. Komplexitätsklassen, Zweitgutachter: Cuntz)OPAQUE584EA4B0-CE98-45D7-B852-6EC2C579DD16com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20260210T104732ZEurope/Berlin20260311T15150020260210T104732ZEurope/Berlin20260311T14300020260210T104732Z0BA Riyadi: Komplexität von Solo SchachOPAQUE2BF17035-87A2-46E7-BAAA-711BF30F9EC2com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545ZPUBLIC20260212T104432ZEurope/Berlin20260223T16450020260223T084249ZEurope/Berlin20260223T16000020260223T084249Z0Vortrag Omar Alsaleh (BA: Fast Deterministic Selection)OPAQUE05C82A87-EAB4-452D-AA2B-368E4046041Dcom.apple.calendar0000000000NONEDATE-TIME19760401T005545ZPUBLIC20260128T081611ZEurope/Paris20260223T16000020260223T084236ZEurope/Paris20260223T15000020260223T084236Z3Vortrag Kaan (BA: Eine GUI für spezifische Graph-Algorithmen)OPAQUEDFF6B49C-606D-465C-8498-A4BFCB2E01BBcom.apple.calendar0000000000NONEDATE-TIME19760401T005545Z20260219T144633ZEurope/Berlin20260311T16000020260219T144638ZEurope/Berlin20260311T15150020260219T144638Z2BA Do (Parallel Greedy)OPAQUEE6018A99-0A3C-4580-9237-D4B8F53A44B3com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20260326T105728ZEurope/Berlin20260422T14150020260326T105732ZEurope/Berlin20260422T13300020260326T105732Z1Behrendt (BA: Numerische Probleme)OPAQUE283D164C-A130-4A48-B3D0-E7CE27167F4Fcom.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20260326T151842ZEurope/Berlin20260520T15300020260326T151842ZEurope/Berlin20260520T14300020260326T151842Z0Tobias BrockmeyerOPAQUE6B7AC358-8D3C-4C7F-806C-0A757AC77DF0com.apple.mobilecal0000000000PUBLICPUBLIC20260317T140444ZEurope/Berlin20260409T11000020260406T190728ZEurope/Berlin20260409T10150020260406T190728Z1BA Söllner (Zwei-Parteien-Kommunikation)OPAQUE5F84E04B-6E83-4B24-9E07-81E1C21AB5E1com.apple.calendar0000000000NONEDATE-TIME19760401T005545ZPUBLIC20260311T123852ZEurope/Berlin20260409T12000020260407T153937ZEurope/Berlin20260409T11000020260311T124139ZA5320BA Gleim (Problemkerne)OPAQUE9B7841D6-11EB-4D6C-9257-096CBBC014D0com.apple.calendar0000000000NONEDATE-TIME19760401T005545ZPUBLIC20260409T102031ZEurope/Berlin20260429T15150020260414T120739ZEurope/Berlin20260429T14300020260414T120739Z2BA SchulzOPAQUE232993BF-40CE-42E7-B750-EAAE3328F847com.apple.calendar0000000000NONEDATE-TIME19760401T005545Z20260414T120825ZEurope/Berlin20260429T16000020260414T120826ZEurope/Berlin20260429T15150020260414T120825Z0MA Hlava (Enumeration Clones)OPAQUE6AD49C75-F0A8-4D75-9A62-57370D04A731com.apple.calendar0000000000PUBLICNONEDATE-TIME19760401T005545Z20260429T073545Z20260429T073603Z20260429T073603Z446c62c1-302b-4e68-9590-d3732aeb4242Einsicht KvA KK1 (im Zeitslot des Oberseminars)Europe/Berlin20260603T130000Europe/Berlin20260603T170000OPAQUEPUBLIC120260505T113339Z20260507T131103Z20260507T131103Z41D878A1-B4D1-4F44-8937-547B883B4D56BA Weiterer (Konnektivität in Matroiden)Europe/Berlin20260528T111500Europe/Berlin20260528T1200003OPAQUEcom.apple.calendar0000000000PUBLIC