438 search results - page 31 / 88 » On Perfect Switching Classes |
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
152
click to vote
Publication
The Available Bit Rate (ABR) service in ATM networks has been specified to allow fair and efficient support of data applications over ATM utilizing capacity left over after servici...
261
click to vote
Presentation
Latest developments in computer networking and telecommunications are covered in this course via class lectures and assigned readings. Generally topics include developments in the ...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— Despite all the recent advances in the mathematical theories for constructing optical queues by optical Switches and fiber Delay Lines (SDL), there are still many problems tha...
107
click to vote
DM
2007
14 years 11 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...