Xiaotie Deng

According to our database1, Xiaotie Deng authored at least 303 papers between 1989 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2008, "For contributions to the interface of algorithmic methodology and game theory.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Network Pollution Games.
Algorithmica, 2019

A Novel Business Model for Electric Car Sharing.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018
A Policy Gradient Method with Variance Reduction for Uplift Modeling.
CoRR, 2018

Visual-Texual Emotion Analysis with Deep Coupled Video and Danmu Neural Networks.
CoRR, 2018

Latent Dirichlet Allocation for Internet Price War.
CoRR, 2018

Recent studies of agent incentives in internet resource allocation and pricing.
4OR, 2018

Personalized Behavior Prediction with Encoder-to-Decoder Structure.
Proceedings of the 2018 IEEE International Conference on Networking, 2018

On Bayesian Epistemology of Myerson Auction.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017
How to Design a Common Telecom Infrastructure for Competitors to be Individually Rational and Collectively Optimal.
IEEE Journal on Selected Areas in Communications, 2017

Octahedral Tucker is PPA-Complete.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Smoothed and Average-case Approximation Ratios of Mechanisms: Beyond the Worst-case Analysis.
CoRR, 2017

Pricing ad slots with consecutive multi-unit demand.
Autonomous Agents and Multi-Agent Systems, 2017

Limiting User's Sybil Attack in Resource Sharing.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Agent Incentives of Strategic Behavior in Resource Exchange.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Fast Background Removal Method for 3D Multi-channel Deep Tissue Fluorescence Imaging.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2017, 2017

Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

An autonomous compensation game to facilitate peer data exchange in crowdsensing.
Proceedings of the 25th IEEE/ACM International Symposium on Quality of Service, 2017

2016
Non-approximability of Bimatrix Nash Equilibria.
Encyclopedia of Algorithms, 2016

Arbitrage in Frictional Foreign Exchange Market.
Encyclopedia of Algorithms, 2016

Empirical analysis: stock market prediction via extreme learning machine.
Neural Computing and Applications, 2016

On revenue maximization with sharp multi-unit demands.
J. Comb. Optim., 2016

Power-Law Distributions in a Two-sided Market and Net Neutrality.
CoRR, 2016

Multi-Unit Bayesian Auction with Demand or Budget Constraints.
Computational Intelligence, 2016

Power-Law Distributions in a Two-Sided Market and Net Neutrality.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

GraphSLAM-based Crowdsourcing framework for indoor Wi-Fi fingerprinting.
Proceedings of the 2016 Fourth International Conference on Ubiquitous Positioning, 2016

Fast Nearest Neighbor Search in the Hamming Space.
Proceedings of the MultiMedia Modeling - 22nd International Conference, 2016

The Beachcombers' Problem: Walking and Searching from an Inner Point of a Line.
Proceedings of the Language and Automata Theory and Applications, 2016

When group-buying meets cloud computing.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

Truthfulness of a Proportional Sharing Mechanism in Resource Exchange.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Cost-Efficient Cooperative Sharing of a Complete Wi-Fi Signature Scheme for Indoor Localization in Shopping Malls.
Proceedings of the 13th IEEE International Conference on e-Business Engineering, 2016

New Results for Network Pollution Games.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Understanding PPA-Completeness.
Proceedings of the 31st Conference on Computational Complexity, 2016

Network Pollution Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Incentives for Strategic Behavior in Fisher Market Games.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Understanding PPA-Completeness.
Electronic Colloquium on Computational Complexity (ECCC), 2015

Can Bandwidth Sharing Be Truthful?
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

How to design a common telecom infrastructure by competitors individually rational and collectively optimal.
Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

2014
Users' interest grouping from online reviews based on topic frequency and order.
World Wide Web, 2014

Revenue maximization in a Bayesian double auction market.
Theor. Comput. Sci., 2014

Envy-free pricing in multi-item markets.
ACM Trans. Algorithms, 2014

News impact on stock price return via sentiment analysis.
Knowl.-Based Syst., 2014

Enhancing quantitative intra-day stock return prediction by integrating both market news and stock prices information.
Neurocomputing, 2014

An intelligent market making strategy in algorithmic trading.
Frontiers Comput. Sci., 2014

Optimal reserve prices in weighted GSP auctions.
Electronic Commerce Research and Applications, 2014

The Fisher Market Game: Equilibrium and Welfare.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Pricing Ad Slots with Consecutive Multi-unit Demand.
CoRR, 2013

Pricing Ad Slots with Consecutive Multi-unit Demand.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Exploiting Topic based Twitter Sentiment for Stock Prediction.
Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 2013

2012
Multi-bidding strategy in sponsored search auctions.
J. Comb. Optim., 2012

Algorithmic Solutions for Envy-Free Cake Cutting.
Operations Research, 2012

On Revenue Maximization with Sharp Multi-Unit Demands
CoRR, 2012

Equiseparability on terminal Wiener index.
Appl. Math. Lett., 2012

Hierarchical Clustering on HDP Topics to build a Semantic Tree from Text.
Proceedings of the Second International Workshop on Searching and Integrating New Web Data Sources, 2012

Discovering K Web User Groups with Specific Aspect Interests.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2012

Revenue Maximization in a Bayesian Double Auction Market.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Incentive Ratios of Fisher Markets.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

On the convergence and robustness of reserve pricing in keyword auctions.
Proceedings of the Fourteenth International Conference on Electronic Commerce, 2012

2011
Discrete Fixed Points: Models, Complexities, and Applications.
Math. Oper. Res., 2011

On Nash Dynamics of Matching Market Equilibria
CoRR, 2011

On Incentive Compatible Competitive Selection Protocols.
Algorithmica, 2011

Computation and Incentives of Competitive Equilibria in a Matching Market.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

How Profitable Are Strategic Behaviors in a Market?
Proceedings of the Algorithms - ESA 2011, 2011

Improving Stock Market Prediction by Integrating Both Market News and Stock Prices.
Proceedings of the Database and Expert Systems Applications, 2011

2010
Universal authentication protocols for anonymous wireless communications.
IEEE Trans. Wireless Communications, 2010

Competitive equilibria in matching markets with budgets.
SIGecom Exchanges, 2010

Detecting Market Trends by Ignoring It, Some Days.
J. UCS, 2010

An efficient signcryption scheme with key privacy and its extension to ring signcryption.
Journal of Computer Security, 2010

Universally Balanced Combinatorial Optimization Games.
Games, 2010

Competitive Equilibria in Matching Markets with Budgets
CoRR, 2010

Introduction to the Special Section on Internet and Network Economics.
Algorithmica, 2010

TinyPairing: A Fast and Lightweight Pairing-Based Cryptographic Library for Wireless Sensor Networks.
Proceedings of the 2010 IEEE Wireless Communications and Networking Conference, 2010

Algorithmic Trading Strategy Optimization Based on Mutual Information Entropy Based Clustering.
Proceedings of the Advances in Computation and Intelligence - 5th International Symposium, 2010

Empirical Analysis: News Impact on Stock Prices Based on News Density.
Proceedings of the ICDMW 2010, 2010

Envy-Free Pricing in Multi-item Markets.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Competitive equilibrium computation at advertising marketplaces.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
Competitive Ratio for Portfolio Management.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Combinatorial Optimization Games.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On the complexity of 2D discrete fixed point problem.
Theor. Comput. Sci., 2009

A polynomial-time approximation scheme for embedding hypergraph in a cycle.
ACM Trans. Algorithms, 2009

Finding nucleolus of flow game.
J. Comb. Optim., 2009

Settling the complexity of computing two-player Nash equilibria.
J. ACM, 2009

Algorithmic trading system: design and applications.
Frontiers Comput. Sci. China, 2009

On the complexity of crossings in permutations.
Discrete Mathematics, 2009

On the Complexity of Envy-Free Cake Cutting
CoRR, 2009

A Simplicial Approach for Discrete Fixed Point Theorems.
Algorithmica, 2009

A New Ranking Scheme of the GSP Mechanism with Markovian Users.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Direction Preserving Zero Point Computing and Applications.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Priority Right Auction for Komi Setting.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

TinyPairing: Computing Tate Pairing on Sensor Nodes with Higher Speed and Less Memory.
Proceedings of The Eighth IEEE International Symposium on Networking Computing and Applications, 2009

Chairs' Introduction to Workshop on Computational Finance and Business Intelligence.
Proceedings of the Computational Science, 2009

Equiseparability on Terminal Wiener Index.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
Non-approximability of Bimatrix Nash Equilibria.
Proceedings of the Encyclopedia of Algorithms, 2008

Incentive Compatible Selection.
Proceedings of the Encyclopedia of Algorithms, 2008

Complexity of Bimatrix Nash Equilibria.
Proceedings of the Encyclopedia of Algorithms, 2008

Arbitrage in Frictional Foreign Exchange Market.
Proceedings of the Encyclopedia of Algorithms, 2008

Efficient Phrase-Based Document Similarity for Clustering.
IEEE Trans. Knowl. Data Eng., 2008

A new framework for the design and analysis of identity-based identification schemes.
Theor. Comput. Sci., 2008

Arbitrage opportunities across sponsored search markets.
Theor. Comput. Sci., 2008

Formal Security Definition and Efficient Construction for Roaming with a Privacy-Preserving Extension.
J. UCS, 2008

Two-factor mutual authentication based on smart cards and passwords.
J. Comput. Syst. Sci., 2008

Matching algorithmic bounds for finding a Brouwer fixed point.
J. ACM, 2008

The computation of approximate competitive equilibrium is PPAD-hard.
Inf. Process. Lett., 2008

Forward looking Nash equilibrium for keyword auction.
Inf. Process. Lett., 2008

A Semantics-Based Information Distribution Framework for Large Web-Based Course Forum System.
IJDET, 2008

High Performance Architecture for Elliptic Curve Scalar Multiplication over GF(2m).
IACR Cryptology ePrint Archive, 2008

Preface.
Algorithmica, 2008

Preface.
Algorithmica, 2008

Strategies in Dynamic Pari-Mutual Markets.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Workshop on Computational Finance and Business Intelligence.
Proceedings of the Computational Science, 2008

Fixed Point Computation and Equilibrium.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Multi-bidding Strategy in Sponsored Keyword Auction.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Exposing Homograph Obfuscation Intentions by Coloring Unicode Strings.
Proceedings of the Progress in WWW Research and Development, 2008

2007
Approximate Economic Equilibrium Algorithms.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Anonymous and Authenticated Key Exchange for Roaming Networks.
IEEE Trans. Wireless Communications, 2007

Preface.
Theor. Comput. Sci., 2007

Preface.
Theor. Comput. Sci., 2007

A New Security Definition for Public Key Encryption Schemes and Its Applications.
IACR Cryptology ePrint Archive, 2007

Time Capsule Signature: Efficient and Provably Secure Constructions.
IACR Cryptology ePrint Archive, 2007

Certificateless signature: a new security model and an improved generic construction.
Des. Codes Cryptography, 2007

Recent development in computational complexity characterization of Nash equilibrium.
Computer Science Review, 2007

Settling the Complexity of Computing Two-Player Nash Equilibria
CoRR, 2007

On Walrasian Price of CPU Time.
Algorithmica, 2007

A new suffix tree similarity measure for document clustering.
Proceedings of the 16th International Conference on World Wide Web, 2007

An Efficient Signcryption Scheme with Key Privacy.
Proceedings of the Public Key Infrastructure, 2007

Time Capsule Signature: Efficient and Provably Secure Constructions.
Proceedings of the Public Key Infrastructure, 2007

Properties of Symmetric Incentive Compatible Auctions.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

A More Natural Way to Construct Identity-Based Identification Schemes.
Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007

2006
Detecting Phishing Web Pages with Visual Similarity Assessment Based on Earth Mover's Distance (EMD).
IEEE Trans. Dependable Sec. Comput., 2006

Computation of arbitrage in frictional bond markets.
Theor. Comput. Sci., 2006

REGAP: A Tool for Unicode-Based Web Identity Fraud Detection.
J. Digital Forensic Practice, 2006

On the complexity of market equilibria with maximum social welfare.
Inf. Process. Lett., 2006

An Antiphishing Strategy Based on Visual Similarity Assessment.
IEEE Internet Computing, 2006

On Default Correlation and Pricing of Collateralized Debt Obligation by Copula Functions.
International Journal of Information Technology and Decision Making, 2006

Formal Analysis and Systematic Construction of Two-factor Authentication Scheme.
IACR Cryptology ePrint Archive, 2006

Computing Nash Equilibria: Approximation and Smoothed Complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2006

On the Complexity of 2D Discrete Fixed Point Problem.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Computing Nash Equilibria: Approximation and Smoothed Complexity
CoRR, 2006

Safeguard against unicode attacks: generation and applications of UC-simlist.
Proceedings of the 15th international conference on World Wide Web, 2006

Making Economic Theory Operational.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Sparse Games Are Hard.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

The methodology and an application to fight against Unicode attacks.
Proceedings of the 2nd Symposium on Usable Privacy and Security, 2006

Finding nucleolus of flow game.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Anonymous Signature Schemes.
Proceedings of the Public Key Cryptography, 2006

Evaluation of Stop Word Lists in Chinese Language.
Proceedings of the Fifth International Conference on Language Resources and Evaluation, 2006

Towards Unified Chinese Segmentation Algorithm.
Proceedings of the Fifth International Conference on Language Resources and Evaluation, 2006

A Semantics Based Information Distribution Framework for Large Web-Based Course Forum System.
Proceedings of the Advances in Web Based Learning, 2006

Formal Analysis and Systematic Construction of Two-Factor Authentication Scheme (Short Paper).
Proceedings of the Information and Communications Security, 8th International Conference, 2006

On the Complexity of 2D Discrete Fixed Point Problem.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Computing Nash Equilibria: Approximation and Smoothed Complexity.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Settling the Complexity of Two-Player Nash Equilibrium.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

On Incentive Compatible Competitive Selection Protocol.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

A Simplicial Approach for Discrete Fixed Point Theorems.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Key Replacement Attack Against a Generic Construction of Certificateless Signature.
Proceedings of the Information Security and Privacy, 11th Australasian Conference, 2006

Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Corrigendum to Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs: [J. Combin. Theory Ser. B 91 (2004) 301-325].
J. Comb. Theory, Ser. B, 2005

A PTAS for Semiconductor Burn-in Scheduling.
J. Comb. Optim., 2005

Anonymous Signature Schemes.
IACR Cryptology ePrint Archive, 2005

A minimax portfolio selection strategy with equilibrium.
European Journal of Operational Research, 2005

Settling the Complexity of 2-Player Nash-Equilibrium
Electronic Colloquium on Computational Complexity (ECCC), 2005

3-NASH is PPAD-Complete
Electronic Colloquium on Computational Complexity (ECCC), 2005

On Complexity of Market Equilibria with Maximum Social Welfare
Electronic Colloquium on Computational Complexity (ECCC), 2005

Necessary and Sufficient Conditions for Weak No-Arbitrage in Securities Markets with Frictions.
Annals OR, 2005

Condorcet Winners for Public Goods.
Annals OR, 2005

Detection of phishing webpages based on visual similarity.
Proceedings of the 14th international conference on World Wide Web, 2005

A Potential IRI Based Phishing Strategy.
Proceedings of the Web Information Systems Engineering, 2005

On algorithms for discrete and approximate brouwer fixed points.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Analysis and Improvement of a Signcryption Scheme with Key Privacy.
Proceedings of the Information Security, 8th International Conference, 2005

Phishing Webpage Detection.
Proceedings of the Eighth International Conference on Document Analysis and Recognition (ICDAR 2005), 29 August, 2005

Crossings and Permutations.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

A Group Decision Approach for Information Assessment.
Proceedings of the Internet and Multimedia Systems and Applications, 2005

On Walrasian Price of CPU Time.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Efficient Anonymous Roaming and Its Security Analysis.
Proceedings of the Applied Cryptography and Network Security, 2005

Deposit-Case Attack Against Secure Roaming.
Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

Computation of Arbitrage in a Financial Market with Various Types of Frictions.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Approximate and dynamic rank aggregation.
Theor. Comput. Sci., 2004

Portfolio Selection Theory with Different Interest Rates for Borrowing and Leading.
J. Global Optimization, 2004

Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs.
J. Comb. Theory, Ser. B, 2004

On complexity of single-minded auction.
J. Comput. Syst. Sci., 2004

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time.
J. Comb. Optim., 2004

Parallel Computing Method Of Valuing For Multi-Asset European Option.
International Journal of Information Technology and Decision Making, 2004

A Special Issue On "Computational Finance and Economics" Impact Of It On Some Economics Problems.
International Journal of Information Technology and Decision Making, 2004

A framework of Web-based Decision Support Systems for portfolio selection with OLAP and PVM.
Decision Support Systems, 2004

(2+f(n))-SAT and its properties.
Discrete Applied Mathematics, 2004

Optimal channel assignment in wireless communication networks with distance and frequency interferences.
Computer Communications, 2004

Accessor Variety Criteria for Chinese Word Extraction.
Computational Linguistics, 2004

Minimizing Mean Completion Time in a Batch Processing System.
Algorithmica, 2004

Minimum k Arborescences with Bandwidth Constraints.
Algorithmica, 2004

Practical Fair Anonymous Undeniable Signatures.
Proceedings of the International Conference on Computational Intelligence, 2004

Unsupervised Segmentation of Chinese Corpus Using Accessor Variety.
Proceedings of the Natural Language Processing, 2004

A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract).
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Dynamic Price Sequence and Incentive Compatibility (Extended Abstract).
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Fisher Equilibrium Price with a Class of Concave Utility Functions.
Proceedings of the Algorithms, 2004

Exact Pattern Matching for RNA Secondary Structures.
Proceedings of the Second Asia-Pacific Bioinformatics Conference (APBC 2004), 2004

2003
Approximate sequencing for variable length tasks.
Theor. Comput. Sci., 2003

Genetic Design of Drugs Without Side-Effects.
SIAM J. Comput., 2003

Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics.
J. Scheduling, 2003

On the complexity of price equilibria.
J. Comput. Syst. Sci., 2003

Approximation Algorithms in Batch Processing.
J. Comb. Optim., 2003

A 2-approximation algorithm for path coloring on a restricted class of trees of rings.
J. Algorithms, 2003

Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market.
Electr. Notes Theor. Comput. Sci., 2003

Total Balancedness Condition for Steiner Tree Games.
Discrete Applied Mathematics, 2003

Combinatorial auction across independent markets (extended abstract).
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Metasearch via Voting.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2003

Parallel Computing Method of Valuing for Multi-asset European Option.
Proceedings of the Computational Science - ICCS 2003, 2003

Double Auction in Two-Level Markets.
Proceedings of the Computational Science - ICCS 2003, 2003

Resettable Zero-Knowledge in the Weak Public-Key Model.
Proceedings of the Advances in Cryptology, 2003

Approximate Rank Aggregation (Preliminary Version).
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Majority Equilibrium for Public Facility Allocation (Preliminary Version).
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Channel Assignment in Wireless Mobile Networks with Frequency Interference Over Distance.
Proceedings of the International Conference on Communications in Computing, 2003

2002
A Min-Max Theorem on Feedback Vertex Sets.
Math. Oper. Res., 2002

Center and Distinguisher for Strings with Unbounded Alphabet.
J. Comb. Optim., 2002

On computational complexity of membership test in flow games and linear production games.
Int. J. Game Theory, 2002

Computational Complexity of Arbitrage in Frictional Security Market.
Int. J. Found. Comput. Sci., 2002

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.
Int. J. Found. Comput. Sci., 2002

A new numerical method on American option pricing.
Science in China Series F: Information Sciences, 2002

Text Distinguishers Used in an Interactive Meta Search Engine.
Proceedings of the Advances in Web-Age Information Management, 2002

On the complexity of equilibria.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Reduction Zero-Knowledge.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

A New Notion of Soundness in Bare Public-Key Model.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

Design and Security Analysis of Anonymous Group Identification Protocols.
Proceedings of the Public Key Cryptography, 2002

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

A PTAS for Distinguishing (Sub)string Selection.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

(2+ f(n))-SAT and Its Properties.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
A 2-D parallel convex hull algorithm with optimal communication phases.
Parallel Computing, 2001

Robot Map Verification of a Graph World.
J. Comb. Optim., 2001

On Approximating a Scheduling Problem.
J. Comb. Optim., 2001

A compromise solution to mutual funds portfolio selection with transaction costs.
European Journal of Operational Research, 2001

Using Online Relevance Feedback to Build Effective Personalized Metasearch Engine.
WISE (1), 2001

MOT: Memory Online Tracing of Web Information System.
WISE (1), 2001

A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

On-Line Selection Of Distinguishing Elements For Focused Information Retrieval.
Proceedings of the 2001 IEEE International Conference on Multimedia and Expo, 2001

An Identification Scheme Provably Secure against Reset Attack.
Proceedings of the Information and Communications Security, Third International Conference, 2001

Parallel Models and Job Characterization for System Scheduling.
Proceedings of the Computational Science - ICCS 2001, 2001

Membership for Core of LP Games and Other Games.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Preemptive Scheduling of Parallel Jobs on Multiprocessors.
SIAM J. Comput., 2000

An Approximation Algorithm for Feedback Vertex Sets in Tournaments.
SIAM J. Comput., 2000

Randomized Optimal List Ranking on Coarse-grained Parallel Computers with o(log P) Communication Phases.
Parallel Algorithms Appl., 2000

Wavelength allocation on trees of rings.
Networks, 2000

Totally balanced combinatorial optimization games.
Math. Program., 2000

Graph Algorithms with Small Communication Costs.
J. Comb. Optim., 2000

A linear programming algorithm for optimal portfolio selection with transaction costs.
Int. J. Systems Science, 2000

Solution to a problem on degree sequences of graphs.
Discrete Mathematics, 2000

A 2-Approximation Algorithm for Path Coloring on Trees of Rings.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Arbitrage-Free Asset Pricing in General State Space.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

On Computation of Arbitrage for Markets with Friction.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Decision-making by hierarchies of discordant agents.
Math. Program., 1999

Algorithmic Aspects of the Core of Combinatorial Optimization Games.
Math. Oper. Res., 1999

Exploring an unknown graph.
Journal of Graph Theory, 1999

A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.
Algorithmica, 1999

Competitive Implementation of Parallel Programs.
Algorithmica, 1999

Robot Map Verification of a Graph World.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Approximation Algorithms in Batch Processing.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

A Min-Max Theorem on Feedback Vertex Sets.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Minimizing Mean Response Time in Batch Processing System.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
On Multiprocessor System Scheduling.
J. Comb. Optim., 1998

How to Learn an Unknown Environment I: The Rectilinear Case.
J. ACM, 1998

On Computing and Drawing Maxmin-Height Covering Triangulation.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

A TDI System and its Application to Approximation Algorithms.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
The Cost of Derandomization: Computability or Competitiveness.
SIAM J. Comput., 1997

Competitive Dynamic Multiprocessor Allocation for Parallel Applications.
Parallel Processing Letters, 1997

A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers.
Theory Comput. Syst., 1997

Competitive Analysis of Network Load Balancing.
J. Parallel Distrib. Comput., 1997

Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Combinatorial Optimization Games.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Decision-Making by Hierarchies of Discordant Agents.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Graph Algorithms with Small Communication Costs.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

Parallel Merge Sort on Concurrent-Read Owner-Write PRAM.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
Competitive robot mapping with homogeneous markers.
IEEE Trans. Robotics and Automation, 1996

Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs.
SIAM J. Comput., 1996

Landmark selection strategies for path execution.
Robotics and Autonomous Systems, 1996

A Lower Bound for Communication in the Crossbar.
Inf. Process. Lett., 1996

Distributed Near-Optimal Matching.
Combinatorica, 1996

Competitive Distributed Decision-Making.
Algorithmica, 1996

On Multiprocessor System Scheduling.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Preemptive Scheduling of Parallel Jobs on Multiprocessors.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.
Proceedings of IPPS '96, 1996

1995
Optimal Amortized Distributed Consensus
Inf. Comput., July, 1995

Competitive dynamic multiprocessor allocation for parallel applications.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers.
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

Efficient routing and message bounds for optimal parallel algorithms.
Proceedings of IPPS '95, 1995

Distributed Near-Optimal Matching.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
On the Complexity of Cooperative Solution Concepts.
Math. Oper. Res., 1994

Good algorithm design style for multiprocessors.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

A Convex Hull Algorithm on Coarse-Grained Multiprocessors.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Competitive Implementation of Parallel Programs.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Robot Mapping: Foot-Prints versus Tokens.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Landmark selection for path execution.
Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems, 1993

1992
Recognition and Representation of Proper Circular Arc Graphs.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

Competitive Distributed Decision-Making.
Proceedings of the Algorithms, Software, Architecture, 1992

1991
On path lengths modulo three.
Journal of Graph Theory, 1991

Server Problems and Resistive Spaces.
Inf. Process. Lett., 1991

More powerful closure operations on graphs.
Discrete Mathematics, 1991

Optimal Amortized Distributed Consensus (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

How to Learn an Unknown Environment (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
An Optimal Parallel Algorithm for Linear Programming in the Plane.
Inf. Process. Lett., 1990

Deterministic load balancing in computer networks.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Exploring an Unknown Graph (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Implicit-degrees and circumferences.
Graphs and Combinatorics, 1989

On the Parallel Complexity of Integer Programming.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989


  Loading...