Kim S. Larsen

150 papers A* 4A 6B 23C 3Misc 3Journal 92Unranked 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
Forwarding Packets Greedily.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Kevin Schewior, Rob van Stee
2026 J jnl
On the Online Weighted Non-Crossing Matching Problem.
CoRR
Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Fata Lavasani, Yaqiao Li, Denis Pankratov
2026 J jnl
On the online weighted non-crossing matching problem.
Inf. Comput.
Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov
2026 J jnl
Online interval scheduling with predictions.
J. Comput. Syst. Sci.
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2025 A* conf
Brief Announcement: Distributed Graph Algorithms with Predictions.
PODC
Joan Boyar, Faith Ellen, Kim S. Larsen
2025 — conf
Complexity Classes for Online Problems with and Without Predictions.
IJTCS-FAW
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2025 J jnl
Distributed Graph Algorithms with Predictions.
CoRR
Joan Boyar, Faith Ellen, Kim S. Larsen
2024 J jnl
Advice complexity of adaptive priority algorithms.
Theor. Comput. Sci.
Joan Boyar, Kim S. Larsen, Denis Pankratov
2024 J jnl
Complexity Classes for Online Problems with and without Predictions.
CoRR
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2024 — conf
On the Online Weighted Non-Crossing Matching Problem.
SWAT
Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov
2024 J jnl
Online Unit Profit Knapsack with Predictions.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023 B conf
Online Interval Scheduling with Predictions.
WADS
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2023 J jnl
Online Interval Scheduling with Predictions.
CoRR
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2023 B conf
Online Minimum Spanning Trees with Weight Predictions.
WADS
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023 J jnl
Online Minimum Spanning Trees with Weight Predictions.
CoRR
Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2023 A* conf
Paging with Succinct Predictions.
ICML
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2023 — conf
Quotable Signatures for Authenticating Shared Quotes.
LATINCRYPT
Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen
2022 J jnl
Implementing Choreography Extraction.
CoRR
Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi, Larisa Safina
2022 — conf
Online Unit Profit Knapsack with Untrusted Predictions.
SWAT
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Online Unit Profit Knapsack with Untrusted Predictions.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Paging with Succinct Predictions.
CoRR
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2022 J jnl
Quotable Signatures for Authenticating Shared Quotes.
CoRR
Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen
2022 J jnl
Relative Worst-order Analysis: A Survey.
ACM Comput. Surv.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2022 J jnl
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2021 J jnl
Online Bin Covering with Advice.
Algorithmica
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2020 J jnl
Advice Complexity of Priority Algorithms.
Theory Comput. Syst.
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2020 J jnl
Randomized distributed online algorithms against adaptive offline adversaries.
Inf. Process. Lett.
Joan Boyar, Faith Ellen, Kim S. Larsen
2019 J jnl
Advice Complexity of Adaptive Priority Algorithms.
CoRR
Joan Boyar, Kim S. Larsen, Denis Pankratov
2019 B conf
Online Bin Covering with Advice.
WADS
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2019 J jnl
Online Bin Covering with Advice.
CoRR
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2019 J jnl
Online Dominating Set.
Algorithmica
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2018 B conf
Advice Complexity of Priority Algorithms.
WAOA
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2018 J jnl
Advice Complexity of Priority Algorithms.
CoRR
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2018 J jnl
Batch Coloring of Graphs.
Algorithmica
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018 J jnl
DNA-templated synthesis optimization.
Nat. Comput.
Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk
2018 B conf
Heuristic Variants of A ^* Search for 3D Flight Planning.
CPAIOR
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen
2018 J jnl
Online-bounded analysis.
J. Sched.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018 — conf
Relative Worst-Order Analysis: A Survey.
Adventures Between Lower Bounds and Higher Altitudes
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2018 J jnl
Relative Worst-Order Analysis: A Survey.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2018 J jnl
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing.
CoRR
Joan Boyar, Faith Ellen, Kim S. Larsen
2017 A conf
Constraint Handling in Flight Planning.
CP
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen
2017 B conf
DNA-Templated Synthesis Optimization.
DNA
Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk
2017 C conf
Flight Planning in Free Route Airspaces.
ATMOS
Casper Kehlet Jensen, Marco Chiarandini, Kim S. Larsen
2017 J jnl
Formally Proving Size Optimality of Sorting Networks.
J. Autom. Reason.
Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp
2017 B conf
How to Get More Out of Your Oracles.
ITP
Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp
2017 J jnl
On the list update problem with advice.
Inf. Comput.
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2017 J jnl
Online Algorithms with Advice: A Survey.
ACM Comput. Surv.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
2017 B conf
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
WADS
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2017 J jnl
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
CoRR
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík
2017 B conf
The Paths to Choreography Extraction.
FoSSaCS
Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi
2016 B conf
Batch Coloring of Graphs.
WAOA
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Batch Coloring of Graphs.
CoRR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Online Algorithms with Advice: A Survey.
SIGACT News
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
2016 J jnl
Online Bin Packing with Advice.
Algorithmica
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2016 Misc conf
Online Bounded Analysis.
CSR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 J jnl
Online Bounded Analysis.
CoRR
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016 — conf
Online Dominating Set.
SWAT
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2016 J jnl
Online Dominating Set.
CoRR
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
2016 J jnl
The Paths to Choreography Extraction.
CoRR
Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi
2016 A conf
Vertical Optimization of Resource Dependent Flight Paths.
ECAI
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen
2015 J jnl
A Comparison of Performance Measures for Online Algorithms.
Algorithmica
Joan Boyar, Sandy Irani, Kim S. Larsen
2015 J jnl
Online multi-coloring with advice.
Theor. Comput. Sci.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2015 J jnl
Relative interval analysis of paging algorithms on access graphs.
Theor. Comput. Sci.
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2015 J jnl
Soccer is Harder Than Football.
Int. J. Found. Comput. Sci.
Jan Christensen, Anders Nicolai Knudsen, Kim S. Larsen
2015 J jnl
The Frequent Items Problem in Online Streaming Under Various Performance Measures.
Int. J. Found. Comput. Sci.
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2014 J jnl
A comparison of performance measures via online search.
Theor. Comput. Sci.
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2014 C conf
On the List Update Problem with Advice.
LATA
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2014 A conf
Online Bin Packing with Advice.
STACS
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2014 B conf
Online Multi-Coloring with Advice.
WAOA
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2014 J jnl
Online Multi-Coloring with Advice.
CoRR
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2014 J jnl
Online bin covering: Expectations vs. guarantees.
Theor. Comput. Sci.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2013 J jnl
A Technique for Exact Computation of precoloring Extension on Interval Graphs.
Int. J. Found. Comput. Sci.
Martin R. Ehmsen, Kim S. Larsen
2013 J jnl
Better bounds on online unit clustering.
Theor. Comput. Sci.
Martin R. Ehmsen, Kim S. Larsen
2013 J jnl
List Factoring and Relative Worst Order Analysis.
Algorithmica
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2013 J jnl
On the List Update Problem with Advice.
CoRR
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2013 C conf
Online Bin Covering: Expectations vs. Guarantees.
COCOA
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2013 J jnl
Online Bin Covering: Expectations vs. Guarantees.
CoRR
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2013 J jnl
Online multi-coloring on the path revisited.
Acta Informatica
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
2013 J jnl
Relative Interval Analysis of Paging Algorithms on Access Graphs
CoRR
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2013 B conf
Relative Interval Analysis of Paging Algorithms on Access Graphs.
WADS
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2013 B conf
The Frequent Items Problem in Online Streaming under Various Performance Measures.
FCT
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2013 J jnl
The Frequent Items Problem in Online Streaming under Various Performance Measures.
CoRR
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2012 — conf
A Comparison of Performance Measures via Online Search.
FAW-AAIM
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2012 J jnl
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
CoRR
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 — conf
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
SWAT
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 J jnl
Online Bin Packing with Advice
CoRR
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2011 J jnl
A Comparison of Performance Measures via Online Search
CoRR
Joan Boyar, Kim S. Larsen, Abyayananda Maiti
2010 J jnl
A theoretical comparison of LRU and LRU-K.
Acta Informatica
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2010 — conf
Better Bounds on Online Unit Clustering.
SWAT
Martin R. Ehmsen, Kim S. Larsen
2010 J jnl
Competitive analysis of the online inventory problem.
Eur. J. Oper. Res.
Kim S. Larsen, Sanne Wøhlk
2010 J jnl
List Factoring and Relative Worst Order Analysis
CoRR
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2010 B conf
List Factoring and Relative Worst Order Analysis.
WAOA
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2010 J jnl
Priority algorithms for graph optimization problems.
Theor. Comput. Sci.
Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi
2009 B conf
A Comparison of Performance Measures for Online Algorithms.
WADS
Joan Boyar, Sandy Irani, Kim S. Larsen
2008 J jnl
A Comparison of Performance Measures for Online Algorithms
CoRR
Joan Boyar, Sandy Irani, Kim S. Larsen
2007 J jnl
The relative worst-order ratio applied to paging.
J. Comput. Syst. Sci.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2006 — conf
Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem.
Hybrid Metaheuristics
Marco Chiarandini, Thomas Stützle, Kim S. Larsen
2006 J jnl
The maximum resource bin packing problem.
Theor. Comput. Sci.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2006 B conf
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.
WAOA
Joan Boyar, Martin R. Ehmsen, Kim S. Larsen
2005 J jnl
Exponentially decreasing number of operations in balanced trees.
Acta Informatica
Lars Jacobsen, Kim S. Larsen
2005 J jnl
On-line seat reservations via off-line seating arrangements.
Int. J. Found. Comput. Sci.
Jens S. Kohrt, Kim S. Larsen
2005 B conf
The Maximum Resource Bin Packing Problem.
FCT
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2005 A* conf
The relative worst order ratio applied to paging.
SODA
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
2004 — ch.
Balanced Binary Search Trees.
Handbook of Data Structures and Applications
Arne Andersson, Rolf Fagerberg, Kim S. Larsen
2004 B conf
Priority Algorithms for Graph Optimization Problems.
WAOA
Allan Borodin, Joan Boyar, Kim S. Larsen
2003 J jnl
Dynamic TCP acknowledgment in the LogP model.
J. Algorithms
Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut
2003 J jnl
Extending the accommodating function.
Acta Informatica
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2003 B conf
Online Seat Reservations via Offine Seating Arrangements.
WADS
Jens S. Frederiksen, Kim S. Larsen
2003 J jnl
Relaxed multi-way trees with group updates.
J. Comput. Syst. Sci.
Kim S. Larsen
2003 J jnl
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched.
Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee
2002 Misc conf
Extending the Accommodating Function.
COCOON
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2002 J jnl
Fair versus Unrestricted Bin Packing.
Algorithmica
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein
2002 J jnl
On the existence and construction of non-extreme (a, b)-trees.
Inf. Process. Lett.
Lars Jacobsen, Kim S. Larsen, Morten N. Nielsen
2002 — conf
Packet Bundling.
SWAT
Jens S. Frederiksen, Kim S. Larsen
2002 J jnl
Relaxed red-black trees with group updates.
Acta Informatica
Kim S. Larsen
2001 — conf
Complexity of Layered Binary Search Trees with Relaxed Balance.
ICTCS
Lars Jacobsen, Kim S. Larsen
2001 — conf
Exponentially Decreasing Number of Operations in Balanced Trees.
ICTCS
Lars Jacobsen, Kim S. Larsen
2001 J jnl
Relaxed Balance Using Standard Rotations.
Algorithmica
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
2001 A* conf
Relaxed Multi-Way Trees with Group Updates.
PODS
Kim S. Larsen
2001 J jnl
Relaxed balance for search trees with local rebalancing.
Acta Informatica
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
2001 B conf
Search Trees with Relaxed Balance and Near-Optimal Height.
WADS
Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen
2001 J jnl
The Accommodating Function: A Generalization of the Competitive Ratio.
SIAM J. Comput.
Joan Boyar, Kim S. Larsen, Morten N. Nielsen
2001 J jnl
The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.
Nord. J. Comput.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
2001 J jnl
Variants of (A, B)-Trees with Relaxed Balance.
Int. J. Found. Comput. Sci.
Lars Jacobsen, Kim S. Larsen
2000 J jnl
AVL Trees with Relaxed Balance.
J. Comput. Syst. Sci.
Kim S. Larsen
2000 Misc conf
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
COCOON
Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin
2000 — conf
Fair versus Unrestricted Bin Packing.
SWAT
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
1999 J jnl
On Grouping in Relational Algebra.
Int. J. Found. Comput. Sci.
Kim S. Larsen
1999 J jnl
Partially persistent search trees with transcript operations.
Discret. Math. Theor. Comput. Sci.
Kim S. Larsen
1999 B conf
The Accommodating Function - A Generalization of the Competitive Ratio.
WADS
Joan Boyar, Kim S. Larsen, Morten N. Nielsen
1999 J jnl
The Seat Reservation Problem.
Algorithmica
Joan Boyar, Kim S. Larsen
1998 J jnl
Amortized Constant Relaxed Rebalancing Using Standard Rotations.
Acta Informatica
Kim S. Larsen
1998 J jnl
Parametric Permutation Routing via Matchings.
Nord. J. Comput.
Peter Høyer, Kim S. Larsen
1998 A conf
Partially Persistent Search Trees with Transcript Operations.
STACS
Kim S. Larsen
1998 J jnl
Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy.
Inf. Process. Lett.
Kim S. Larsen
1998 J jnl
Sort Order Problems in Relational Databases.
Int. J. Found. Comput. Sci.
Kim S. Larsen
1997 J jnl
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
J. Comput. Syst. Sci.
Joan Boyar, Rolf Fagerberg, Kim S. Larsen
1997 A conf
Relaxed Balance for Search Trees with Local Rebalancing.
ESA
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
1997 B conf
Relaxed Balance through Standard Rotations.
WADS
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
1996 J jnl
Efficient Rebalancing of B-Trees with Relaxed Balance.
Int. J. Found. Comput. Sci.
Kim S. Larsen, Rolf Fagerberg
1995 B conf
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
WADS
Joan Boyar, Rolf Fagerberg, Kim S. Larsen
1995 — conf
B-trees with relaxed balance.
IPPS
Kim S. Larsen, Rolf Fagerberg
1995 A conf
Efficient Simplification of Bisimulation Formulas.
TACAS
Uffe Engberg, Kim S. Larsen
1994 — conf
AVL Trees with Relaxed Balance.
IPPS
Kim S. Larsen
1994 J jnl
Bounds on Certain Multiplications of Affine Combinations.
Discret. Appl. Math.
Joan Boyar, Faith E. Fich, Kim S. Larsen
1994 J jnl
Efficient Rebalancing of Chromatic Search Trees.
J. Comput. Syst. Sci.
Joan Boyar, Kim S. Larsen
1994 J jnl
Injectivity of Composite Functions.
J. Symb. Comput.
Kim S. Larsen, Michael I. Schwartzbach
1992 J jnl
A New Formalism for Relational Algebra.
Inf. Process. Lett.
Kim S. Larsen, Michael I. Schwartzbach, Erik Meineche Schmidt
1992 — conf
Efficient Rebalancing of Chromatic Search Trees.
SWAT
Joan Boyar, Kim S. Larsen
1988 — conf
Fully abstract models for a process language with refinement.
REX Workshop
Mogens Nielsen, Uffe Engberg, Kim S. Larsen