The following pages link to S. Tragoudas (Q187135):
Displaying 16 items.
- Fast approximation algorithms for multicommodity flow problems (Q1892218) (← links)
- Test-set partitioning for multi-weighted random LFSRs (Q2734608) (← links)
- (Q4028112) (← links)
- Maximum weighted independent sets on transitive graphs and applications (Q4225377) (← links)
- Transmissions in a network with capacities and delays (Q4254351) (← links)
- SEARCHING A PSEUDO 3-SIDED SOLID ORTHOCONVEX GRID (Q4291546) (← links)
- Implementing and clustering modules with complex delays (Q4397088) (← links)
- On the use of counters for reproducing deterministic test sets (Q4420787) (← links)
- Retiming-based partial scan (Q4420910) (← links)
- Min-cut partitioning on underlying tree and graph structures (Q4420947) (← links)
- BIPARTITIONING INTO OVERLAPPING SETS (Q4852316) (← links)
- Improved approximations for the minimum-cut ratio and the flux (Q4866679) (← links)
- On the computation of fast data transmissions in networks with capacities and delays (Q5057443) (← links)
- An Online Failure Detection Method for Data Buses Using Multithreshold Receiving Logic (Q5277659) (← links)
- Computational analysis of counter-based schemes for VLSI test pattern generation (Q5936462) (← links)
- Computing disjoint paths with length constraints (Q6550560) (← links)