[prev in list] [next in list] [prev in thread] [next in thread] 

List:       openldap-announce
Subject:    =?UTF-8?Q?Fifth_OpenLDAP_Developer_Day_=e2=80=93_Call_for_Registrat?= =?UTF-8?Q?ion!?=
From:       Howard Chu <project () openldap ! org>
Date:       2018-09-13 11:21:11
Message-ID: cd167c6a-2658-f4f5-fbdd-17840af9cc7b () openldap ! org
[Download RAW message or body]


Together with the University of Tübingen and Symas, DAASI International invites all \
stakeholders to meet in Tübingen and celebrate 20 years of OpenLDAP!

The 5th OpenLDAP Developer Day is a great opportunity to come together as a community \
and exchange ideas with developers of OpenLDAP software, directory researchers and \
other OpenLDAP community members interested in discussing ongoing and future \
development efforts. Are you a stakeholder interested to join us for the 5th OpenLDAP \
Developer Day? Then please register by contacting us at odd-silverjubilee@daasi.de \
before September 28th. You are invited to listen to interesting speakers and to take \
part in fruitful discussions. Also, if you would like to present your own topic to \
the community, there are still some of the limited speaker slots of 15 to 45 minutes \
available. Just email us at odd-silverjubilee@daasi.de as soon as possible, but no \
later than the extended deadline of September 21st. The full Call for Content is \
available here.

The OpenLDAP Developer Day will take place at the Computing Center of the University \
of Tübingen (Wächterstraße 76, 72074 Tübingen). Information on how to find the \
location of the OpenLDAP Developer Day is available here \
https://daasi.de/en/company/journey-and-stay/.

We are looking forward to celebrate the OpenLDAP Silver Jubilee with you! If you have \
any questions, please do not hesitate to contact us at odd-silverjubilee@daasi.de.

-- 
  -- Howard Chu
  CTO, Symas Corp.           http://www.symas.com
  Director, Highland Sun     http://highlandsun.com/hyc/
  Chief Architect, OpenLDAP  http://www.openldap.org/project/


[prev in list] [next in list] [prev in thread] [next in thread]