Others call this split and merge.

http://en.wikipedia.org/wiki/Meet-in-the-middle_attack

'Wikipedia':http://en.wikipedia.org/wiki/Meet-in-the-middle_attack

ioi 2001 http://olympiads.win.tue.nl/ioi/ioi2001/contest/day2/double/double.pdf

'IOI 2001 Double':http://olympiads.win.tue.nl/ioi/ioi2001/contest/day2/double/double.pdf

A family of diophantine equations (http://web.mit.edu/~mip/www/probs.html)

'A family of diophantine equations / EQS Baraj ONI 2001':http://web.mit.edu/~mip/www/probs.html

http://www.topcoder.com/stat?c=problem_statement&pm=2226&rd=5851&rm=151088&cr=303185

'Problema fotbal (sa se imparta o multime in doua de sume cat mai apropiate) ':http://www.ginfo.ro/revista/14_3/concurs3.pdf

http://www.topcoder.com/stat?c=problem_statement&pm=6742&rd=10763

'TC LongPipes':http://www.topcoder.com/stat?c=problem_statement&pm=2226&rd=5851&rm=151088&cr=303185

problema cerea solutia lexicografic minima pentru o problema a rucsacului unde n era maxim 34 http://www.topcoder.com/tc?module=Static&d1=match_editorials&d2=srm140

'TC KnapsackProblem':http://www.topcoder.com/stat?c=problem_statement&pm=6742&rd=10763
 
'TC Knapsack (problema cerea solutia lexicografic minima pentru o problema a rucsacului unde n era maxim  34) ':http://www.topcoder.com/tc?module=Static&d1=match_editorials&d2=srm140
 
'discrete logarithm problem':http://en.wikipedia.org/wiki/Baby-step_giant-step
 
'UVA 10836':http://acm.uva.es/p/v108/10836.html
 
'TC SplitAndMergeGame':http://www.topcoder.com/stat?c=problem_statement&pm=6449
 
'Colectie':problema/colectie
 
'TC BuildCircuit':http://www.topcoder.com/stat?c=problem_statement&pm=8510&rd=11124&rm=268752&cr=8362207
 
'UVA 704':http://acm.uva.es/p/v7/704.html
 
'UVA 11084 Anagram Division':http://online-judge.uva.es/p/v110/11084.html
 
'UVA 11095 Tabriz City':http://online-judge.uva.es/p/v110/11095.html

discrete logarithm problem http://en.wikipedia.org/wiki/Baby-step_giant-step