skip to main content

Search for: All records

Creators/Authors contains: "Yi, Jun"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract

    2D molecular entities build next-generation electronic devices, where abundant elements of organic molecules are attractive due to the modern synthetic and stimuli control through chemical, conformational, and electronic modifications in electronics. Despite its promising potential, the insufficient control over charge states and electronic stabilities must be overcome in molecular electronic devices. Here, we show the reversible switching of modulated charge states in an exfoliatable 2D-layered molecular conductor based on bis(ethylenedithio)tetrathiafulvalene molecular dimers. The multiple stimuli application of cooling rate, current, voltage, and laser irradiation in a concurrent manner facilitates the controllable manipulation of charge crystal, glass, liquid, and metal phases. The four orders of magnitude switching of electric resistance are triggered by stimuli-responsive charge distribution among molecular dimers. The tunable charge transport in 2D molecular conductors reveals the kinetic process of charge configurations under stimuli, promising to add electric functions in molecular circuitry.

  2. We present improved distributed algorithms for variants of the triangle finding problem in the model. We show that triangle detection, counting, and enumeration can be solved in rounds using expander decompositions . This matches the triangle enumeration lower bound of by Izumi and Le Gall [PODC’17] and Pandurangan, Robinson, and Scquizzato [SPAA’18], which holds even in the model. The previous upper bounds for triangle detection and enumeration in were and , respectively, due to Izumi and Le Gall [PODC’17]. An -expander decomposition of a graph is a clustering of the vertices such that (i) each cluster induces a subgraph with conductance at least and (ii) the number of inter-cluster edges is at most . We show that an -expander decomposition with can be constructed in rounds for any and positive integer . For example, a -expander decomposition only requires rounds to compute, which is optimal up to subpolynomial factors, and a -expander decomposition can be computed in rounds, for any arbitrarily small constant . Our triangle finding algorithms are based on the following generic framework using expander decompositions, which is of independent interest. We first construct an expander decomposition. For each cluster, we simulate algorithms with small overhead by applying the expandermore »routing algorithm due to Ghaffari, Kuhn, and Su [PODC’17] Finally, we deal with inter-cluster edges using recursive calls.« less