Reports in Informatics

Dep. of
Informatics

Publi-
kasjoner

[2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991]

[1990 | 1989 | 1988 | 1987 | 1986 | 1985 | 1984 | 1983 | 1982 | 1981]

Guidelines

If a particular report is not available, please contact the author(s), or send a request for a paper copy of the report to:

Department of Informatics
University of Bergen
POB 7800
N-5020 Bergen
Norway

Please note that if you are looking for a complete overview of scientific publications at the department you should look at the individual home pages.

Author guidelines

2008:

380. Lennart Frimannslund, Geir Gundersen, Dag Haugland: Sensitivity Analysis Applied to the Pooling Problem. December 2008. (PDF)
379. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Algorithms for vertex subset and vertex partitioning problems with runtime single exponential in rankwidth. November 2008. (PDF)
378. Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: H-join and algorithms on graphs of bounded rankwidth. November 2008. (PDF)
377. Irina Naydenova, Torleiv Kløve: Optimal binary and ternary t-EC-AUED codes. November 2008. (PDF)
376. Torleiv Kløve: Spheres of Permutations under the Infinity Norm - Permutations with limited displacement. November 2008. (PDF)
375. Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster parameterized algorithms for minimum fill-in. August 2008. (PDF)
374. Jean-Paul Balabanian, Martin Ystad, Ivan Viola, Arvid Lundervold, Helwig Hauser, Eduard Gröller: Hierarchical Volume Visualization of Brain Anatomy. August 2008. (PDF)
373. Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances Rosamond: Clustering with partial information. April 2008. (PDF)
372. Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos: Cutwidth of split graphs, threshold graphs, and proper interval graphs. February 2008. (PDF)
371. Kjell J. Hole, Thomas Tjøstheim, Vebjørn Moen, Lars-Helge Netland, Yngve Espelid, and André N. Klingsheim: Next Generation Internet Banking in Norway. February 2008. (PDF)
370. André N. Klingsheim and Kjell J. Hole: Personal Information Leakage: A Study of Online Systems in Norway. February 2008. (PDF)
369. Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. February 2008. (PDF)
368. Anya Helene Bagge, Valentin David, Magne Haveraaen: Testing with Concepts and Axioms in C++. October 2008. (PDF)
367. Magne Haveraaen, John Power, Monika Seisenberger (Eds.): CALCO Young Researchers Workshop -- CALCO-jnr 2007 -- Selected Papers. February 2008. (PDF)
366. Feodor F. Dragan, Fedor V. Fomin, and Petr A. Golovach: Spanners in sparse graphs. February 2008. (PDF)
365. Pinar Heggernes and Rodica Mihai: Mixed search number of permutation graphs. January 2008. (PDF)
364. M. El Ghami and C. Roos: A Generic Primal-dual Interior Point Methods Based on a New Kernel Function. January 2008. (PDF)

2007:

363. Marc Bezem, Dag Hovland, and Hoang Truong: A Type System for Counting Instances of Software Components. October 2007; updated April 2008. (PDF)
362. Pinar Heggernes, Daniel Meister, and Charis Papadopoulos: Graphs of small bounded linear clique-width. October 2007. (PDF)
361. Uwe Wolter and Zinovy Diskin: From Indexed to Fibred Semantics - The Generalized Sketch File. October 2007. (PDF)
360. Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the Complexity of Reconstructing H-free Graphs from their Star Systems. August 2007. (PDF)
359. Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch: A Measure & Conquer Approach for the Analysis of Exact Algorithms. July 2007. (PDF)
358. Uwe Wolter and Zinovy Diskin: The next hundred diagrammatic specification techniques – an introduction to generalized sketches. July 2007. (PDF)
357. Frederic Dorn, Fedor V. Fomin and Dimitrios M. Thilikos: Catalan Structures and Dynamic Programming in H-minor-free graphs. July 2007. (PDF)
356. Pinar Heggernes, Dieter Kratsch and Daniel Meister: Bandwidht of bipartite permutation graphs in polynomial time. July 2007. (PDF)
355. Federico Mancini: Minimum fill-in and treewidth of split+ke and split+kv graphs. June 2007. (PDF)
354. Pinar Heggernes, Daniel Meister, and Charis Papadopoulos: A new representation of proper interval graphs with an application to clique-width. June 2007. (PDF)
353. Frederic Dorn, Fedor V. Fomin and Dimitrios M. Thilikos: Subexponential parameterized algorithms. April 2007. (PDF)
352. Daniel Lokshtanov, Federico Mancini and Charis Papadopoulos: Computing and extracting minimal cograph completions in linear time. April 2007, revised February 2008. (PDF)
351. Daniel Meister, Jan Arne Telle and Martin Vatshelle: Characterization and recognition of digraphs of bounded Kelly-width. March 2007. (PDF)
350. Daniel Meister: A characterisation of the minimal triangulations of permutation graphs. March 2007. (PS),(PDF)
349. Frederic Dorn: How to use planarity efficiently: new tree-decomposition based algorithms. March 2007. (PDF)
348. Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, and Yngve Villanger: Improved Algorithms for the Feedback Vertex Set Problems. March 2007. (PDF)
347. Fedor V. Fomin, Pinar Heggernes, and Rodica Mihai: Mixed search number and linear-width of interval and split graphs. February 2007. (PDF)
346. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, and Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. February 2007. (PDF)
345. Pinar Heggernes and Charis Papadopoulos: Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. February 2007. (PDF)
344. Serge Gaspers and Mathieu Liedloff: A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. January 2007. (PDF)
343. Pinar Heggernes and Barry W Peyton: Fast computation of minimal fill inside a given elimination ordering. January 2007. (PDF)
342. Irina Naydenova and Torleiv Kløve: Necessary conditions for codes to be good for error detection. January 2007. (PDF)

2006:

341. M. El Ghami, T. Steihaug, and C. Roos: Primal-dual IPMs for Semidefinite Optimization Based on Finite Barrier Functions. December 2006. (PDF)
340. Jean-Paul Balabanian, Ivan Viola, Egil Ona, Ruben Patel, and Eduard Gröller: Sonar Explorer: A New Tool for Visualization of Fish Schools from 3D Sonar Data. December 2006. (PDF)
339. Pinar Heggernes and Dieter Kratsch: Linear-time certifying algorithms for recognizing trivially perfect graphs. December 2006. (PDF)
337. Fedor V. Fomin, Serge Gaspers, Saket Saurabh, and Alexey A.Stepanov: On Two Techniques of Combining Branching and Treewidth. December 2006. (PDF)
336. Pinar Heggernes, Christophe Paul, Jan Arne Telle, and Yngve Villanger: Interval Completion is Fixed Parameter Tractable. November 2006. (PDF)
335. Y.Q. Bai, G. Lesaja, C. Roos, G.Q. Wang, and M. El Ghami : A Class of Large- and Small-update Primal-dual Interior-point Algorithms for Linear Optimization. November 2006. (PDF)
334. Pinar Heggernes and Federico Mancini: A completely dynamic algorithm for split graphs. November 2006. (PDF)
333. Daniel Lokshtanov: Determining treelength is hard. October 2006. (PDF)
332. Fedor V. Fomin and Alexey A. Stepanov: Counting minimum weighted dominating sets. October 2006. (PDF)
331. Khalid A. Mughal, Yngve Espelid and Torill Hamre: Composing Web Presentations using Presentation Patterns. August 2006. (PDF)
330. Michał Walicki: Modalities as Interactions between Classical and Intuitionistic Logics. June 2006. (PDF)
329. Michał Walicki and Uwe Wolter: Universal Multialgebra II. June 2006. (PDF)
328. Pinar Heggernes and Dieter Kratsch: Linear-time certifying algorithms for recognizing split graphs and related graph classes. June 2006. (PDF)
327. Geir Gundersen and Trond Steihaug: Sparsity in Higher Order Methods in Optimization. June 2006. (PDF)
326. Daniel Lokshtanov: Finding the longest isometric cycle in a graph. June 2006. (PDF)
325. Michał Walicki: Modalities as Interactions between Classical and Constructive Logics. May 2006. (PDF)
324. Fedor V. Fomin, Serge Gaspers, and Artem V. Pyatkin: Finding a Minimum Feedback Vertex Set in time $O(1.7548n)$. April 2006. (PDF)
323. Sergey V. Kitaev and Artem V. Pyatkin: On avoidance of V- and Λ-patterns in permutations. April 2006. (PDF)
322. Serge Gaspers, Dieter Kratsch and Mathieu Liedloff: Exponential time algorithms for the minimum dominating set problem on some graph classes. April 2006. (PDF)
321. Frederic Dorn: Dynamic programming and fast matrix multiplication. April 2006. (PDF)
320. Frederic Dorn, Fedor V. Fomin and Dimitrios M. Thilikos: Fast subexponential algorithm for non-local problems on graphs of bounded genus. April 2006. (PDF)
319. Lennart Frimannslund and Trond Steihaug: A class of methods combining L-BFGS and truncated Newton. April 2006. (PDF)
318. Lennart Frimannslund and Trond Steihaug: Using Partial Separability of Functions in Generating Set Search Methods for Unconstrained Optimisation. March 2006. (PDF)
317. Pinar Heggernes, Federico Mancini, and Charis Papadopoulos: Minimal comparability completions. March 2006. (PDF)
316. Fedor V. Fomin and Dimitrios M. Thilikos: On Self Duality of Pathwidth in Polyhedral Graph Embeddings. March 2006. (PDF)
315. Fangwei Fu and Torleiv Kløve: Large Binary Codes for Error Detection. February 2006. (PDF)
314. Michał Walicki, Uwe Wolter, and Jack Stecher: A category for studying the standarization of reporting languages. January 2006. (PDF)

2005:

313. Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch: Measure and Conquer: A Simple $O(20.288n)$ Independent Set Algorithm. November 2005. (PDF)(PS)
312. Sergey Kitaev and Artem Pyatkin: On representable graphs. November 2005. (PDF)
311. Pinar Heggernes and Federico Mancini: Minimal split completions of graphs. September 2005. (PDF)
310. Tor Helleseth and Alexander Kholosha: Monomial and quadratic bent functions over the finite fields of odd characteristic. September 2005. (PDF)
309. Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin and Alexey A. Stepanov: Bounding the Number of Minimal Dominating Sets: a Measure and Conquer Approach. September 2005. (PDF)(PS)
308. Igor Semaev: On solving sparse algebraic equations over finite fields. September 2005. (PDF)
307. Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch: Some new techniques in design and analysis of exact (exponential) algorithms. September 2005. (PDF)(PS)
306. John Erik Mathiassen: Improved Collision Attack on OCB. September 2005. (PDF)
305. Joanna Bauer, Dag Haugland and Di Yuan: Analysis and Computational Study of Flow-based Formulations for Minimum-Energy Multicasting in Wireless Ad Hoc Networks. August 2005. (PDF)
304. Thomas Ågotnes and Natasha Alechina: The Dynamics of Syntactic Knowledge. September 2005. (PDF)
303. Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, and Fedor V. Fomin: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. July 2005. (PDF)(PS)
302. Yngve Villanger: Counting and listing all potential maximal cliques of a graph. June 2005. (PDF)
301. Fedor V. Fomin, Pinar Heggernes and Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. May 2005. (PDF)(PS)
300. Fedor V. Fomin, Pierre Fraigniaud and Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. May 2005. (PDF)(PS)
298. Fedor V. Fomin and Kjartan Høie: Pathwidth of cubic graphs and exact algorithms. May 2005. (PDF)(PS)
297. Fedor V. Fomin, Frédéric Mazoit, and Ioan Todinca: Computing branchwidth via efficient triangulations and blocks. May 2005. (PDF)(PS)
296. Frederic Dorn and Fedor V. Fomin: Sphere Cut Branch Decomposition: Subexponential Algorithms on Planar Graphs. April 2005. (PDF)(PS)
295. Pål Ellingsen: Iterative decoding for the asymmetric channel. April 2005. (PDF)
294. Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch: Measure and Conquer: Domination -- A Case Study. April 2005. (PDF)(PS)
293. Frederic Dorn and Jan Arne Telle: Dynamic programming on tree-decompositions versus branch-decompositions. April 2005. (PDF)(PS)
292. Michał Walicki: Universal Multialgebra. June 2005. (PDF)
291. Fedor V. Fomin and Artem V. Pyatkin: Finding minimum feedback vertex set in bipartite graph. February 2005. (PDF)(PS)
290. Pinar Heggernes and Daniel Lokshtanov: Optimal broadcast domination of arbitrary graphs in polynomial time. February 2005. (PDF)(PS)
289. Hans Georg Schaathun and Marcel Fernandez-Muñoz: Boneh-Shaw fingerprinting and soft decision decoding. January 2005. (PDF)

2004:

288. Di Yuan, Joanna Bauer, Dag Haugland: An Integer Programming Approach for Performance Evaluation of Minimum-Energy Broadcasting and Multicasting in Wireless Ad Hoc Networks. December 2004. (PDF)
287. Dag Haugland: Mathematical programming in petroleum production and refining. December 2004. (PDF)
286. Sin C. Ho and Dag Haugland: Local search heuristics for the probabilistic dial-a-ride problem. November 2004. (PDF)
285. Constanza Riera, George Petrides and Matthew G. Parker: Generalised Bent Criteria for Boolean Functions. November 2004. (PDF)
284. Sverre Storøy: On the Transportation Paradox. November 2004. (PDF)
283. Håvard Raddum: Solving Non-linear Sparse Equation Systems over GF(2) Using Graphs. October 2004. (PDF)
282. Sin C. Ho and Michel Gendreau: Path relinking for the vehicle routing problem. October 2004. (PDF)
281. Terje Espelid: A Test of OUADPACK and Four Doubly Adaptive Quadrature Routines. October 2004. (PDF)
280. Daniel Lokshtanov og Christian Sloper: Fixed Parameter Set Splitting, Obtaining a Linear Kernel and Improving Running Time. August 2004. (PDF)
279. Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing Minimal Triangulations in O(n^α log n) Time. July 2004. (PDF)
278. Borislav V. Minchev: Computing analytic matrix functions for a class of exponential integrators. June 2004. (PDF)
277. Marc Bezem and Hoang Truong: Counting Instances of Software Components. June 2004. (PDF)
276. Borislav V. Minchev: Lie group integrators with nonautonomous frozen vector fields. June 2004. (PDF)
275. Hans Georg Schaathun: Binary Collusion-Secure Codes: Comparison and Improvements. June 2004. (PDF)
274. John Erik Mathiassen and Lars R. Knudsen: Linear Known Plaintext Attack on DES. June 2004. (PDF)
273. Fedor V. Fomin, Pierre Fraigniaud, and Dimitrios M. Thilikos: The Price of Connectedness in Expansions. May 2004. (PDF)
272. Hajo Broersma, Fedor V. Fomin, and Gerhard J. Woeginger: Parallel knock-out schemes in networks. May 2004. (PDF)
271. Hans L. Bodlaender and Fedor V. Fomin: Equitable colorings of bounded treewidth graphs. May 2004. (PDF)
270. Fedor V. Fomin, Dieter Kratsch, and Gerhard J. Woeginger: Exact (exponential) algorithms for the dominating set problem. May 2004. (PDF)
269. Fedor V. Fomin and Dimitrios M. Thilikos: Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. May 2004. (PDF)
268. Fedor V. Fomin, Ioan Todinca and Dieter Kratsch: Exact (exponential) algorithms for treewidth and minimum fill-in. May 2004. (PDF)
267. Eirik Rosnes and Øyvind Ytrehus: On the Design of Bit-Interleaved Turbo-Coded Modulation with Low Error Floors. (PDF)
266. Terje O. Espelid: Extended Doubly Adaptive Quadrature Routines. (PS)
265. Eirik Rosnes: Upper-Bounding the Minimum Average Cycle Weight of Classes of Convolutional Codes. (PDF,PS)
264. Pinar Heggernes: Minimal Triangulations of Graphs. (PDF,PS)
263. Hans Georg Schaathun: Fighting Three Pirates with Scattering Codes. (PDF,PS)
262. Mike Fellows, Pinar Heggernes, Frances Rosamond, Christian Sloper, and Jan Arne Telle: Exact algorithms for finding k disjoint triangles in an arbitrary graph. (PDF)
261. Yngve Villanger: Lex M versus MCS-M. (PS)

2003:

260. Dag Haugland, Sin C. Ho and Gilbert Laporte: Designing delivery districts for the vehicle routing problem with stochastic demands. (PS)
258. Fedor V. Fomin and Dimtirios M. Thilikos: A Simple and Fast Approach for Solving Problems on Planar Graphs . (PDF)
257. Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimtirios M. Thilikos: Bidimensional Parameters and Local Treewidth . (PDF)
256. Hans Georg Schaathun: The Boneh-Shaw Fingerprinting Scheme is better than we thought. . (PDF)
255. R. I. McLachlan and A. Zanna: The Discrete Moser-veselov Algorithm For The Free Rigid Body, Revisited. (PDF)
254. Shahadat Hossain and Trond Steihaug : Optimal Direct Determination of Sparse Jacobian Matrices . (PS,PDF)
253. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimtirios M. Thilikos: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. (PS,PDF)
252. Wende Chen and Torleiv Kløve: On The Second Greedy Weight For Linear Codes Of Dimension At Least 4. (PS,PDF)
251. Fedor V. Fomin and Dimtirios M. Thilikos: Dominating Sets and Local Treewidth. (PS,PDF)
250. Marc A. Bezem and Hoang A. Truong: A Typing System For The Safe Instantiation Of Components. (PDF)
249. Jean R. S. Blair, Pinar Heggernes, Steve Horton and Fredrik Manne Broadcast Domination Algorithms For Interval Graphs, Series-parallel Graphs, and Trees. (PS,PDF)
248. Gérard D. Cohen, Hans Georg Schaathun: Asymptotic Overview on Separating Codes April 2003. (PS,PDF)
247. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, and Gerhard J. Woeginger : Backbone colorings for networks. (PS,PDF)
246. Fedor V. Fomin, Pinar Heggernes, and Jan Arne Telle: Graph searching, elimination trees, and a generalization of bandwidth. (PS,PDF)
245. Erik D. Demaine, Fedor V.Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos: Fixed-Parameter Algorithms for the (k,r)-Center in Planar Graphs and Map Graphs. April 2003. (PS,PDF)
244. Stein Krogstad, Hans Zanna Munthe-Kaas and Antonella Zanna Generalized Polar Coordinates On Lie Groups And Numerical Integrators. April 2003. (PDF)
243. A. Berry, J.-P. Bordat, P. Heggernes, G. Simonet and Y. Villanger A Wide Range Algorithm for Minimal Triangulation from an Arbitrary Ordering. (PS)
242. Matthew G. Parker and Chintha Tellambura: A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio. February 2003. (PS,PDF)
241. Eirik Rosnes and Øyvind Ytrehus Avoiding Cycles In Combined Turbo Decoding And Channel Estimation For Correlated Fading Channels. (PS,PDF)
240. Fedor V. Fomin and Dimitrios M. Thilikos: New upper bounds on the decomposability of planar graphs and fixed parameter algorithms. January 2003. (PS,PDF)
239. Fedor V. Fomin and Dimitrios M. Thilikos: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-up. January 2003. (PS,PDF)

2002:

238. Helge Avlesen, Jarle Berntsen and Gunnar Furnes On The Current Conditions Along The Ormen Lange Pipeline Path During An Extreme, Idealized Storm Passage.
237. Dag Haugland and Sin C. Ho (eds): Proceedings of Nordic MPS '02 - The Eighth Meeting of the Nordic Section of the Mathematical Programming Society . December 2002.
236. Ole Kåre Endresen and Dag Haugland: Optimal adjustment of surfaces to point sets. November 2002. (PS)
235. Dag Haugland and Sverre Storøy: Local searach methods for $l$₁-minimization in a data compression problem. November 2002. (PS)
234. Sin C. Ho and Dag Haugland: A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows and Split Deliveries. October 2002. (PS)
233. Christian Sloper: Broadcast Coloring of Trees. September 2002. (PS)
232. Jean R. S. Blair and Fredrik Manne: Efficient Self-stabilizing Algorithms for Tree Networks. March 2002. (PS)
231. Martin Gairing, Stephan T. Hedetniemi, Alice A. Mcrae and Petter Kristiansen: Self-stabilizing Algorithms For K-domination. June 2002.
230. Martin Gairing, Robert M. Geist, Stephan T. Hedetniemi and Petter Kristiansen A Self-stabilizing Algorithm For Maximal 2-packing. June 2002.
229. T. O. Espelid: Doubly adaptive quadrature routines based on Newton-Cote rules. May 2002. (PS, PDF)
228. Yngve Lamo and Michał Walicki Qualifier-free Logic For Multialgebraic Theories. April 2002. (PS, PDF)
227. Yngve Lamo and Michał Walicki: Logic With Equality For Multialgebras - An Application Of Rasiowa-sikorski Technique. January 2002. (see rather its better version in 228 PS, PDF)
226. Assefaw H. Gebremedhin, Fredrik Manne and Alex Pothen: Graph Coloring in Optimization Revisited. January 2002. (PS)
225. Ragnhild Blikberg and Tor Sørevik: Costs and Savings of Adaptive Mesh Refinement. November 2001. (PS)
224. Thomas Ågotnes and Michał Walicki: Only Explicitly Knowing. Februar 2002. (PS)
223. Shahadat Hossain and Trond Steihaug: Sparsity issues in the computation of Jacobian Matrices. January 2002. (PS, PDF)

2001:

222. Marielba Rojas and Trond Steihaug: An Interior-Point Trust-Region-Based Method for Large-Scale Nonnegative Regularization. December 2001. (PS)
221. Dag Haugland and Sverre Storøy: A Combinatorial Optimization Model for Vector Selection in Frame Based Signal Representation. December 2001. (Word)
220. Antonella Zanna: Error analysis for exponential splitting based on the generalized polar decomposition I: local and global bounds. December 2001. (PDF)
219. Andrzej Suslowicz: Application of numerical Lie group integrators to parabolic PDEs. December 2001. (PS)
218. A.H. Gebremedhin, I.G. Lassous, J. Gustedt, and J.A. Telle: PRO: a model for Parallel Resource-Optimal computation. November 2001. (PS)
217. Hans Zanna Munthe-Kaas, G. R. W. Quispel and Antonella Zanna Munthe-Kaas: Application of symmetric spaces and lie triple systems in numerical analysis. November 2001. (PDF)
216. Stein Krogstad: A low complexity lie group method on the Stiefel manifold. JULY 2001.
215. Wende Chen and Torleiv Kløve: Weight hierarchies of linear codes satisfying the almost chain condition. May 2001. (PS, PDF)
214. Pinar Heggernes, Stanley Eisenstat, Gary Kumfert, and Alex Pothen: The computational complexity of the minimum degree algorithm. April 2001. (PS, PDF)
213. Jan Arne Telle: Tree-decompositions of small pathwidth. April 2001.
212. Krister Åhlander: Supporting tensor symmetries in EinSum. June 2001. (PS)
211. Hans Georg Schaathun: Duality and Weights of Linear Codes and Projective Multisets. May 2001. (PS)

2000:

210. YNGVE LAMO AND MICHAŁ WALICKI: SPECIFICATION OF PARAMETERIZED DATA TYPES. DECEMBER 2000. (PS, PDF)
209. YNGVE LAMO AND MICHAŁ WALICKI: THE INSTITUTION OF MULTIALGEBRAS. NOVEMBER 2000.(PS, PDF)
208. MAGNE HAVERAAEN: A 2-TIRED SOFTWARE PROCESS MODEL FOR UTILIZING CASL. OCTOBER 2000.
207. LARS R. KNUDSEN: BLOCK CHAINING MODES OF OPERATION. OKTOBER 2000. (PS)
206. BJØRN PETER TJØSTHEIM: COMPUTATION OF CORNER SINGULARITIES FOR THE BIHARMONIC EIGENVALUE PROBLEM, WITH GUARANTEED ENCLOSURES FOR THE FIRST EIGENVALUE AND EIGENVECTOR ON A SQUARE. OCTOBER 2000.
205. VENANSIUS BARYAMUREEBA: A BASIS BASED LOW-RANK CORRECTION PRECONDITIONER FOR SEQUENCES OF WEIGHTED LEAST SQUARES PROBLEMS. SEPTEMBER 2000.
204. VENANSIUS BARYAMUREEBA: SOLUTIONS OF ROBUST LINEAR REGRESSION PROBLEMS BY KRYLOV SUBSPACE METHODS. SEPTEMBER 2000.
203. VENANSIUS BARYAMUREEBA: THE IMPACT OF EQUAL-WEIGHTING OF BOTH LOW-CONFIDENCE AND HIGH-CONFIDENCE OBSERVATIONS ON ROBUST LINEAR REGRESSION COMPUTATION. SEPTEMBER 2000.
202. KENTH ENGØ: PARTITIONED RUNGE-KUTTA METHODS IN LIE-GROUP SETTING. SEPTEMBER 2000. (PS)
201. KENTH ENGØ: ON THE BCH-FORMULA IN so(3). SEPTEMBER 2000. (PDF) (PS)
200. ANTONELLA ZANNA AND HANS ZANNA MUNTHE-KAAS: GENERALIZED POLAR DECOMPOSITIONS FOR THE APPROXIMATION OF THE MATRIX EXPONENTIAL. AUGUST 2000. (PS)
199. HELGE AVLESEN AND JARLE BERNTSEN: A 2KM RESOLUTION STUDY OF THE SKAGERAK CIRCULATION, WITH A COMPARISON OF THREE INTERNAL PRESSURE SCHEMES. MAY 2000.
198. VENANSIUS BARYAMUREEBA: PRECONDITIONERS FOR SEQUENCES OF WEIGHTED LINEAR SYSTEMS. JULY 2000.
197. PETTER BJØRSTAD, MAKSYMILIAN DRYJA AND TALAL RAHMAN: ADDITIVE AVERAGE SCHWARZ METHODS FOR ELLIPTIC MORTAR FINITE ELEMENT PROBLEMS. MAY 2000.
196. WENDE CHEN AND TORLEIV KLØVE: WEIGH HIERARCHIES OF EXTREMAL NON-CHAIN TERNARY CODES OF DIMENSION 4. MAY 2000. (PS,PDF)
195. K.A. MUGHAL, A.L. OPDAHL AND D.I.K. SJØBERG: PROCEEDINGS OF NWPER'2000 - NORDIC WORKSHOP ON PROGRAMMING ENVIRONMENT RESEARCH. MAY 2000.
194. PETTER KRISTIANSEN AND JAN ARNE TELLE: GENERALIZED H-COLORING OF GRAPHS. MAY 2000.
193. TALAL RAHMAN: ADDITIVE SCHWARZ METHODS FOR SOME ELLIPTIC PROBLEMS (DR.SCIENT. THESIS). MAY 2000.
192. ANTONELLA ZANNA: RECURRENCE RELATION FOR THE THE FACTORS IN THE POLAR DECOMPOSITION ON LIE GROUPS. MAY 2000. (PS)
191. HANS MUNTHE-KAAS, R.G.W. QUISPEL AND ANTONELLA ZANNA: THE POLAR DECOMPOSITION ON LIE GROUPS WITH INVOLUTIVE AUTOMORPHISMS. MAY 2000. (PS)
190. JENS GUSTEDT, OLE A. MÆHLE AND JAN ARNE TELLE: NOT ALL JAVA PROGRAMS ARE STRUCTURED. APRIL 2000.
189. LARS R. KNUDSEN: TRAWLING TWOFISH. APRIL 2000. (PDF) (PS)
188. VENANSIUS BARYAMUREEBA AND TROND STEIHAUG: ON THE CONVERGENCE OF AN INEXACT PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING. MARCH 2000. (PS)
187. VENANSIUS BARYAMUREEBA: SOLUTION OF ROBUST LINEAR REGRESSION PROBLEMS BY PRECONDITIONED CONJUGATE GRADIENT METHODS. MARCH 2000.
186. VENANSIUS BARYAMUREEBA: SOLUTION OF LARGE-SCALE WEIGHTED LEAST SQUARES PROBLEMS. MARCH 2000.
185. XIAOBING FENG AND TALAL RAHMAN: AN ADDITIVE AVERAGE SCHWARZ METHOD FOR THE PLATE BENDING PROBLEM. FEBRUARY 2000.
184. VENANSIUS BARYAMUREEBA AND TROND STEIHAUG: ON THE PROPERTIES OF PRECONDITIONERS FOR ROBUST LINEAR REGRESSION. FEBRUAR 2000. (PS)
183. KENTH ENGØ: THE BERGEN OCEAN MODEL BENCHMARK 1.0. FEBRUARY 2000. (PDF) (PS)
182. ALEKSANDER MALYSHEV: ON DEFLATION FOR SYMMETRIC TRIDIAGONAL MATRICES. JANUARY 2000. (PS)

162. MAGNE HAVERAAEN: ABSTRACTIONS FOR PROGRAMMING PARALLEL MACHINES. DECEMBER 1998.
161. ALEKSANDER MALYSHEV: STABILITY RADII OF SYMPLECTIC AND HAMILTONIAN MATRICES. NOVEMBER 1998. (PS)
160. ALEKSANDER MALYSHEV: OPTIMAL BACKWARD PERTURBATION BOUNDS FOR THE LINEAR LEAST SQUARES PROBLEM OF DEFICIENT RANK. NOVEMBER 1998. (PS)
159. FREDRIK MANNE: A PARALLEL ALGORITHM FOR COMPUTING THE EXTREMAL EIGENVALUES OF VERY LARGE SPARSE MATRICES. NOVEMBER 1998. (PS)
158. KENTH ENGØ: ON THE CONSTRUCTION OF GEOMETRIC INTEGRATORS IN THE RKMK CLASS. OCTOBER 1998. (PDF) (PS)
157. HELGE AVLESEN, JARLE BERNTSEN AND TERJE ESPELID: A CONVERGENCE STUDY OF TWO PROGNOSTIC, SIGMA COORDINATE OCEAN MODELS ON A DENSITY DRIVEN FLOW IN A QUADRATIC BASIN. AUGUST 1998.
156. TORE BURHEIM: RESTRICTED FEATURE STRUCTURE GRAMMARS (DR.SCIENT.THESIS). JUNE 1998.
155. ROLF ERSTAD: CODING AND DECODING OF HIGH DENSITY MAGNETIC RECORDING SYSTEMS (DR.SCIENT.THESIS). MAY 1998.
154. CHUNMING RONG: COMPUTATIONAL ANALYSIS IN ALGEBRAIC DECODING, APN-MAPPINGS AND t-DESIGNS (DR.SCIENT.THESIS). FEBRUARY 1998.
153. CHUNMING RONG, TOR HELLESETH AND JYRKI LAHTONEN: DECODING THE $Z$₄ LINEAR CALDERBANK-MCGUIRE CODE UPTO ITS MINIMUM LEE DISTANCE. JUNE 1998.
152. KHALID A. MUGHAL AND ANDREAS L. OPDAHL: PROCEEDINGS OF NWPER'98, NORDIC WORKSHOP ON PROGRAMMING ENVIRONMENT RESEARCH, BERGEN, JUNE 1416. JUNE 1998.
151. LARS RAMKILDE KNUDSEN: DEAL A 128BIT BLOCK CIPHER. FEBRUARY 1998.
150. J. E. DENNIS AND TROND STEIHAUG: A FERRIS-MANGASARIAN TECHNIQUE APPLIED TO LINEAR LEAST SQUARES PROBLEMS. MAY 1998. (PDF) (PS)
149. LARS RAMKILDE KNUDSEN AND WILLI MEIER: A SQUARE ROOT ATTACK ON (ALLEGED) RC4. APRIL 1998.
148. HANS MUNTHE-KAAS AND BRYNJULF OWREN: COMPUTATIONS IN A FREE LIE ALGEBRA. MARCH 1998. (PS)
147. WENDE CHEN AND TORLEIV KLØVE: CLASSIFICATION OF THE WEIGHT HIERARCHIES OF BINARY LINEAR CODES OF DIMENSION 4. MARCH 1998. (PDF,PS)
146. A.K.M.SHAHADAT HOSSAIN: ON THE COMPUTATION OF SPARSE JACOBIAN MATRICES AND NEWTON STEPS (DR.SCIENT.THESIS). MARCH 1998.
145. HELGE AVLESEN: A STUDY OF TWO NEW SPLITTING METHODS FOR THE GRAVITY PART OF THE SHALLOW WATER EQUATIONS. JANUARY 1998.

1997:

144. KHALID A. MUGHAL AND ROLF W. RASMUSSEN: INTRODUCING JAVA AS FIRST PROGRAMMING LANGUAGE. DECEMBER 1997.
143. MAGNE HAVERAAEN AND STEINAR SØREIDE: SOLVING RECURSIVE PROBLEMS IN LINEAR TIME USING CONSTRUCTIVE RECURSION. DECEMBER 1997.
142. TOR HELLESETH, CHUNMING RONG AND KYEONGCHEOL YANG: A 3 - ($25$,7,105) DESIGN FROM GOETHALS CODES OVER $Z$₄ . DECEMBER 1997.
141. BENGT ASPVALL, MAGNUS M. HALLDORSSON AND FREDRIK MANNE: APPROXIMATIONS FOR THE GENERAL BLOCK DISTRIBUTION OF A MATRIX. DECEMBER 1997. (PS)
140. ALEKSANDER MALYSHEV: ON WILKINSON'S PROBLEM. NOVEMBER 1997. (PS)
139. TOR HELLESETH AND TORLEIV KLØVE: ABSTRACTS: IEEE INFORMATION THEORY WORKSHOP, LONGYEARBYEN, JULY 612, 1997. OCTOBER 1997.
138. MAGNUS HALLDORSSON, JAN KRATOCHVIL AND JAN ARNE TELLE: INDEPENDENT SETS WITH DOMINATION CONSTRAINTS. SEPTEMBER 1997.
137. TOR HELLESETH, CHUNMING RONG AMD KYEONGCHEOL YANG: NEW INFINITE FAMILIES OF 3-DESIGNS FROM PREPARATA CODES OVER $Z$₄. SEPTEMBER 1997.
136. TERJE O. ESPELID AND JARLE BERNTSEN: STABILITY OF DIFFERENT SCHEMES APPLIED TO THE PROPAGATION OF SHALLOW-WATER INERTIA-GRAVITY WAVES IN REGIONS WITH VARYING DEPTH. JUNE 1997.
135. ALVIS BRAZMA, INGE JONASSEN, INGVAR EIDHAMMER, ESKO UKKONEN: RELATION PATTERNS AND THEIR AUTOMATIC DISCOVERY IN BIOSEQUENCES. JUNE 1997.
134. SANDRA HEDETNIEMI, STEPHEN HEDETNIEMI, ALICE MCRAE, DEE PARKS, JAN ARNE TELLE: ITERATED COLORINGS OF GRAPHS. MAY 1997.
133. INGVAR EIDHAMMER, DAVID GILBERT, INGE JONASSEN AND MADU RATNAYAKE: A CONSTRAINT BASED STRUCTURE DESCRIPTION LANGUAGE FOR BIOSEQUENCES. APRIL 1997.
132. KENTH ENGØ AND ARNE MARTHINSEN: APPLICATION OF GEOMETRIC INTEGRATION TO SOME MECHANICAL PROBLEMS. APRIL 1997. (PDF) (PS)
131. TROND STEIHAUG AND YASEMIN YALCINKAYA: ASYNCRONOUS METHODS AND LEAST SQUARES: AN EXAMPLE OF DETERIORATING CONVERGENCE. APRIL 1997. (PDF) (PS)
130. ERNST GABIDULIN AND TORLEIV KLØVE: ON THE NEWTON RADIUS. FEBRUARY 1997.

1996:

129. JAN ARNE TELLE: A LINEAR-TIME ALGORITHM TO FIND A GRAPH WITH PRESCRIBED DEGREES OF ADJACENT VERTICES. DECEMBER 1996.
128. SYLVIA B. ENCHEVA: ON SELF-DUAL CODES OVER GF(3) AND THEIR COORDINATE ORDERING. DECEMBER 1996.
127. SYLVIA B. ENCHEVA AND G. D. COHEN: SELF-ORTHOGONAL CODES AND THEIR COORDINATE ORDERING. NOVEMBER 1996.
126. WENDE CHEN AND TORLEIV KLØVE: WEIGHT HIERARCHIES OF LINEAR CODES SATISFYING THE CHAIN CONDITION. NOVEMBER 1996.
125. WENDE CHEN AND TORLEIV KLØVE: BOUNDS ON THE WEIGHT HIERARCHIES OF LINEAR CODES OF DIMENSION 4. NOVEMBER 1996.
124. ANDRZEJ PROSKUROWSKI AND JAN ARNE TELLE: FROM BANDWIDTH k TO PATHWIDTH k. OCTOBER 1996.
123. ANCA VERMESAN: DEVELOPING VERIFIABLE KNOWLEDGE BASED SYSTEMS (DR.SCIENT.THESIS) AUGUST 1996.
122. HANS MUNTHE-KAAS: RUNGE-KUTTA METHODS ON LIE GROUPS. AUGUST 1996.
121. HANS MUNTHE-KAAS AND DANIEL EKE: UNIFORMLY CONVERGING SCHEMES FOR DISCONTINUOUS SEISMIC WAVE PROBLEMS. JUNE 1996. (PS)
120. PINAR HEGGERNES AND PONTUS MATSTOMS: FINDING GOOD COLUMN ORDERINGS FOR SPARSE QR FACTORIZATION. JUNE 1996. (PS)
119. FREDRIK MANNE AND TOR SØREVIK: PARTITIONING AN ARRAY ONTO A MESH OF PROCESSORS. JUNE 1996. (PS)
118. INGE JONASSEN: EFFICIENT DISCOVERY OF CONSERVED PATTERNS USING A PATTERN GRAPH. MARCH 1996.
117. MICHAŁ WALICKI, MAGNE HAVERAAEN AND SIGURD MELDAL: COMMUNICATION ALGEBRAS. MARCH 1996. (PS)
116. INGE JONASSEN, CARSTEN HELGESEN AND DESMOND HIGGINS: SCORING FUNCTION FOR PATTERN DISCOVERY PROGRAMS TAKING INTO ACCOUNT SEQUENCE DIVERSITY. FEBRUARY 1996.
115. JEAN BLAIR, PINAR HEGGERNES AND JAN ARNE TELLE: MAKING AN ARBITRARY FILLED GRAPH MINIMAL BY REMOVING FILL EDGES. FEBRUARY 1996. (PS)

1995:

114. MARIANNE FJELLTVEIT HOLE: HIGH RATE CONVOLUTIONAL CODES: LOW COMPLEXITY DECODING AND STRUCTURAL ANALYSIS (DR.SCIENT.THESIS). DECEMBER 1995.
113. ALVIS BRAZMA, INGE JONASSEN, INGVAR EIDHAMMER AND DAVID GILBERT: APPROACHES TO THE AUTOMATIC DISCOVERY OF PATTERNS IN BIOSEQUENCES. DECEMBER 1995.
112. KHALID A. MUGHAL AND LARS SØRAAS: ATTRIBUTE EVALUATION USING NEIGHBOUR FUNCTIONS. DECEMBER 1995.
111. WENDE CHEN AND TORLEIV KLØVE: ON THE WEIGHT HIERARCHIES OF q-ARY CODES OF DIMENSION 4. NOVEMBER 1995.
110. ARNE LØKKETANGEN: TABU SEARCH AS A METAHEURISTIC GUIDE FOR COMBINATORIAL OPTIMIZATION PROBLEMS (DR.SCIENT.THESIS). OCTOBER 1995.
109. A.K.M.SHAHADAT HOSSAIN AND TROND STEIHAUG: COMPUTING A SPARSE JACOBIAN MATRIX BY ROWS AND COLUMNS. OCTOBER 1995. (PS)
108. MAGNE HAVERAAEN AND ERIC G. WAGNER: GUARDED ALGEBRAS AND DATA TYPE SPECIFICATION. OCTOBER 1995.
107. PINAR HEGGERNES AND JAN ARNE TELLE: PARTITIONING GRAPHS INTO GENERALIZED DOMINATING SETS. JUNE 1995. (PS)
106. NOBORU HAMADA AND TOR HELLESETH: CONSTRUCTION OF COME OPTIMAL TERNARY LINEAR CODES AND THE UNIQUENESS OF [294,6,195:3]-CODES MEETING THE GRIESMER BOUND. APRIL 1995.
105. HANS MUNTHE-KAAS: COORDINATE FREE NUMERICS, PART 2.: LIE-BUTCHER THEORY FOR RUNGE-KUTTA METHODS. MARCH 1995.
104. MICHAŁ WALICKI AND SIGURD MELDAL: ALGEBRAIC APPROACHES TO NONDETERMINISM AN OVERVIEW. FEBRUARY 1995. (PS)
103. BENGT ASPVALL, PINAR HEGGERNES AND JAN-ARNE TELLE: A SIMPLE CUBIC ALGORITHM FOR COMPUTING MINIMUM HEIGHT ELIMINATION TREES FOR INTERVAL GRAPHS. JANUARY 1995. (PS)
102. HANS MUNTHE-KAAS: AN ALGEBRAIC THEORY FOR REGULAR DATA MAPPINGS ON PARALLEL COMPUTERS. MARCH 1995. (PS)
101. HANS MUNTHE-KAAS AND MAGNE HAVERAAEN: COORDINATE FREE NUMERICS, PART 1.: HOW TO AVOID INDEX WRESTLING IN TENSOR COMPUTATIONS. MARCH 1995. (PS)
100. MAGNE HAVERAAEN AND VYTAUTAS CYRAS: THE STRUCTURAL BLANKS APPROACH TO SOLVING GENERALIZED RECURRENCES. APRIL 1995.

1994:

99. ERIK RØNNEBERG HAUGE: DEBRUIJN SEQUENCES AND NON-LINEAR RECURSION. OCTOBER 1994.
98. REGIMANTAS PLIUSKEVICIUS: SATURATED CALCULUS FOR A RESTRICTED FIRST ORDER CONTINUOUS FIXPOINT LINEAR TEMPORAL LOGIC. AUGUST 1994.
97. KJELL JØRGEN HOLE: A STOCHASTIC LEARNING ALGORITHM FOR FEED-FORWARD NEURAL NETWORKS OF HARD-LIMITING UNITS. JULY 1994.
96. MICHAŁ WALICKI: SINGULAR AND PLURAL NONDETERMINISTIC PARAMETERS: MULTIALGEBRAS, POWER ALGEBRAS AND COMPLETE REASONING SYSTEMS. JUNE 1994.
95. VICTOR AARRE AND HANS MUNTHE-KAAS: OPTIMIZING OVERLOADED ARITHMETIC OPERATORS IN C++. JUNE 1994.
94. CARSTEN HELGESEN: APPROXIMATE PATTERN MATCHING: ALGORITHMS AND APPLICATIONS IN MOLECULAR BIOLOGY. APRIL 1994.
93. HANS MUNTHE-KAAS AND SUDHANSU ARYA: 2D PRESTACK MIGRATION ON THE MASPAR MP-2 MASSIVELY PARALLEL COMPUTER. APRIL 1994.
92. VALENTINAS KRIAUCIUKAS AND MICHAŁ WALICKI: REASONING AND REWRITING WITH SET-RELATIONS I: GROUND COMPLETENESS. APRIL 1994.

1993:

91. TERJE KÅRSTAD: MASSIVELY PARALLEL ALGORITHMS IN RESERVOIR SIMULATION. SEPTEMBER 1993.
90. INGVAR EIDHAMMER: EXTENDING CONSTRAINT SATISFACTION PROBLEMS WITH VALUE CONSTRAINTS. DECEMBER 1993.
89. SOFOKLIS G. EFREMIDIS, KHALID A. MUGHAL AND JOHN H. REPPY: AML: ATTRIBUTE GRAMMARS IN ML. DECEMBER 1993.
88. MARIANNE FJELLTVEIT: TABLE-LOOKUP DECODING OF CONVOLUTIONAL CODES ON PARTIAL-RESPONSE CHANNELS. NOVEMBER 1993.
87. TOR HELLESETH, TORLEIV KLØVE AND ØYVIND YTREHUS: ON GENERALIZATIONS OF THE GRIESMER BOUND. SEPTEMBER 1993.
86. KURT JØRNSTEN, RAINER LEISTEN AND SVERRE STORØY: GRADIENT SCHEMES IN ITERATIVE AGGREGATION PROCEDURES FOR VARIABLE-AGGREGATED LP-PROBLEMS. AUGUST 1993.
85. CHRISTOPHER GIERTSEN: VOLUME VISUALIZATION OF NUMERICAL SIMULATION DATA. JUNE 1993.
84. FREDRIK MANNE AND HJALMTYR HAFSTEINSSON: EFFICIENT SPARSE CHOLESKY FACTORIZATION ON A PARALLEL SIMD COMPUTER. JUNE 1993. (PS)
83. BJØRN OLSTAD AND FREDRIK MANNE: EFFICIENT PARTITIONING OF SEQUENCES WITH AN APPLICATION TO SPARSE MATRIX COMPUTATIONS. JUNE 1993. (PS)
82. WENDE CHEN AND TORLEIV KLØVE: LOWER BOUNDS ON MULTIPLE DISTINCT SUMS SETS. APRIL 1993.
81. SJUR DIDRIK FLÅM: APPROIXIMATE ITERATES OF AVERAGED AND RELAXED FIRMLY NONEXPANSIVE MAPPINGS. MARCH 1993.
80. BENGT ASPVALL AND PINAR HEGGERNES: FINDING MINIMUM HEIGHT ELIMINATION TREES FOR INTERVAL GRAPHS IN POLYNOMIAL TIME. MARCH 1993. (PS)
79. ÅSA HALLEFJORD, KURT JØRNSTEN AND SVERRE STORØY: TRAFFIC EQUILIBRIUM PARADOXES WHEN TRAVEL DEMAND IS ELASTIC. FEBRUARY 1993.
78. SIGURD MELDAL AND MAGNE HAVERAAEN: PROCEEDINGS OF THE 4TH NORDIC WORKSHOP ON PROGRAM CORRECTNESS. APRIL 1993.
77. TOR SØREVIK AND SAHNI DALJEET SINGH: PARALLELIZING A FORTRAN-77 CODE FOR SEISMIC SIMULATION ON THE MASPAR MP-1. FEBRUARY 1993.

1992:

76. TROND-HENNING OLESEN: PARALLEL SPARSE MATRIX ALGORITHMS. DECEMBER 1992.
75. MICHAŁ WALICKI: CALCOLI FOR NON-DETERMINISTIC SPECIFICATIONS: THREE COMPLETENESS RESULTS. DECEMBER 1992.
74. TERJE O. ESPELID AND ALAN GENZ: ON THE SUBDIVISION STRATEGY IN ADAPTIVE CUBATURE ALGORITHMS FOR TRIANGULAR REGIONS. DECEMBER 1992.
72. TROND STEIHAUG AND A.K.M.SHAHADAT HOSSAIN: GRAPH COLORING AND THE ESTIMATION OF SPARSE JACOBIAN MATRICES USING ROW AND COLUMN PARTITIONING. NOVEMBER 1992. (PS)
71. SVERRE STORØY AND TOR SØREVIK: AN SIMD, FINE-GRAINED, PARALLEL ALGORITHM FOR THE DENSE LINEAR ASSIGNMENT PROBLEM. OCTOBER 1992.
70. SYLVIA ENCHEVA AND TORLEIV KLØVE: CODES SATISFYING THE CHAIN CONDITION. OCTOBER 1992.
69. RANDI MOE: ITERATIVE LOCAL UNIFORM MESH REFINEMENT METHODS AND PARALLEL PROCESSING. JUNE 1992.
68. ØYVIND YTREHUS: A NOTE ON HIGH RATE BINARY CONVOLUTIONAL CODES. AUGUST 1992. (PS)
67. ERIK BOMAN: SCIENTIFIC BENCHMARKING AND HOW TO SOLVE THE SLALOM BENCHMARK PROBLEM. APRIL 1992.
66. MORTEN DAHLBERG SKOGEN: SCHWARZ METHODS AND PARALLELISM. FEBRUARY 1992.
65. TOR HELLESETH, TORLEIV KLØVE AND ØYVIND YTREHUS: EXCESS SEQUENCES OF CODES AND THE CHAIN CONDITION. JULY 1992.
64. KJELL JØRGEN HOLE: COSETS FOR CONVOLUTIONAL CODES FOR SYMBOL SYNCHRONIZATION AND ERROR CONTROL. JUNE 1992.
63. SYLVIA BORISSOVA ENCHEVA: OPTIMAL BINARY LINEAR CODES. JUNE 1992.
62. FREDIK MANNE AND TOR SØREVIK: OPTIMAL PARTITIONING OF SEQUENCES. JUNE 1992. (PS)
61. HANS MUNTHE-KAAS: GENERALIZED SHUFFLE EXCHANGE NETWORKS. JUNE 1992.
60. ØYVIND YTREHUS: CONSTRUCTIONS AND PROOFS OF NONEXISTENCE OF SOME CONVOLUTIONAL CODES. APRIL 1992. (PS)
59. FREDRIK MANNE: AN ALGORITHM FOR COMPUTING A MINIMUM HEIGHT ELIMINATION TREE FOR A TREE. FEBRUARY 1992. (PS)
58. KJELL JØRGEN HOLE: RUNLENGTH LIMITED ERROR CONTROL CODES OF HIGH RATES. FEBRUARY 1992.

1991:

57. PETTER BJØRSTAD, JEREMY COOK, HANS MUNTHE-KAAS AND TOR SØREVIK: IMPLEMENTATION OF A SAR PROCESSING ALGORITHM ON MASPAR MP-1208. OCTOBER 1991.
56. PETTER BJØRSTAD, JON BRÆKHUS AND ANDERS HVIDSTEN: PARALLEL SUBSTRUCTURING ALGORITHMS IN STRUCTURAL ANALYSIS, DIRECT AND ITERATIVE METHODS. JANUARY 1991.
55. PETTER BJØRSTAD AND ERIK BOMAN: A NEW ALGORITHM FOR THE SLALOM BENCHMARK. MAY 1991.
54. PETTER BJØRSTAD AND MORTEN D. SKOGEN: DOMAIN DECOMPOSITION ALGORITHMS OF SCHWARZ TYPE, DESIGNED FOR MASSIVELY PARALLEL COMPUTERS. MARCH 1991.
53. P. BJØRSTAD, F.MANNE, T.SØREVIK AND M.VAJTERSIC: EFFICIENT MATRIX MULTIPLICATION ON SIMD COMPUTERS. MARCH 1991. (PS)
52. HANS MUNTHE-KAAS: SUPER PARALLEL FFT's. MAY 1991.
51. FREDRIK MANNE: REDUCING THE HEIGHT OF AN ELIMINATION TREE THROUGH LOCAL RECORDINGS. JUNE 1991. (PS)
50. TOR SØREVIK: TRIANGULAR SOLVERS FOR MASSIVELY PARALLEL SIMD COMPUTERS. JUNE 1991.
49. SVERRE STORØY: WEIGHTS IMPROVEMENT IN COLUMN AGGREGATION. JANUARY 1991.

1990:

48. MARIAN VAJTERSIC: MATRIX MULTIPLICATION ALGORITHMS FOR MATRICES OF THE SIZE n 128 ON THE MASPAR PARALLEL COMPUTER. AUGUST 1990.
47. TORLEIV KLØVE: K-SEQUENCES, A GENERALIZATION OF SONAR SEQUENCES AND B-SEQUENCES. JUNE 1990.
46. JARLE BERNTSEN, RONALD COOLS AND TERJE O. ESPELID: A TEST OF DECUTET. JUNE 1990.
45. MAGNE HAVERAAEN: DATA DEPENDENCIES AND SPACE-TIME ALGEBRAS IN PARALLEL PROGRAMMING. (ALSO PUBLISHED AS YALE UNIVERSITY REPORT TR-784.) JUNE 1990.
44. JARLE BERNTSEN AND TERJE O. ESPELID: DEGREE 13 SYMMETRIC QUADRATURE RULES FOR THE TRIANGLE. MARCH 1990.
43. BJØRNAR TESSEM: GRAPH PROPAGATION OF INTERVAL AND FUZZY TRUTH CONSTRAINTS. FEBRUARY 1990.

1989:

42. BJØRNAR TESSEM: EXTENDING THE A/R ALGORITHM FOR INTERVAL PROBABILITY PROPAGATION. DECEMBER 1989.
41. TOR HELLESETH AND ØYVIND YTREHUS: HOW TO FIND A [33,8,14] CODE. NOVEMBER 1989. (PS)
40. JARLE BERNTSEN AND TERJE O. ESPELID: A TEST OF DCUTRI AND TWODQD. NOVEMBER 1989.
39. BJØRNAR TESSEM: INTERVAL PROBABILITY PROPAGATION. OCTOBER 1989.
38. ØYVIND YTREHUS: A RATE 3/8 (1,3) CONSTRAINED CODE WITH FREE HAMMING DISTANCE 3. SEPTEMBER 1989. (PS)
37. SIGURD MELDAL: EXTENDING CSP WITH TERMINATION INDEPENDENT PROCESS ACTIVATION. AUGUST 1989.
36. KJELL J. OVERHOLT: THE PALGORITHMS FOR EXTRAPOLATION. JUNE 1989.
35. BJØRNAR TESSEM: TRUTH MAINTENANCE IN INFINITELY-VALUED LOGIC. MARCH 1989.
34. JARLE BERNTSEN: TRITST: A SUBROUTINE FOR EVALUATING THE PERFORMANCE OF SUBROUTINES FOR AUTOMATIC INTEGRATION OVER TRIANGLES. JANUARY 1989.

1988:

33. TERJE O. ESPELID: INTEGRATION RULES, NULL RULES AND ERROR ESTIMATION. DECEMBER 1988.
32. PETTER MøLLER: BRUK AV STRUKTURELL INFORMASJON I FORM AV N-GRAM OG STATISTISK INFORMASJON I FORM AV EN MODIFISERT VITERBI-ALGORITME I KARAKTERGJENKJENNING. OCTOBER 1988.
31. JARLE BERNTSEN, TERJE O. ESPELID AND ALAN GENZ: A TEST OF ADMINT. SEPTEMBER 1988.
30. JARLE BERNTSEN: PRACTICAL ERROR ESTIMATION IN ADAPTIVE MULTIDIMENSIONAL QUADRATURE ROUTINES. APRIL 1988.

1987:

29. JARLE BERNTSEN: ADAPTIVE MULTIDIMENSIONAL QUADRATURE ROUTINES ON SHADED MEMORY PARALLEL COMPUTERS. OCTOBER 1987.
28. TOR SØREVIK AND TERJE O. ESPELID: FULLY SYMMETRIC INTEGRATION RULES FOR THE 4CUBE. AUGUST 1987.
27. JARLE BERNTSEN AND TERJE O. ESPELID: A PARALLEL GLOBAL ADAPTIVE QUADRATURE ALGORITHM FOR HYPERCUBES. MARCH 1987.
26. ØYVIND YTREHUS: CODE-BUSTER: A SOFTWARE TOOL FOR CHARACTERIZING ABSTRACT CODES. MARCH 1987.
25. BENGT ASPVALL: LINEAR INEQUALITIES. MARCH 1987.
24. JARLE BERNTSEN AND MORTEN SKOGEN: PROGRAMS FOR TESTING AUTOMATIC QUADRATURE ROUTINES. FEBRUARY 1987.

1986:

23. TORLEIV KLØVE: BOUNDS ON THE SIZE OF OPTIMAL DIFFERENCE TRIANGLE SETS. DECEMBER 1986.
22. SJUR D. FLÅM: STABILITY OF CONVEX PROGRAMS UNDER A DISTRIBUTED CONSTRAINT QUALIFICATION. NOVEMBER 1986.
21. TOR HELLESETH AND ØYVIND YTREHUS: NEW BOUNDS ON THE MINIMUM LENGTH OF BINARY BLOCK CODES OF DIMENSION 8. SEPTEMBER 1986.
20. JARLE BERNTSEN: A TEST OF SOME WELL KNOWN DIMENSIONAL GENERAL PURPOSE AUTOMATIC QUADRATURE ROUTINES. JUNE 1986.
19. ADI BEN-ISRAEL AND SVERRE STORØY: ON THE COMPUTATION OF BASIC FEASIBLE SOLUTIONS IN LINEAR PROGRAMMING. JUNE 1986.
18. SVERRE STORØY: PARALLEL VERTEX ENUMERATION A HOLISTIC APPROACH. FEBRUARY 1986.

1985:

17. JARLE BERNTSEN: CAUTIOUS ADAPTIVE NUMERICAL INTEGRATION OVER THE 3CUBE. JULY 1985.
16. JARLE BERNTSEN AND TERJE O. ESPELID: ON THE CONSTRUCTION OF HIGHER DEGREE THRE DIMENSIONAL EMBEDDED INTEGRATIONS RULES. MAY 1985.
15. JARLE BERNTSEN: A TEST OF THE NAG SOFTWARE FOR AUTOMATIC NUMERICAL INTEGRATION OVER THE 3CUBE. MARCH 1985.
14. MAGNE HAVERAAEN: UNIFICATION OF THE LOOP-STRUCTURES. FEBRUARY 1985.

1984:

13. TERJE O. ESPELID: ON THE CONSTRUCTION OF GOOD FULLY SYMMETRIC INTEGRATION RULES. OCTOBER 1984.
12. SVERRE STORØY: ON THE RELATIVE RANKING OF COMPUTER SYSTEMS. JULY 1984.
11. JARLE BERNTSEN: ON THE SUBDIVISION STRATEGY IN NUMERICAL ADAPTIVE INTEGRATION OVER THE CUBE. MAY 1984.
10. MAGNE MYRTVEIT: HANDLING SEVERAL WINDOWS ON ALPHANUMERIC DISPLAYS. MARCH 1984.
9. TORLEIV KLØVE: CODES FOR ERROR CORRECTION AND DETECTION. JANUARY 1984.
8. TORLEIV KLØVE: GENERALIZATION OF THE KORZHIK BOUND. JANUARY 1984.

1983:

7. JARLE BERNTSEN AND TERJE O. ESPELID: ON THE CONSTRUCTION OF MINIMUM POINT SYMMETRIC THREE DIMENSIONAL EMBEDDED INTEGRATION RULES FOR ADAPTIVE INTEGRATION SCHEMES. JULY 1983.
6. JARLE BERNTSEN AND TERJE O. ESPELID: ON THE USE OF GAUSS QUADRATURE IN ADAPTIVE AUTOMATIC INTEGRATION SCHEMES. APRIL 1983.
5. TORLEIV KLØVE: L CODES ON ALPHABETS WITH TWO SYMBOLS. APRIL 1983.

1982:

4. JARLE BERNTSEN: NUMERICAL COMPUTATION OF A THREE-DIMENSIONAL INTEGRAL. NOVEMBER 1982.
3. STEIN W. WALLACE: ENUMERATION ALGORITHM IN LINEAR PROGRAMMING. FEBRUARY 1982.

1981:

2. PER OFSTAD: PROGRAM ENTRY AND INSPECTION SYSTEM (PEIS). A PROJECT PROPOSAL. NOVEMBER 1981.
1. KHALID AZIM MUGHAL: INTERACTIVE CONSTRUCTION, SYNTAX ANALYSIS AND EDITING OF PROGRAMS. OCTOBER 1981.