How to generate branch tables from SSA form?
The book "A Retargetable C Compiler: Design and Implementation" by Christopher Fraser and David Hanson gives some detail on how they lower switch statements to a combination of conditional branches and jump tables. They cite prior work that their technique builds on, so it would be a good start for a literature survey.

There should be nothing particular to SSA that makes generating jump tables harder or easier. An SSA IR like LLVM can include an explicit instruction for an N-way branch, so that generation of jump tables is really about how to lower such an instruction.

(Update: you've edited the question in a way that makes it clear this isn't really about generating jump tables, but rather about re-discovering switch-style control flow from cascading if statements in an IR. This is again probably not specific to SSA. You might look at the "Relooper" algorithm as implemented for Emscripten which deals with more general control-flow restructuring. I'm not aware of a reference specific to recovering N-way branches, but it seems like simple ad hoc approaches should work well.)