Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
ional Abstraction Steps Lone Leth Thomsena Bent Thomsena Kurt Nørmarka a. Department of Computer Science, Aalborg University, Denmark In this paper we discuss computational abstra...
Over the past decade, it has been established that a good education in software engineering requires a specialized program of study different from traditional computer science prog...
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...