- Integer Programming for Combinatorial Auction Winner Determination Arne Andersson Mattias Tenhunen Fredrik Ygge
- Market-based Approaches to Optimization Maria Karlsson
- The HOMEBOTS System and Field Test: A Multi-Commodity Market for
- PREPRINT. In Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996. Faster deterministic sorting and searching in linear space
- Datastrukturer och databaser fr STS Rtta svar till tentamen 2002-03-15
- In Proceedings 27th ACM Symposium on Theory of Computing, pages 427-436. ACM Press, 1995. Sorting in Linear Time?
- Tech. report, Lund University, 1994. !#"%$&(')0102
- PREPRINT. Proc. of the ECML'98 Workshop on Upgrading Learningto the Meta-Level: Model Selection and Data Transformation, pages 54-65, 1998. Model selection using measure functions
- PREPRINT. In Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996. Static Dictionaries on
- Dynamic Ordered Sets with Exponential Search Trees Arne Andersson
- PREPRINT. In Proc. 2nd Annual European Symposium onAlgorithms, pages 8293. Springer Verlag, 1994.
- PREPRINT. SoftwarePractice and Experience, 25(2):129141, 1995. Efficient Implementation of Suffix Trees \Lambda
- PREPRINT. The ACM Journal of Experimental Algorithmics. Volume3, Article 7, 1998.
- PREPRINT. In Proceedings of the 4th Workshop on AlgorithmsDatathms 25170 volume 955, pages 473481. Springer Verlag, 1995.
- PREPRINT. SoftwarePractice and Experience, 21(10):11251128, 1991. A Note on Searching in a Binary Search Tree
- PREPRINT. Journal of Computer and System Sciences, vol 57, pp 7493, 1998. Sorting in Linear Time? \Lambda
- The HOMEBOTS System and Field Test: A MultiCommodity Market for
- In Proceedings 27th ACM Symposium on Theory ofComputing, pages 427436. ACM Press, 1995.
- PREPRINT. Theoretical Computer Science, 106:391393, 1992. Letter to the Editor
- PREPRINT. In Proc. 37th IEEE Symposium on Foundations ofComputer Science, 1996.
- PREPRINT. Journal of Algorithms, 30: 128, 1999. General Balanced Trees
- PREPRINT. SIAM Journal of Computing, 24(5):10911103, 1995. NEW TIGHT BOUNDS ON UNIQUELY REPRESENTED
- PREPRINT. Journal of Algorithms 29:256276, 1998. Approximate indexed lists
- In Proc. 32nd IEEE Sympos. Foundations of ComputerScience,879 642649, 1991.
- PREPRINT. Information Processing Letters, 34(1):2125, 1990. Construction of a Tree from its Traversals in
- PREPRINT. Computational Geometry: Theory and Applications,8(3):115122,5516 On the Difficulty of Range Searching
- PREPRINT. Theoretical Computer Science, vol 215, pp 337344, 1999. Fusion trees can be implemented with AC 0 instructions
- Tight WorstCase Bounds on the Dictionary Problem \Lambda Arne Andersson
- PREPRINT. In Proc. Workshop on Algorithms and Data Structures,pages 6071. Springer Verlag, 1993.
- Tech. report, Lund University, 1994. Blasting Past Fusion Trees
- Measurebased Performance Evaluation Arne Andersson a , Paul Davidsson b , Johan Lind'en c
- PREPRINT. In Proc. Workshop on Algorithms and DataStructures,800 Notes in Computer Science 382,
- PREPRINT. International Journal of Computer Matehmathics, 38:3748, 1990. Maintaining ffbalanced Trees by Partial Rebuilding
- Implementing General Balanced trees Arne Andersson
- In Proc. 35th Annual IEEE Symposium on Foundationsof Computer Science, pages 714721. IEEE Computer Society Press, 1994.
- PREPRINT. In Proc. 27th ACM Symposium on Theory of Computing,pages 417426. ACM Press, 1995.
- PREPRINT. Acta Informatica, 28:165178, 1990. Binary Search Trees of Almost Optimal Height
- Integer Programming for Combinatorial Auction Winner Determination Arne Andersson Mattias Tenhunen Fredrik Ygge
- PREPRINT. In Proc. Symposium on Optimal Algorithms, pages106114. Springer Verlag, 1989.
- PREPRINT. Proc. STOC 2000 Tight(er) Worstcase Bounds on Dynamic Searching and
- PREPRINT. Proc. of the ECML'98 Workshop on UpgradingLearning3 the MetaLevel: Model Selection and
- PREPRINT. Algorithmica 23, 1999. SuOEx Trees on Words
- PREPRINT. In Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996. Faster deterministic sorting and searching in linear space
- PREPRINT. Information Processing Letters, 46:295300, 1993. Improved Behaviour of Tries
- PREPRINT. In Proc. 2nd ann. International Symposium onAlgorithms, pages 273282. Springer Verlag, 1991.
- In Proc. 31st Hawaiian International Conference on System Sciences,ie VII Software Technology Track, ack, 4 13, IEEE Computer Society, 1998.
- PREPRINT. In Proc. Combinatorial Pattern Matching, 1996. SuOEx Trees on Words
- PREPRINT. In Proc. Scandinavian Workshop on Algorithm Theory,pages 111121. Springer Verlag, 1990.
- PREPRINT. Computer Journal, 33(5):471472, 1990. A Note on the Expected Behaviour of Binary
- In Proc. 26th ACM Symposium on Theory of Computing,pages 317325. ACM Press, 1994.
- Datastrukturer och databaser fr STS Tentamen 2002-03-15 8.00 13.00
- 2n -1 n 2n -1
- Datastrukturer och databaser fr STS Tentamen 2002-06-10 15 9.00 14.00
- Part I: Introduction to Databases Kostis Sagonas
