A novel algorithm for diagnosing bridging faults in combinational circuits is presented. The voting model and its simplifications, the Wired-AND and Wired-OR models, are assumed. The diagnosis algorithm guarantees the "object bridging fault" (bridging fault in the circuit being diagnosed) to be in the final fault list. The novelty of the algorithm are: (i) unlike previous algorithms it does not use the full fault dictionary but uses only portions of the stuck-at fault dictionary which is computed dynamically; (ii) it enumerates the faults implicitly using a compact data structure; and (iii) fault dropping rules, using stuck-at fault simulation only, are used. The resulting algorithm is both time and space efficient. Experimental evaluation of the algorithm is presented. 1 Introduction In a circuit when two or more distinct lines are unintentionly connected, due to a defect, we have a bridging fault. Bridging faults model 40% to 50% of physical faults in contemporary MOS technologies [..