LFCS reports by Author: J

Jancar, Petr

• Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems
  Petr Jancar
  LFCS report ECS-LFCS-93-261
  
• High Undecidability of Weak Bisimilarity for Petri Nets
  Petr Jancar
  LFCS report ECS-LFCS-94-298
  

Jay, C Barry

• The Structure of free closed categories
  C Barry Jay
  LFCS report ECS-LFCS-89-92
  
• Compositional Characterization of observable Program Properties
  B. Steffen, C.B. Jay, M. Mendler
  LFCS report ECS-LFCS-89-99
  
• Extending properties to categories of partial maps
  C. Barry Jay
  LFCS report ECS-LFCS-90-107
  
• Tail recursion via universal invariants
  C Barry Jay
  LFCS report ECS-LFCS-91-151
  
• Coherence in Category Theory and the Church-Rosser Property
  C B Jay
  LFCS report ECS-LFCS-91-181
  
• Fixpoint and Loop Constructions as Colimits
  C B Jay
  LFCS report ECS-LFCS-91-182
  
• Long Bn Normal Forms and Confluence
  C B Jay
  LFCS report ECS-LFCS-91-183
  
• Modelling Reduction in Confluent Categories
  C B Jay
  LFCS report ECS-LFCS-91-187
  
• Tail Recursion through Universal Invariants
  C B Jay
  LFCS report ECS-LFCS-92-205
  
• The Virtues of Eta-expansion
  C Barry Jay and Neil Ghani
  LFCS report ECS-LFCS-92-243
  

Jerrum, Mark R

• An Analysis of a Monte Carlo Algorithm for Estimating the Permanent
  M. Jerrum
  LFCS report ECS-LFCS-91-164
  
• A Mildly Exponential Approximation Algorithm for the Permanent
  M. Jerrum
  LFCS report ECS-LFCS-91-179
  
• A Sub-logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer
  Leslie Ann Goldberg and Mark Jerrum
  LFCS report ECS-LFCS-92-234
  
• Approximately Counting Hamilton Cycles in Dense Graphs
  Martin Dyer, Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-93-259
  
• Simulated Annealing for Graph Bisection
  Mark Jerrum and Gregory Sorkin
  LFCS report ECS-LFCS-93-260
  
• Uniform sampling modulo a group of symmetries using Markov chain simulation
  Mark Jerrum
  LFCS report ECS-LFCS-93-272
  
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
  Yoram Hirshfeld, Mark Jerrum and Faron Moller
  LFCS report ECS-LFCS-94-286
  
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
  Yoram Hirshfeld, Mark Jerrum and Faron Moller
  LFCS report ECS-LFCS-94-288
  
• A very simple algorithm for estimating the number of k-colourings of a low-degree graph
  Mark Jerrum
  LFCS report ECS-LFCS-94-290
  
• Improved approximation algorithms for MAX k-CUT and MAX BISECTION
  Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-94-292
  
• The Computational Complexity of Counting
  Mark Jerrum
  LFCS report ECS-LFCS-94-296
  
• Generating and counting Hamilton cycles in random regular graphs
  Alan Frieze, Mark Jerrum, Michael Molloy, Robert Robinson and Nicholas Wormald
  LFCS report ECS-LFCS-94-313
  
• Computational Pólya Theory
  Mark Jerrum
  LFCS report ECS-LFCS-95-317
  
• A quasi-polynomial-time algorithm for sampling words from a context-free language
  Vivek Gore and Mark Jerrum
  LFCS report ECS-LFCS-95-326
  
• A New Approach to Polynomial-time Generation of Random Points in Convex Bodies
  Russ Bubley, Martin Dyer and Mark Jerrum
  LFCS report ECS-LFCS-96-343
  
• The Swendsen-Wang process does not always mix rapidly
  Vivek Gore and Mark Jerrum
  LFCS report ECS-LFCS-96-349
  
• Bisimulation equivalence is decidable for normed Process Algebra
  Yoram Hirshfeld and Mark Jerrum
  LFCS report ECS-LFCS-98-386
  
• The ``Burnside process'' converges slowly
  Leslie Ann Goldberg and Mark Jerrum
  LFCS report ECS-LFCS-98-387
  
• On counting independent sets in sparse graphs
  Martin Dyer, Alan Frieze and Mark Jerrum
  LFCS report ECS-LFCS-98-391
  
• Counting unlabelled subtrees of a tree is #P-complete
  Leslie Ann Goldberg and Mark Jerrum
  LFCS report ECS-LFCS-99-417
  

Jones, Claire

• Probabilistic Non-Determinism
  Claire Jones
  LFCS report ECS-LFCS-90-105 (also published as CST-63-90)