> 352Yz
bjbjWW==z ]&>(fffffffxzzzzzz$i]jfffffff>fffxfxxxf2u1k;<pxWork Report
Ulrich Meyer
Max-Planck Institute for Computer Science,
Saarbruecken, Germany
CoE visiting scientist at MTA SZTAKI during Jan/Feb 2002
Following the accepted work plan, I conducted research and gave lectures on graph-traversal problems for large data sets In an introduction lecture for the research group of Prof. Dr. Lajos Ronyai on January, 14th, I provided an overview of graph-traversal algorithms. The talk also covered new compression data-structures that might prove useful for the data-mining project carried out by Dr. Andras Benczur. In subsequent discussions we identified common research interests, which we will pursue in the future. Making each other aware of recent results obtained by third parties was also very helpful.
On February, 11th and 18th, I gave lectures at the TU Budapest on external-memory algorithms; more details can be found under HYPERLINK "http://www.math.bme.hu/~ig/valfej/"http://www.math.bme.hu/~ig/valfej/
(Vlogatott fejezetek az algoritmusok krbl) I was told that the students enjoyed the talks; an external visitor from Ericsson Hungary attended the lectures as well. Giving these presentations in front of an interested audience was a very good experience of my stay.
Parts of the research results obtained during my stay at SZTAKI will appear as a refereed full paper at the 16th IEEE International Parallel and Distributed Processing Symposium to be held this year in Fort Lauderdale, USA.
A preprint of this paper "Buckets strike back: Improved Parallel Shortest-Paths" is attached. Valuable comments from SZTAKI members helped to improve both the presentation and the analysis. This is also true for a revised journal version of my paper on sequential shortest-paths from SODA 2001. My forthcoming invited talk at the Dagstuhl Seminar on Data Structures ( HYPERLINK "http://www.dagstuhl.de/DATA/Seminars/02/" \l "02091"http://www.dagstuhl.de/DATA/Seminars/02/#02091 ) covering the papers above will directly benefit from the visit at SZTAKI.
Altogether, I truly enjoyed my stay in Budapest; the warm spirit of the working group of Prof. Ronyai allowed a fast integration. The general research conditions are fine; however, it would be nice to have at least online access to some important publications series like "Lecture Notes in Computer Science" (Springer) that are not regularly ordered by the library in printed form..
np
yzN P 78wxyy
z
jU0JCJjU
jCJUCJH*CJ5CJ5
F\] w
x
y
z
$$
F\] w
x
y
z
. A!"#$%DyKyKFhttp://www.math.bme.hu/~ig/valfej/r0DyKyKRhttp://www.dagstuhl.de/DATA/Seminars/02/02091
[$@$NormlmH:`:Cmsor 1$@&5CJmH nH@A@@Bekezds alap-betqtpusa4U`4Hiperhivatkozs>*B*z z
z
z
y7xz XX%&/03=DFRT[aijstv
&'./2367?@EY_`bcjt|}
!&,-4689CDOPRS]^demnwy~
&')*-:<=LMW^efimrsx
"#&',.019:ABFGOX`ademnpquw}~
#$*+-089=>CDFGJVcmpq|} "*+348@GHNOQRYZ^_bcopstwx !#$()3
(+,017<?@GHMW]^ehlmx~ # * 7 ; < ? @ C D M N U V X Y \ ] d e g h o p v | ]GP5?1;t v |
MTA SZTAKIW\\Ibolya\pendrive (e)\COE-reports\Visitors-reports\Finalrep-lrichMeyer-Jan-Febr2002.doc@kk,ak]z `@GTimes New Roman5Symbol3&Arial"q߄^!20 Work Report
MTA SZTAKI
MTA SZTAKI
Oh+'0d
,
8DLT\
Work Report oorkMTA SZTAKI TA NormalAMTA SZTAKI 1A Microsoft Word 8.0@F#@bЍk;@k;^
՜.+,D՜.+,@hp
MTA SZTAKI j
Work Report Title(RZ
_PID_GUID_PID_HLINKSAN{07DC94C6-A76D-11D8-A7E6-00C04FB40E59}AJ)http://www.dagstuhl.de/DATA/Seminars/02/020912c#http://www.math.bme.hu/~ig/valfej/
!#$%&'()+,-./014Root Entry Fuk;tk;6Data
1TableWordDocumentSummaryInformation("DocumentSummaryInformation8*CompObjlObjectPooltk;tk;
FMicrosoft Word dokumentum
MSWordDocWord.Document.89q