From a323ec7c3a659b540d08c3a8d889267dad7e8f0d Mon Sep 17 00:00:00 2001
From: Uli Fahrenberg <ulrich.fahrenberg@inria.fr>
Date: Wed, 3 Nov 2021 16:34:20 +0100
Subject: [PATCH] chairs for thu
---
index.html | 13 ++++++++++++-
1 file changed, 12 insertions(+), 1 deletion(-)
diff --git a/index.html b/index.html
index 5cab7d7..0652c54 100644
--- a/index.html
+++ b/index.html
@@ -711,6 +711,11 @@ complex data types.</div>
<tr ><th colspan="3", style="padding:10pt">Thursday November 4, 2021</th></tr>
<tr valign="top"><td align="right"><a href="http://www.timeanddate.com/worldclock/fixedtime.html?iso=2021-11-04T06:00:00">7:00</a></td><td colspan="2", style="padding:5pt"><b >Breakfast</b></td></tr>
+<tr>
+<td align="right">9:00</td>
+<td></td>
+<td align="left">Session 9. Chair <i>Barbara König</i></td>
+</tr>
<tr style="background-color:#fafcff", valign="top">
<td align="right"><a href="http://www.timeanddate.com/worldclock/fixedtime.html?iso=2021-11-04T08:00:00">9:00</a></td>
@@ -748,6 +753,11 @@ complex data types.</div>
<tr valign="top"><td align="right"><a href="http://www.timeanddate.com/worldclock/fixedtime.html?iso=2021-11-04T09:30:00">10:30</a></td><td colspan="2", style="padding:5pt"><b >Coffee break</b></td></tr>
+<tr>
+<td align="right">11:00</td>
+<td></td>
+<td align="left">Session 10. Chair <i>Bernhard Möller</i></td>
+</tr>
<tr style="background-color:#fafcff", valign="top">
<td align="right"><a href="http://www.timeanddate.com/worldclock/fixedtime.html?iso=2021-11-04T10:00:00">11:00</a></td>
@@ -943,7 +953,8 @@ Mika-Michalski)
<td align="left"><i ><u >Roland Glück</u></i></td>
<td align="left", width="60%">
<a href="javascript:toggleDiv('T41')">On the Computation of Isolated Sublattices (short talk)</a>
-<div style="display:none", id="T41"><br /><br />In this short notice we give somei deas how toc ompute isolated sublattices which can be used to derive a recursive algorithm for the com- putation of the number of closure operators on a finite lattice. We give an asymptoticaly optimal algorithm for deciding the existence and - in the case of existence - the computation of useful nontrivial isolated summit sublattices. The general case (i.e., an optimal algorithm for the computa- tion of general nontrivial useful isolated sublattices) remains unsolved, however, we try to give some ideas and hints for future research.</div>
+<div style="display:none", id="T41"><br /><br />In this short notice
+ we give some ideas how to compute isolated sublattices which can be used to derive a recursive algorithm for the computation of the number of closure operators on a finite lattice. We give an asymptotically optimal algorithm for deciding the existence and - in the case of existence - the computation of useful nontrivial isolated summit sublattices. The general case (i.e., an optimal algorithm for the computation of general nontrivial useful isolated sublattices) remains unsolved, however, we try to give some ideas and hints for future research.</div>
</td>
</tr>
--
GitLab