BEGIN:VCALENDAR PRODID:-//Microsoft Corporation//Outlook 12.0 MIMEDIR//EN VERSION:2.0 METHOD:PUBLISH X-MS-OLK-FORCEINSPECTOROPEN:TRUE BEGIN:VEVENT CLASS:PUBLIC CREATED:20120214T041433Z DESCRIPTION:TITLE: Stacks\, Queues\, Deques and their Representation as Gra phs\n\nSpeaker: Professor Franz J Brandenburg\, University of Passau\, Ge rmany\n\nTime: Tuesday 21 February 2012\, 2pm-3pm\n\nLocation: The Univer sity of Sydney\, School of IT Building\, \nLecture Theatre (Room 123)\, Le vel 1\n\nABSTRACT\nStacks and queues are fundamental data structures. They express the LIFO (last-in\, first out) and FIFO (first-in\, first-out) p rinciples and are the basis for depth first and breadth first search. Sta cks and queues are a specialization of a deque\, which allows the insertio n and removal of objects on its left and right ends. In Java 6 the class A rraydeque implements a deque and is likely to be faster than Stack when us ed as a stack\, and faster than LinkedList when used as a queue.\n\nWe con sider classes of graphs which represent the input-ouput behaviour of these data structures\, and call them stack\, queue\, or deque graphs. Then the input-output actions on a stack are correct if and only if the stack grap h is planer. Accordingly\, queue graphs have a planar representation on a cylinder and the deque graphs are characterized by planar graphs on the cy linder with additional arches. \n\nWe study properties of the classes of stack\, queue and deque graphs\, which are subclasses of planar graphs. By Yannakakis result every planar graphs can be represented by four stacks. In particular\, one stack graphs are two queue graphs\, and one queue grap hs are two stack graphs. Our latest result states that in terms of graphs a deque dominates two stacks exactly by the difference between a Hamilton cycle and a Hamilton path in planar graphs. We close with challenging open problems that are related to stacks and\nqueues. \n\nSPEAKER’S BIOGRAPH Y\nFranz J Brandenburg reveived his PhD from the University of Bonn in 197 8\, and his habilitation in 1982. Since 1983 he is a full professor of In formatics at the University of Passau. His research interest is in comptat ational complexity\, algorihmics\, and particularly in graph drawing. One of the earliest graph drawing tool (Graphed) was developed in his group\; follow-ups are Graphlet and Gravisto. His ongoing work is on drawing grap hs on surfaces\, such as cylinders and tori.\n\nLOCATION DETAILS:\nThe Sch ool of Information Technologies is located in the new School of IT Buildin g (J12)\, 1 Cleveland Street at the eastern end of the Darlington campus o f the University of Sydney.\nMaps are available here (see coordinates L25/ L26):\n http://db.auth.usyd.edu.au/directories/map/largemap00a.html \n\n DTEND:20120221T040000Z DTSTAMP:20120214T041434Z DTSTART:20120221T030000Z LAST-MODIFIED:20120214T041433Z LOCATION:School of IT Lecture Theatre (123) PRIORITY:5 SEQUENCE:0 SUMMARY;LANGUAGE=en-au:The University of Sydney Basser Seminar Series - Und erstanding Cell Load Coupling in Planning and Optimization of LTE Networks TRANSP:OPAQUE UID:040000008200E00074C5B7101A82E008000000007071A33B2BEBCC01000000000000000 0100000004BEB8AA2D8D42646B53CFD4087188CC6 X-ALT-DESC;FMTTYPE=text/html:\n\n\n\n\nThe University of Sydney Basser Seminar Se ries - Understanding Cell Load Coupling in Planning and Optimization of LT E Networks\n\n\n