In which year was Krivelevich elected as a member of the Fellows of the American Mathematical Society?
2017
Ido Ben-Eliezer et al.: Comparing the strength of query types in property testing: The case of testing k-colorability. (2008) authored by Michael Krivelevich. Noga Alon et al.: Parameterized Algorithms for Directed Maximum Leaf Problems. (2007) authored by Michael Krivelevich. Noga Alon et al.: Scalable Secure Storage when Half the System Is Faulty. (2000) authored by Michael Krivelevich. Nemanja Draganic et al.: On embedding problems in sparse expanders. (2009) authored by Michael Krivelevich. Noga Alon et al.: The Number of f-Matchings in Almost Every Tree is a Zero Residue. (2008) authored by Michael Krivelevich. Oded Goldreich et al.: Long cycles in subgraphs of (pseudo)random directed graphs. (2012) authored by Michael Krivelevich. Michael Krivelevich is the author of Oded Goldreich et al.: Hierarchy Theorems for Property Testing. (2009). Dan Hefetz et al.: Waiter-Client and Client-Waiter planarity, colorability and minor games. (2016). Amin Coja-Oghlan et al.: Contagious Sets in Expanders. (2015) authored by Michael Krivelevich. He serves as an editor-in-chief of the Journal of Combinatorial Theory (Series B) and is on the editorial board of several other journals in the field.
[INST]
Utilize the provided context information, to generate answers to the following question: 
- Generate the answer to the question based on the provided context.
- Avoid including any explanations or apologies in your responses.
- Only respond to questions that ask for the answer to the target question without any additional information.
- Strictly provide the answer without any additional text.
Question: In which year was Krivelevich elected as a member of the Fellows of the American Mathematical Society?
Context: Ido Ben-Eliezer et al.: Comparing the strength of query types in property testing: The case of testing k-colorability. (2008) authored by Michael Krivelevich. Noga Alon et al.: Parameterized Algorithms for Directed Maximum Leaf Problems. (2007) authored by Michael Krivelevich. Noga Alon et al.: Scalable Secure Storage when Half the System Is Faulty. (2000) authored by Michael Krivelevich. Nemanja Draganic et al.: On embedding problems in sparse expanders. (2009) authored by Michael Krivelevich. Noga Alon et al.: The Number of f-Matchings in Almost Every Tree is a Zero Residue. (2008) authored by Michael Krivelevich. Oded Goldreich et al.: Long cycles in subgraphs of (pseudo)random directed graphs. (2012) authored by Michael Krivelevich. Michael Krivelevich is the author of Oded Goldreich et al.: Hierarchy Theorems for Property Testing. (2009). Dan Hefetz et al.: Waiter-Client and Client-Waiter planarity, colorability and minor games. (2016). Amin Coja-Oghlan et al.: Contagious Sets in Expanders. (2015) authored by Michael Krivelevich. He serves as an editor-in-chief of the Journal of Combinatorial Theory (Series B) and is on the editorial board of several other journals in the field.
[/INST] Answer:
